Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor
DOI10.1215/00294527-3555507zbMath1358.68272OpenAlexW2477403571MaRDI QIDQ2374390
Barbara Morawska, Franz Baader, Stefan Borgwardt, Nguyen Thanh Binh
Publication date: 15 December 2016
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1468952202
Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- 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
- Unification in modal and description logics
- SAT Encoding of Unification in $\mathcal{ELH}_{{R}^+}$ w.r.t. Cycle-Restricted Ontologies
- Solving SAT and SAT Modulo Theories
- Unification in the Description Logic $\mathcal{EL}$
- Alternation
- Practical reasoning for very expressive description logics
- SAT Encoding of Unification in $\mathcal{EL}$
- Unification in the Description Logic $\mathcal{EL}$ without the Top Concept
- Undecidability of the unification and admissibility problems for modal and description logics
- State-complexity of finite-state devices, state compressibility and incompressibility
- Unification of concept terms in description logics
This page was built for publication: Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor
