A program-level approach to revising logic programs under the answer set semantics

DOI10.1017/S1471068410000281zbMATH Open1209.68090arXiv1007.5024OpenAlexW2002154970MaRDI QIDQ3585168FDOQ3585168

James Delgrande

Publication date: 19 August 2010

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Abstract: An approach to the revision of logic programs under the answer set semantics is presented. For programs P and Q, the goal is to determine the answer sets that correspond to the revision of P by Q, denoted P * Q. A fundamental principle of classical (AGM) revision, and the one that guides the approach here, is the success postulate. In AGM revision, this stipulates that A is in K * A. By analogy with the success postulate, for programs P and Q, this means that the answer sets of Q will in some sense be contained in those of P * Q. The essential idea is that for P * Q, a three-valued answer set for Q, consisting of positive and negative literals, is first determined. The positive literals constitute a regular answer set, while the negated literals make up a minimal set of naf literals required to produce the answer set from Q. These literals are propagated to the program P, along with those rules of Q that are not decided by these literals. The approach differs from work in update logic programs in two main respects. First, we ensure that the revising logic program has higher priority, and so we satisfy the success postulate; second, for the preference implicit in a revision P * Q, the program Q as a whole takes precedence over P, unlike update logic programs, since answer sets of Q are propagated to P. We show that a core group of the AGM postulates are satisfied, as are the postulates that have been proposed for update logic programs.

Full work available at URL: https://arxiv.org/abs/1007.5024

zbMATH Keywords

answer set programmingbelief changebelief revision

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Logic programming (68N17)

Cites Work

• Extending and implementing the stable model semantics
• On the logic of theory change: Partial meet contraction and revision functions
• The DLV system for knowledge representation and reasoning
• Strongly equivalent logic programs
• On properties of update sequences based on causal rejection
• Dynamic updates of non-monotonic knowledge bases
• A consistency-based approach for belief change

Cited In (7)

• Revision of defeasible preferences
• Belief Base Change Operations for Answer Set Programming
• On updates of hybrid knowledge bases composed of ontologies and rules
• The complexity of revising logic programs
• AGM-Style Belief Revision of Logic Programs under Answer Set Semantics
• Characterization Theorems for Revision of Logic Programs
• AGM contraction and revision of rules

This page was built for publication: A program-level approach to revising logic programs under the answer set semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585168)