Query answering in circumscribed OWL2 profiles

DOI10.1007/s10472-021-09770-2zbMath1494.68259OpenAlexW3197425204MaRDI QIDQ825008

Piero A. Bonatti

Publication date: 17 December 2021

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-021-09770-2

zbMATH Keywords

query answeringcircumscriptionlow-complexity nonmonotonic description logics

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• A non-monotonic description logic for reasoning about typicality
• Data complexity of query answering in description logics
• Semantic characterization of rational closure: from propositional logic to description logics
• Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
• Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
• Expressive probabilistic description logics
• Query Answering with DBoxes is Hard
• Defeasible Inheritance-Based Description Logics
• The Complexity of Circumscription in DLs
• Decidability of Circumscribed Description Logics Revisited
• Revisiting Grounded Circumscription in Description Logics
• Description logics of minimal knowledge and negation as failure

This page was built for publication: Query answering in circumscribed OWL2 profiles