A preference-based framework for updating logic programs

Authors:
James P. Delgrande;Torsten Schaub;Hans Tompits
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;Institut für Informatik, Universität Potsdam, Potsdam, Germany and School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;Institut für Informationssysteme, Technische Universität Wien, Wien, Austria
Venue:
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Year:
2007

Citing 12
Cited 7

A theorem-proving approach to database integrity

Foundations of deductive databases and logic programming
Logic programs with classical negation

Logic programming
Preferred answer sets for extended logic programs

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
A Compilation of Updates plus Preferences

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Computing preferred answer sets by meta-interpretation in Answer Set Programming

Theory and Practice of Logic Programming
A semantic framework for preference handling in answer set programming

Theory and Practice of Logic Programming
A framework for compiling preferences in logic programs

Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection

Theory and Practice of Logic Programming
Preferred answer sets for ordered 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
Towards generalized rule-based updates

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1

Merging Logic Programs under Answer Set Semantics

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Update sequences based on minimal generalized pstable models

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Back and forth between rules and SE-models

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
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)
On condensing a sequence of updates in answer-set programming

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Belief revision within fragments of propositional logic

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple and general, making use of two distinct complementary techniques: defaultification and preference. While defaultification resolves potential conflicts by inducing more answer sets, preferences then select among these answer sets, yielding the answer sets generated by those rules that have been added more recently.We examine instances of the framework with respect to various desirable properties; for the most part, these properties are satisfied by instances of our framework. Finally, the proposed framework is also easily implementable by off-the-shelf systems.