Characterization of logic program revision as an extension of propositional revision
From MaRDI portal
Abstract: We address the problem of belief revision of logic programs, i.e., how to incorporate to a logic program P a new logic program Q. Based on the structure of SE interpretations, Delgrande et al. adapted the well-known AGM framework to logic program (LP) revision. They identified the rational behavior of LP revision and introduced some specific operators. In this paper, a constructive characterization of all rational LP revision operators is given in terms of orderings over propositional interpretations with some further conditions specific to SE interpretations. It provides an intuitive, complete procedure for the construction of all rational LP revision operators and makes easier the comprehension of their semantic and computational properties. We give a particular consideration to logic programs of very general form, i.e., the generalized logic programs (GLPs). We show that every rational GLP revision operator is derived from a propositional revision operator satisfying the original AGM postulates. Interestingly, the further conditions specific to GLP revision are independent from the propositional revision operator on which a GLP revision operator is based. Taking advantage of our characterization result, we embed the GLP revision operators into structures of Boolean lattices, that allow us to bring to light some potential weaknesses in the adapted AGM postulates. To illustrate our claim, we introduce and characterize axiomatically two specific classes of (rational) GLP revision operators which arguably have a drastic behavior. We additionally consider two more restricted forms of logic programs, i.e., the disjunctive logic programs (DLPs) and the normal logic programs (NLPs) and adapt our characterization result to DLP and NLP revision operators.
Recommendations
- Characterization Theorems for Revision of Logic Programs
- AGM-Style Belief Revision of Logic Programs under Answer Set Semantics
- scientific article; zbMATH DE number 1761413
- Syntax-Preserving Belief Change Operators for Logic Programs
- Reconsidering AGM-style belief revision in the context of logic programs
Cites work
- A model-theoretic approach to belief change in answer set programming
- A Preference-Based Framework for Updating Logic Programs
- AGM-Style Belief Revision of Logic Programs under Answer Set Semantics
- An abductive framework for computing knowledge base updates
- Belief revision and update: Complexity of model checking
- Characterization Theorems for Revision of Logic Programs
- Dynamic updates of non-monotonic knowledge bases
- scientific article; zbMATH DE number 140403 (Why is no real title available?)
- scientific article; zbMATH DE number 4187148 (Why is no real title available?)
- Logic program-based updates
- Merging Information Under Constraints: A Logical Framework
- Merging Logic Programs under Answer Set Semantics
- Negation as failure in the head
- On properties of update sequences based on causal rejection
- On semantic update operators for answer-set programs
- On the logic of theory change: Partial meet contraction and revision functions
- Propositional knowledge base revision and minimal change
- Propositional theories are strongly equivalent to logic programs
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- The rise and fall of semantic rule updates based on SE-models
Cited in
(7)- Possible models computation and revision -- a practical approach
- Characterization Theorems for Revision of Logic Programs
- The complexity of revising logic programs
- Revision by communication
- Merging in the Horn fragment
- Theoretical Aspects of Computing - ICTAC 2004
- A brief history of updates of answer-set programs
This page was built for publication: Characterization of logic program revision as an extension of propositional revision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593020)
