scientific article; zbMATH DE number 1405451
From MaRDI portal
Publication:4938425
Recommendations
- Computational complexity of terminological reasoning in BACK
- scientific article; zbMATH DE number 1149405
- The complexity of concept languages
- scientific article; zbMATH DE number 140381
- Complexity of reasoning with expressive ontology mappings
- Computational complexity of the semantics of some natural language constructions
- An empirical analysis of terminological representation systems
- scientific article; zbMATH DE number 1163479
- COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
Cited in
(14)- Computational complexity of terminological reasoning in BACK
- Computing the least common subsumer w.r.t. a background terminology
- Optimizing terminological reasoning for expressive description logics
- Terminological reasoning is inherently intractable
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
- PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\)
- Description Logics
- scientific article; zbMATH DE number 1163479 (Why is no real title available?)
- Extending the description logic \(\tau\mathcal{EL}(\deg)\) with acyclic TBoxes
- Reasoning and query answering in description logics
- Combining interval-based temporal reasoning with general TBoxes
- \({\mathcal E}\)-connections of abstract description systems
- A tableau algorithm for description logics with concrete domains and general TBoxes
- Automata can show PSpace results for description logics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938425)
