Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Iterated logic program updates
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Disjunctive logic programs with inheritance
Proceedings of the 1999 international conference on Logic programming
LUPS---a language for updating logic programs
Artificial Intelligence
Updating Extended Logic Programs through Abduction
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
MINERVA - A Dynamic Logic Programming Agent Architecture
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
A Kripkean semantics for dynamic logic programming
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
From logic programs updates to action description updates
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
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
Updates in answer set programming: An approach based on basic structural properties
Theory and Practice of Logic Programming
Explicit Dynamic User Profiles for a Collaborative Filtering Recommender System
IBERAMIA '08 Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence
EVOLP: Tranformation-Based Semantics
Computational Logic in Multi-Agent Systems
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
| Hi-index | 0.00 |
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly dynamic domains with logic programming techniques. Two of the most recent results are the definition of the refined stable and the well founded semantics for dynamic logic programs that extend stable model and well founded semantic to the dynamic case. We present here alternative, although equivalent, operational characterizations of these semantics by program transformations into normal logic programs. The transformations provide new insights on the computational complexity of these semantics, a way for better understanding the meaning of the update programs, and also a methodology for the implementation of these semantics. In this sense, the equivalence theorems in this paper constitute soundness an completeness results for the implementations of these semantics.