"Approximation in Description Logics: How Weighted Tree Automata Can Help ..."

Franz Baader, Oliver Fernandez Gil, Pavlos Marantidis (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-53733-7_1

access: closed

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lata/BaaderGM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lata/BaaderGM17
Franz Baader, Oliver Fernandez Gil, Pavlos Marantidis:
Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in FL_0. LATA 2017: 3-26

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.