Iterated logic program updates
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Multi-dimensional Dynamic Knowledge Representation
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Updates in answer set programming: An approach based on basic structural properties
Theory and Practice of Logic Programming
EVOLP: Tranformation-Based Semantics
Computational Logic in Multi-Agent Systems
The well supported semantics for multidimensional dynamic logic programs
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Irrelevant updates and nonmonotonic assumptions
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Operational semantics for DyLPs
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
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 |
Multidimensional dynamic logic programs (MDLPs) are suitable to represent knowledge dynamic in time, or more generally, information coming from various sources, partially ordered by arbitrary relevancy relation, e.g., level of authority. They have been shown useful for modeling and reasoning about multi-agent systems. Various approaches to define semantics of MDLPs have been presented. Most of the approaches can be characterized as based on rejection of rules. It is understood that on some restricted classes of MDLPs several of these semantics coincide. We focus on acyclic programs. We show that for a MDLP $\mathcal{P}$ and a candidate model M, if $\mathcal{P}$ is acyclic to some extent then several of the known semantics coincide on M. It follows as a direct consequence that on the class of acyclic programs all of these semantics coincide.