A Semantic Characterization for ASP Base Revision

作     者：Garcia, Laurent Lefevre, Claire Stephan, Igor Papini, Odile Wurbel, Eric 

作者机构：Univ Angers LERIA Angers France Univ Toulon & Var Aix Marseille Univ CNRS LIS Marseille France 

出 版 物：《JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH》 (人工智能研究杂志)

年 卷 期：2019年第66卷

页      面：989-1029页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：ANR project ASPIQ [ANR-12-BS02-0003] Agence Nationale de la Recherche (ANR) [ANR-12-BS02-0003] Funding Source: Agence Nationale de la Recherche (ANR) 

主　　题：Logic programming 

摘      要：The paper deals with base revision for Answer Set Programming (ASP). Base revision in classical logic is done by the removal of formulas. Exploiting the non-monotonicity of ASP allows one to propose other revision strategies, namely addition strategy or removal and/or addition strategy. These strategies allow one to define families of rule-based revision operators. The paper presents a semantic characterization of these families of revision operators in terms of answer sets. This semantic characterization allows for equivalently considering the evolution of syntactic logic programs and the evolution of their semantic content. It then studies the logical properties of the proposed operators and gives complexity results.