Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Updating logical databases
Theoretical Computer Science - Special issue: database theory
Propositional belief base update and minimal change
Artificial Intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Generalizing Updates: From Models to Programs
LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
An abductive framework for computing knowledge base updates
Theory and Practice of Logic Programming
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Propositional theories are strongly equivalent to logic programs
Theory and Practice of Logic Programming
A unified framework for representing logic program updates
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Irrelevant updates and nonmonotonic assumptions
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
A Classification Theory Of Semantics Of Normal Logic Programs: I. Strong Properties
Fundamenta Informaticae
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
Towards closed world reasoning in dynamic open worlds
Theory and Practice of Logic Programming
Evolving logic programs with temporal operators
Logic programming, knowledge representation, and nonmonotonic reasoning
Back and forth between rules and SE-models
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Belief base change operations for answer set programming
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
A unifying perspective on knowledge updates
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
Query-Driven Procedures for Hybrid MKNF Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
On condensing a sequence of updates in answer-set programming
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and well-understood semantics. However, handling the evolution of rule bases is still a largely open problem. The AGM framework for belief change was shown to give inappropriate results when directly applied to logic programs under a nonmonotonic semantics such as the stable models. Most approaches to address this issue, developed so far, proposed update operators based on syntactic conditions for rule rejection. More recently, AGM revision has been successfully applied to a significantly more expressive semantic characterisation of logic programs based on SE models. This is an important step, as it changes the focus from the evolution of a syntactic representation of a rule base to the evolution of its semantic content. In this paper, we borrow results from the area of belief update to tackle the problem of updating (instead of revising) logic programs. We prove a representation theorem which makes it possible to constructively define any operator satisfying a set of postulates derived from Katsuno and Mendelzon's postulates for belief update. We define a specific operator based on this theorem and compare the behaviour of this operator with syntactic update operators defined in the literature. Perhaps surprisingly, we uncover a very serious drawback in a large class of semantic update operators to which it belongs.