Approximate Unification in the Description Logic $$\mathcal {FL}_0$$

DOI10.1007/978-3-319-48758-8_4zbMath1483.68364OpenAlexW2546288571MaRDI QIDQ2835862

Franz Baader, Alexander Okhotin, Pavlos Marantidis

Publication date: 30 November 2016

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48758-8_4

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (4)

Efficient TBox Reasoning with Value Restrictions using the wer Reasoner ⋮ Extensions of unification modulo ACUI ⋮ Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ ⋮ Approximate Unification in the Description Logic $$\mathcal {FL}_0$$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximity-based unification theory
• Complexity of unification problems with associative-commutative operators
• 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
• Unification of concept terms in description logics

This page was built for publication: Approximate Unification in the Description Logic $$\mathcal {FL}_0$$