Practical reasoning for expressive description logics
This paper examines a particular class of knowledge representation formalisms, namely description logics. Specifically, several extensions and variants of a classical example, \(\mathcal ALC\), introduced in 1991 by \textit{M. Schmidt-Schauss} and \textit{G. Smolka} [J. Artif. Intell. 48, No. 1, 1-26 (1991; Zbl 0712.68095)] are studied. It was shown that deciding coherence and subsumption for \(\mathcal ALC\) are PSPACE-complete problems in linear space. The present paper examines satisfiability and subsumption of the examined variants and proves, among others, that these problems are still in PSPACE. This conference version contains only selected proofs; the authors refer to technical reports, published at their institutions, for full details. For the entire collection see [Zbl 0921.00037].
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
- Reasoning in basic description logics and description logics with modal operators
- Practical reasoning for very expressive description logics
- scientific article; zbMATH DE number 1149436
- Generalized satisfiability for the description logic \(\mathcal{ALC}\)
- Flexible software architectures for ontology-based information systems
- Exploiting conjunctive queries in description logic programs
- Reasoning within expressive fuzzy rough description logics
- Document models
- Locally simple models construction: methodology and practice
- Visualizing \(\mathcal{ALC}\) using concept diagrams
- \(\mathcal{ALCQPI}_{R^+}\): rational grading in an expressive description logic with inverse and transitive roles and counting
- Rational closure for all description logics
- Absorption for ABoxes
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- Probabilistic description logic programs under inheritance with overriding for the semantic Web
- Expressive probabilistic description logics
- Combining answer set programming with description logics for the semantic web
- Reasoning on UML class diagrams
- Optimizing terminological reasoning for expressive description logics
- A tableau decision procedure for \(\mathcal{SHOIQ}\)
- Hybrid logics and ontology languages
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- A model of modal description logic
- Package-Based Description Logics
- Realizing Default Logic over Description Logic Knowledge Bases
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
- Description Logics
- Generalized satisfiability for the description logic \(\mathcal{ALC}\)
- scientific article; zbMATH DE number 1149436 (Why is no real title available?)
- Practical reasoning for very expressive description logics
- scientific article; zbMATH DE number 1765662 (Why is no real title available?)
- scientific article; zbMATH DE number 6902546 (Why is no real title available?)
- A Decidable Constructive Description Logic
- A tableau decision procedure for \(\mathcal{ALC}\) with monotonic modal operators and constant domains
- Reasoning about Multiple Aspects in Rational Closure for DLs
- Rough Pragmatic Description Logic
- Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
- On reasoning about structural equality in XML: a description logic approach
- Foundations of Information and Knowledge Systems
- Non-classical logics in satisfiability modulo theories
- Reasoning with ontologies
- \({\mathcal E}\)-connections of abstract description systems
- Decidability of SHIQ with complex role inclusion axioms
- Conceptual logic programs
- A tableau algorithm for description logics with concrete domains and general TBoxes
- Open answer set programming for the semantic web
- Satisfiability and reasoning mechanism of terminological cycles in description logic v L
- Ontology-driven analysis of UML-based collaborative processes using OWL-DL and CPN
- Fuzzy extensions of OWL: logical properties and reduction to fuzzy description logics
- Probabilistic description logic programs
This page was built for publication: Practical reasoning for expressive description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938424)
