On the complexity of ontological reasoning under disjunctive existential rules

DOI10.1007/978-3-642-32589-2_1zbMATH Open1365.68405DBLPconf/mfcs/GottlobMMP12OpenAlexW1699565WikidataQ59259493 ScholiaQ59259493MaRDI QIDQ2912705FDOQ2912705

Authors: Georg Gottlob, Michael Morak, Andreas Pieris, M. Manna 

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_1

Recommendations

• Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
• Towards more expressive ontology languages: the query answering problem
• Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
• Towards efficient reasoning under guarded-based disjunctive existential rules
• Finite model reasoning over existential rules

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Cited In (5)

• More on tractable disjunctive Datalog
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
• Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
• Title not available (Why is that?)
• Recent Advances in Datalog$$^\pm $$

This page was built for publication: On the complexity of ontological reasoning under disjunctive existential rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912705)