How does incoherence affect inconsistency-tolerant semantics for Datalog±?

被引：0
作者：
Cristhian A. D. Deagustini
M. Vanina Martinez
Marcelo A. Falappa
Guillermo R. Simari
机构：
[1] Universidad Nacional del Sur,AI R&D Lab., Institute for Computer Science and Engineering (ICIC), Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET)
[2] Universidad Nacional de Entre Ríos,Agents and Intelligent Systems Area, Fac. of Management Sciences
来源：
Annals of Mathematics and Artificial Intelligence | 2018年 / 82卷
关键词：
Incoherence; Inconsistency-tolerant semantics; Argumentation; Datalog; ontologies; 68T27; 68T30; 68T35; 68T37;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The concept of incoherence naturally arises in ontological settings, specially when integrating knowledge. In the Datalog± literature, however, this is an issue that is yet to be studied more deeply. The main focus of our work is to show how classical inconsistency-tolerant semantics for query answering behaves when dealing with atoms that are relevant to unsatisfiable sets of existential rules, which may hamper the quality of answers and any reasoning task based on those semantics. We also propose a notion of incoherency-tolerant semantics for query answering in Datalog±, and exemplify this notion with a particular semantics based on the transformation of classic Datalog± ontologies into defeasible Datalog± ones, which use argumentation as its reasoning machinery.
引用
收藏
页码：43 / 68
页数：25
相关论文
共 27 条
  • [1] Briguez CE(2014)Argument-based mixed recommenders and their application to movie suggestion Expert Syst. Appl. 41 6467-6482
  • [2] Budȧn MC(2012)A general Datalog-based framework for tractable query answering over ontologies J. Web Semant. 14 57-83
  • [3] Deagustini CAD(2013)Relational databases as a massive information source for defeasible argumentation Knowl.-Based Syst. 51 93-109
  • [4] Maguitman AG(2012)Parallel belief revision: Revising by sets of formulas Artif. Intell. 176 2223-2245
  • [5] Capobianco M(1995)On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games Artif. Intell. 77 321-357
  • [6] Simari GR(2010)Complexity of semi-stable and stage semantics in argumentation frameworks Inf. Process. Lett. 110 425-430
  • [7] Calì A(2004)Defeasible logic programming: an argumentative approach TPLP 4 95-138
  • [8] Gottlob G(2002)Merging information under constraints: a logical framework J. Log. Comput. 12 773-808
  • [9] Lukasiewicz T(1980)A logic for default reasoning Artif. Intel. 13 81-132
  • [10] Deagustini CAD(1992)A mathematical treatment of defeasible reasoning and its implementation Artif. Intell. 53 125-157
123