The complexity of concept languages
From MaRDI portal
Publication:1363785
DOI10.1006/inco.1997.2625zbMath0906.68145OpenAlexW1980794674WikidataQ58006980 ScholiaQ58006980MaRDI QIDQ1363785
Daniele Nardi, Maurizio Lenzerini, Francesco M. Donini
Publication date: 11 August 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/77f39861a056d42d9ad093112141aacedd26bfd9
Related Items
A refined architecture for terminological systems: Terminology = Schema + Views, An epistemic operator for description logics, Generalized satisfiability for the description logic \(\mathcal{ALC}\), A polynomial space construction of tree-like models for logics with local chains of modal connectives, A PARAMETERIZED ALGORITHM TO EXPLORE FORMAL CONTEXTS WITH A TAXONOMY, \(\mathcal{ALCQPI}_{R^+}\): rational grading in an expressive description logic with inverse and transitive roles and counting, Generalized Satisfiability for the Description Logic $\mathcal{ALC}$, Generalized modal satisfiability, Handling Spatial Relations in Logical Concept Analysis to Explore Geographical Data, Camelis: a logical information system to organise and browse a collection of documents, Ontologies and Databases: The DL-Lite Approach, Adding clauses to poor man's logic (without increasing the complexity), 2-Exp Time lower bounds for propositional dynamic logics with intersection, EXPtime tableaux for ALC, The complexity of propositional linear temporal logics in simple cases, Expressiveness of concept expressions in first-order description logics
Cites Work
- Attributive concept descriptions with complements
- Foundations of a functional approach to knowledge representation
- The complexity of existential quantification in concept languages.
- Computational complexity of terminological reasoning in BACK
- A guide to completeness and complexity for modal logics of knowledge and belief
- The KL-ONE family
- An empirical analysis of terminological representation systems
- ``Reducing classic to practice: Knowledge representation theory meets reality
- Terminological reasoning is inherently intractable
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item