Data complexity of answering conjunctive queries over SHIQ knowledge bases
M. Magdalena Ortiz de la Fuente, Diego Calvanese, Thomas Eiter, Enrico Franconi
Abstract
An algorithm for answering conjunctive queries over SHIQ knowledge bases that is coNP in data complexity is given. The algorithm is based on the tableau algorithm for reasoning with individuals in SHIQ. The blocking conditions of the tableau are weakened in such a way that the set of models the modified algorithm yields suffices to check query entailment. The modified blocking conditions are based on the ones proposed by Levy and Rousset for reasoning with Horn Rules in the description logic ALCNR.
Create a lesson
Related papers
Finite Satisfiability of Two-Variable Logic with Arbitrarily Many Successors
Artur Jeż, Jakub Michaliszyn, Piotr Witkowski
A Non-Dichotomy for CSPs of Stable ω-Categorical Structures
Manuel Bodirsky, David Bradley-Williams, Ehud Hrushovski et al.
Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents
Tim S. Lyon, Lukas Zenger
Finite-on-Top-of-Temporal CSPs in Fixed-Point Logic
Manuel Bodirsky, Philipp A. Grzywaczyk
The Complexity of Verifying Strategic Abilities in Succinct Multiagent Systems
Yifan He, Munyque Mittelmann, Aniello Murano et al.
Reset Early, Reset Often, Eliminate Models
Martin S. Fixman, Fredrik Rømming, Sean B. Holden