Abstract
The paper addresses the problem of explaining Boolean Conjunctive Query (BCQ) entailment in the presence of inconsistency within the Ontology-Based Data Access (OBDA) setting, where inconsistency is handled by the intersection of closed repairs semantics (ICR) and the ontology is represented by Datalog+/− rules. We address this problem in the case of both BCQ acceptance and failure by adopting a logical instantiation of abstract argumentation model; that is, in order to explain why the query is accepted or failed, we look for proponent or opponent sets of arguments in favor or against the query acceptance. We have also studied the computational complexity of the problem of finding an arbitrary explanation as well as all explanations.
Cite
CITATION STYLE
Arioua, A., Tamani, N., & Croitoru, M. (2015). Query answering explanation in inconsistent datalog+/− knowledge bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9261, pp. 203–219). Springer Verlag. https://doi.org/10.1007/978-3-319-22849-5_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
