An Empirical Evaluation of Argumentation in Explaining Inconsistency-Tolerant Query Answering
نویسندگان
چکیده
In this paper we answer empirically the following research question: “Are dialectical explanation methods more effective than one-shot explanation methods for Intersection of Closed Repairs inconsistency tolerant semantics in existential rules knowledge bases?” We ran two experiments with 84 and respectively 38 participants and showed that under certain conditions dialectical approaches are significantly more effective than one-shot explanations.
منابع مشابه
Query Answering Explanation in Inconsistent Datalog +/- Knowledge Bases
The paper addresses the problem of explaining Boolean Conjunctive Query (BCQ) entailment in the presence of inconsistency within the OntologyBased 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 l...
متن کاملExplaining Query Answers under Inconsistency-Tolerant Semantics over Description Logic Knowledge Bases (Extended Abstract)
The problem of querying description logic (DL) knowledge bases (KBs) using database-style queries (in particular, conjunctive queries) has been a major focus of recent DL research. Since scalability is a key concern, much of the work has focused on lightweight DLs for which query answering can be performed in polynomial time w.r.t. the size of the ABox. The DL-Lite family of lightweight DLs [10...
متن کاملInconsistency-tolerant query answering in ontology-based data access
Ontology-based data access (OBDA) is receiving great attention as a new paradigm for managing information systems through semantic technologies. According to this paradigm, a Description Logic ontology provides an abstract and formal representation of the domain of interest to the information system, and is used as a sophisticated schema for accessing the data and formulating queries over them....
متن کاملComplexity of Inconsistency-Tolerant Query Answering in Datalog+/-
The study of inconsistency-tolerant semantics for query answering in ontological languages has recently gained much attention. In this work, we consider three inconsistency-tolerant semantics recently proposed in the literature, namely: consistent query answering, the intersection (also called IAR) semantics, and the intersection of closed repairs (ICR) semantics. We study the data complexity o...
متن کاملQuery Rewriting for Inconsistent DL-Lite Ontologies
In this paper we study the problem of obtaining meaningful answers to queries posed over inconsistent DL-Lite ontologies. We consider different variants of inconsistency-tolerant semantics and show that for some of such variants answering unions of conjunctive queries (UCQs) is first-order (FOL) rewritable, i.e., it can be reduced to standard evaluation of a FOL/SQL query over a database. Since...
متن کامل