Query answering in circumscribed OWL2 profiles
From MaRDI portal
Recommendations
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- Defeasible inclusions in low-complexity DLs
- The complexity of circumscription in DLs
- The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
- Decidability of circumscribed description logics revisited
Cites work
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- A non-monotonic description logic for reasoning about typicality
- Data complexity of query answering in description logics
- Decidability of circumscribed description logics revisited
- Defeasible inclusions in low-complexity DLs
- Defeasible inheritance-based description logics
- Description logics of minimal knowledge and negation as failure
- Expressive probabilistic description logics
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
- Query answering with DBoxes is hard
- Revisiting grounded circumscription in description logics
- Semantic characterization of rational closure: from propositional logic to description logics
- The complexity of circumscription in DLs
This page was built for publication: Query answering in circumscribed OWL2 profiles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q825008)