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
ACM Transactions on Computational Logic (TOCL)
Updates in answer set programming: An approach based on basic structural properties
Theory and Practice of Logic Programming
A preference-based framework for updating logic programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
On Semantic Update Operators for Answer-Set Programs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Irrelevant updates and nonmonotonic assumptions
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Static and Dynamic Semantics: Preliminary Report
MICAI '11 Proceedings of the 2011 10th Mexican International Conference on Artificial Intelligence
Dynamic logic programming: various semantics are equal on acyclic programs
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
A unifying perspective on knowledge updates
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
Update semantics for Answer-Set Programming assign models to sequences of answer-set programs which result from the iterative process of updating programs by programs. Each program in the sequence represents an update of the preceding ones. One of the enduring problems in this context is state condensing, or the problem of determining a single logic program that faithfully represents the sequence of programs. Such logic program should 1) be written in the same alphabet, 2) have the same stable models, and 3) be equivalent to the sequence of programs when subject to further updates. It has been known for more than a decade that update semantics easily lead to non-minimal stable models, so an update sequence cannot be represented by a single non-disjunctive program. On the other hand, more expressive classes of programs were never considered, mainly because it was not clear how they could be updated further. In this paper we solve the state condensing problem for two foundational rule update semantics, using nested logic programs. Furthermore, we also show that disjunctive programs with default negation in the head can be used for the same purpose.