arrow
返回

Explanations for query answers under existential rules

delete2025-04-01
delete0
delete
OA
AI
İ
İsmail İlkan Ceylan
T
Thomas Lukasiewicz
E
Enrico Malizia *
A
Andrius Vaicenavičius
DOI:10.1016/j.artint.2025.104294delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Ontology-based data access is an extensively studied paradigm aiming at improving query answers with the use of an ontology. An ontology is a specification of a domain of interest, which, in this context, is described via a logical theory. As a form of logical entailment, ontology- mediated query answering is fully interpretable, which makes it possible to derive explanations for ontological query answers. This is a quite important aspect, as the fact that many recent AI systems mostly operating as black boxes has led to some serious concerns. In the literature, various works on explanations in the context of description logics (DLs) have appeared, mostly focusing on explaining concept subsumption and concept unsatisfiability in the ontologies. Some works on explaining query entailment in DLs have appeared as well, however, mainly dealing with inconsistency-tolerant semantics and, actually, non-entailment of the queries. Surprisingly, explaining ontological query entailment has received little attention for ontology languages based on existential rules. In fact, although DLs are popular formalisms to model ontologies, it is generally agreed that rule-based ontologies are well-suited for data-intensive applications, as they allow us to conveniently deal with higher-arity relations, which naturally occur in standard relational databases. The goal of this work is to close this gap, and study the problem of explaining query entailment in the context of existential rules ontologies in terms of minimal subsets of database facts. We provide a thorough complexity analysis for several decision problems associated with minimal explanations for various classes of existential rules, and for different complexity measures.
Keyword:
Artificial intelligence
Computational complexity
Ontologies
Existential rules
Datalog plus /-
Query answering
Ontology mediated query answering
Explanations
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Artificial Intelligence Review 封面图
Artificial Intelligence Review
IF:
13.9
论文数:
6.1K
被引数:
1.9W

机构

U
university of oxford
学者数:
9.8W
论文数: 8.6W
被引数: 137
U
University of Bologna
学者数:
4.5W
论文数: 3.8W
被引数: 4.1W
引用论文

引用论文

The “Geriatric” Amputee
err1972-09-01
err0
errOAAI
errRONALD B. KIHN; RICHARD WARREN; GILBERT W. BEEBE
err分享
err收藏
err分享
err收藏
err分享
err收藏
Avoiding transport bottlenecks in an expanding root system: Xylem vessel development in fibrous and pioneer roots under field conditions
err2012-09-01
err0
PREAI
errAgnieszka Bagniewska‐Zadworna; Julia Byczyk; David M. Eissenstat; Jacek Oleksyn; Marcin Zadworny
err分享
err收藏
Spatial distribution of the species laser-ablated from the target submerged in liquid
err2005-04-12
err0
PREAI
errTetsuo Sakka; Kouichi Hirata; Satoru Masai; Yukio H. Ogata
err分享
err收藏
Results of a phase II randomized trial of cisplatin +/- veliparib in metastatic triple-negative breast cancer (TNBC) and/or germline BRCA-associated breast cancer (SWOG S1416).
err2020-05-20
err0
PREAI
errPriyanka Sharma; Eve Rodler; William E. Barlow; Julie Gralow; Shannon Leigh Huggins-Puhalla; Carey K. Anders; Lori J. Goldstein; Ursa Abigail Brown-Glaberman; Thu-Tam Huynh; Christopher Scott Szyarto; Andrew K. Godwin; Harsh B Pathak; Elizabeth M. Swisher; Marc R Radke; Kirsten M Timms; Danika L. Lew; Jieling Miao; Lajos Pusztai; Daniel F. Hayes; Gabriel N. Hortobagyi
err分享
err收藏
学者 查看更多内容