A general approach to belief change in answer set programming

12/30/2009
by   James Delgrande, et al.
0

We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Unlike previous approaches to belief change in logic programming, our formal techniques are analogous to those of distance-based belief revision in propositional logic. In developing our results, we build upon the model theory of logic programs furnished by SE models. Since SE models provide a formal, monotonic characterisation of logic programs, we can adapt techniques from the area of belief revision to belief change in logic programs. We introduce methods for revising and merging logic programs, respectively. For the former, we study both subset-based revision as well as cardinality-based revision, and we show that they satisfy the majority of the AGM postulates for revision. For merging, we consider operators following arbitration merging and IC merging, respectively. We also present encodings for computing the revision as well as the merging of logic programs within the same logic programming framework, giving rise to a direct implementation of our approach in terms of off-the-shelf answer set solvers. These encodings reflect in turn the fact that our change operators do not increase the complexity of the base formalism.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/25/2014

Belief merging within fragments of propositional logic

Recently, belief change within the framework of fragments of proposition...
research
06/17/2013

The Rise and Fall of Semantic Rule Updates Based on SE-Models

Logic programs under the stable model semantics, or answer-set programs,...
research
02/27/2020

Belief Base Revision for Further Improvement of Unified Answer Set Programming

A belief base revision is developed. The belief base is represented usin...
research
07/19/2012

Exploring the rationality of some syntactic merging operators (extended version)

Most merging operators are defined by semantics methods which have very ...
research
03/31/2016

Distributing Knowledge into Simple Bases

Understanding the behavior of belief change operators for fragments of c...
research
06/01/2011

Space Efficiency of Propositional Knowledge Representation Formalisms

We investigate the space efficiency of a Propositional Knowledge Represe...
research
02/14/2018

Morphologic for knowledge dynamics: revision, fusion, abduction

Several tasks in artificial intelligence require to be able to find mode...

Please sign up or login with your details

Forgot password? Click here to reset