Unification in the Description Logic $\mathcal{EL}$ without the Top Concept

DOI10.1007/978-3-642-22438-6_8zbMath1341.68205OpenAlexW2163668411MaRDI QIDQ5200016

Franz Baader, Barbara Morawska, Stefan Borgwardt, Nguyen Thanh Binh

Publication date: 29 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22438-6_8

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the space complexity of some decision problems for finite automata
• Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor
• Relationships between nondeterministic and deterministic tape complexities
• Unification in the Description Logic EL
• Solving SAT and SAT Modulo Theories
• Unification in the Description Logic $\mathcal{EL}$
• Practical reasoning for very expressive description logics
• SAT Encoding of Unification in $\mathcal{EL}$
• Undecidability of the unification and admissibility problems for modal and description logics
• Unification of concept terms in description logics

This page was built for publication: Unification in the Description Logic $\mathcal{EL}$ without the Top Concept