Explanations for Query Answers under Existential Rules

被引：0

作者：

Ceylan, Ismail Ilkan ^{[1
]}

Lukasiewicz, Thomas ^{[1
]}

Malizia, Enrico ^{[2
]}

Vaicenavicius, Andrius ^{[1
]}

机构：

[1] Univ Oxford, Dept Comp Sci, Oxford, England

[2] Univ Exeter, Dept Comp Sci, Exeter, Devon, England

来源：

PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE | 2019年

基金：

英国工程与自然科学研究理事会;

关键词：

JUSTIFICATIONS; HYPERGRAPH; ONTOLOGY;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Ontology-mediated query answering is an extensively studied paradigm, which aims at improving query answers with the use of a logical theory. As a form of logical entailment, ontology-mediated query answering is fully interpretable, which makes it possible to derive explanations for query answers. Surprisingly, however, explaining answers for ontology-mediated queries has received little attention for ontology languages based on existential rules. In this paper, we close this gap, and study the problem of explaining query answers in terms of minimal subsets of database facts. We provide a thorough complexity analysis for several decision problems associated with minimal explanations under existential rules.

引用

页码：1639 / 1646

页数：8

共 34 条

[1]

[Anonymous], 1990, COMPUT INTRACTABILIT

[2]

[Anonymous], 2017, P IJCAI, P950

[3]

Baader, 2008, P KR MED

[4]

Baader Franz, 2003, DESCRIPTION LOGIC HD