Unification in the Description Logic $\mathcal{EL}$

DOI10.1007/978-3-642-02348-4_25zbMath1242.68300OpenAlexW49011482MaRDI QIDQ3636834

Franz Baader, Barbara Morawska

Publication date: 30 June 2009

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02348-4_25

Mathematics Subject Classification ID

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

Related Items (8)

Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor ⋮ Admissibility and Unifiability in Contact Logics ⋮ Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\) ⋮ KD is nullary ⋮ Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures ⋮ Extensions of unification modulo ACUI ⋮ Contact Logic is Finitary for Unification with Constants ⋮ Unification in the Description Logic $\mathcal{EL}$ without the Top Concept

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unification in commutative theories
• Best solving modal equations
• Computing the least common subsumer w.r.t. a background terminology
• Unification in a Description Logic with Transitive Closure of Roles
• Matching in description logics
• Undecidability of the unification and admissibility problems for modal and description logics
• KI 2003: Advances in Artificial Intelligence
• Unification of concept terms in description logics
• Non-standard inferences in description logics

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