Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$

DOI10.1007/978-3-319-53733-7_1zbMath1485.68245OpenAlexW2588368184MaRDI QIDQ5738984

Pavlos Marantidis, Franz Baader, Oliver Fernández Gil

Publication date: 1 June 2017

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53733-7_1

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (1)

Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures

Cites Work

• Tractable approximate deduction for OWL
• Automata-based axiom pinpointing
• Weighted automata and weighted logics with discounting
• Skew and infinitary formal power series
• Similarity-based relaxed instance queries
• Unification in the Description Logic EL
• Approximate Unification in the Description Logic $$\mathcal {FL}_0$$
• A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts
• Adding Threshold Concepts to the Description Logic $\mathcal{EL}$
• Undecidability of the unification and admissibility problems for modal and description logics
• Unification of concept terms in description logics
• Non-standard inferences in description logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$