Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates

DOI10.1016/j.artint.2024.104099MaRDI QIDQ6566618

Magdalena Ortiz, Sanja Lukumbuzya, Mantas Šimkus

Publication date: 3 July 2024

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

datalogdescription logicsquery rewritingclosed predicates

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
• Data complexity of query answering in description logics
• Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
• Combining answer set programming with description logics for the semantic web
• The price of query rewriting in ontology-based data access
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Reasoning in description logics by a reduction to disjunctive datalog
• The complexity of finite model reasoning in description logics
• Complexity of the two-variable fragment with counting quantifiers
• On the relative expressiveness of description logics and predicate logics
• Query Answering with DBoxes is Hard
• An Introduction to Description Logic
• Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend!
• The Complexity of Circumscription in DLs
• On the complexity of integer programming
• Querying Visible and Invisible Information
• Ontology-Based Data Access
• Linking Data to Ontologies
• Description logics of minimal knowledge and negation as failure

This page was built for publication: Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates