A unified framework for representing logic program updates

Authors:
Yan Zhang;Norman Foo
Affiliations:
School of Computing & Information Technology, University of Western Sydney, NSW, Australia;School of Computer Science & Engineering, University of New South Wales, NSW, Australia
Venue:
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Year:
2005

Citing 6
Cited 5

On strongest neccessary and weakest sufficient conditions

Artificial Intelligence
On properties of update sequences based on causal rejection

Theory and Practice of Logic Programming
Reasoning about evolving nonmonotonic knowledge bases

ACM Transactions on Computational Logic (TOCL)
Logic program-based updates

ACM Transactions on Computational Logic (TOCL)
Propositional independence: formula-variable independence and forgetting

Journal of Artificial Intelligence Research
Solving logic program conflict through strong and weak forgettings

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Resolving Conflicts in Action Descriptions

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A preference-based framework for updating logic programs

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Implementing knowledge update sequences

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Towards closed world reasoning in dynamic open worlds

Theory and Practice of Logic Programming
On Semantic Update Operators for Answer-Set Programs

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a promising formulation to represent and reason about agents' dynamic behavious, logic program updates have been considerably studied recently. While similarities and differences between various approaches were discussed and evaluated by researchers, there is a lack of method to represent different logic program update approaches under a common framework. In this paper, we continue our study on a general framework for logic program conflict solving based on notions of strong and weak forgettings (Zhang, Foo, & Wang 2005). We show that all major logic program update approaches can be transformed into our framework, under which each update approach becomes a specific conflict solving case with certain constraints. We also investigate related computational properties for these transformations.