Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
Propositional knowledge base revision and minimal change
Artificial Intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Logic Programming Updating - A Guided Approach
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Equivalence in Answer Set Programming
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Applications of intuitionistic logic in Answer Set Programming
Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Weight constraints as nested expressions
Theory and Practice of Logic Programming
Operational semantics for DyLPs
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in 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
Update sequences based on minimal generalized pstable models
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Belief base change operations for answer set programming
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
| Hi-index | 0.00 |
We have studied the update operator ⊕1 definedfor update sequences by Eiter et al. without tautologies andwe have observed that it satisfies an interesting property. Thisproperty, which we call Weak Independence of Syntax (WIS), issimilar to one of the postulates proposed by Alchourrón,Gärdenfors, and Makinson (AGM); only that in this case itapplies to nonmonotonic logic. In addition, we consider other fiveadditional basic properties about update programs and we show that⊕1 satisfies them. This work continues theanalysis of the AGM postulates with respect to the⊕1 operator under a refined view that considersN2 as a monotonic logic which allows us to expandour understanding of answer sets. Moreover, N2helped us to derive an alternative definition of⊕1 avoiding the use of unnecessary extraatoms.