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 条

[11] Taming the Infinite Chase: Query Answering under Expressive Relational Constraints [J].

Cali, Andrea ;

Gottlob, Georg ;

Kifer, Michael .

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2013, 48 :115-174

[12] A general Datalog-based framework for tractable query answering over ontologies [J].

Cali, Andrea ;

Gottlob, Georg ;

Lukasiewicz, Thomas .

JOURNAL OF WEB SEMANTICS, 2012, 14 :57-83

[13] Towards more expressive ontology languages: The query answering problem [J].

Cali, Andrea ;

Gottlob, Georg ;

Pieris, Andreas .

ARTIFICIAL INTELLIGENCE, 2012, 193 :87-128

[14]

Dosilovic FK, 2018, 2018 41ST INTERNATIONAL CONVENTION ON INFORMATION AND COMMUNICATION TECHNOLOGY, ELECTRONICS AND MICROELECTRONICS (MIPRO), P210, DOI 10.23919/MIPRO.2018.8400040

[15] IDENTIFYING THE MINIMAL TRANSVERSALS OF A HYPERGRAPH AND RELATED PROBLEMS [J].

EITER, T ;

GOTTLOB, G .

SIAM JOURNAL ON COMPUTING, 1995, 24 (06) :1278-1304

[16] Disjunctive datalog [J].

Eiter, T ;

Gottlob, G ;

Mannila, H .

ACM TRANSACTIONS ON DATABASE SYSTEMS, 1997, 22 (03) :364-418

[17]

Eiter T, 2016, FIFTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, P359

[18] Data exchange: semantics and query answering [J].

Fagin, R ;

Kolaitis, PG ;

Miller, RJ ;

Popa, L .

THEORETICAL COMPUTER SCIENCE, 2005, 336 (01) :89-124

[19]

Gabow H. N., 1976, IEEE Transactions on Software Engineering, VSE-2, P227, DOI 10.1109/TSE.1976.233819

[20] THE MINIMAL HITTING SET GENERATION PROBLEM: ALGORITHMS AND COMPUTATION [J].

Gainer-Dewar, Andrew ;

Vera-Licona, Paola .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) :63-100

← 1 2 3 4 →