Work

A Semantic Characterization ASP Base Revision

Year: 2019

Type: article

Abstract: 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.

Source: Journal of Artificial Intelligence Research

DOI: 10.1613/jair.1.11451

Authors: Laurent Garcia, Claire Lefèvre, Igor Stéphan, Odile Papini, Éric Würbel

Institutions: Université d'Angers, Centre National de la Recherche Scientifique, Université de Toulon, Aix-Marseille Université, Laboratoire d’Informatique et Systèmes

Language: English

Topic: Logic, Reasoning, and Knowledge

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Agence Nationale de la Recherche

Awards: ASP technologIes for Querying large scale multisource heterogeneous web information, G6702880738