Unification in the description logic EL without the top concept

DOI10.1007/978-3-642-22438-6_8MaRDI QIDQ5200016zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor
• Unification in the Description Logic $\mathcal{EL}$
• Unification in the description logic EL
• SAT encoding of unification in \(\mathcal{ELH}_{{R}^+}\) w.r.t. cycle-restricted ontologies
• Hybrid unification in the description logic \(\mathcal{EL}\)

Cites work

• 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
• scientific article; zbMATH DE number 67503 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• Practical reasoning for very expressive description logics
• Relationships between nondeterministic and deterministic tape complexities
• SAT Encoding of Unification in $\mathcal{EL}$
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
• Undecidability of the unification and admissibility problems for modal and description logics
• Unification in the Description Logic $\mathcal{EL}$
• Unification in the description logic EL
• Unification of concept terms in description logics

Cited in

(8)

• Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor
• Unification in the description logic EL
• Hybrid unification in the description logic \(\mathcal{EL}\)
• SAT encoding of unification in \(\mathcal{ELH}_{{R}^+}\) w.r.t. cycle-restricted ontologies
• UEL: Unification Solver for the Description Logic $\mathcal{EL}$ – System Description
• Unification in the Description Logic $\mathcal{EL}$
• Unification of concept terms in description logics
• Unification in the description logic \(\mathcal{ELH}_{\mathcal{R}^+}\) without the top concept modulo cycle-restricted ontologies

This page was built for publication: Unification in the description logic \(\mathcal{EL}\) without the top concept

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200016)