A logic-based calculus of events
New Generation Computing
Representing actions in logic programming and its applications in database updates
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Representing incomplete knowledge in abductive logic programming
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
An abstract, argumentation-theoretic approach to default reasoning
Artificial Intelligence
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Some Alternative Formulations of the Event Calculus
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
E-RES: Reasoning about Actions, Events and Observations
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Knowledge Qualification through Argumentation
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Agreeing on plans through iterated disputes
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Dynamics of argumentation systems: A division-based method
Artificial Intelligence
Partial semantics of argumentation
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Achieving competence by argumentation on rules for roles
ESAW'04 Proceedings of the 5th international conference on Engineering Societies in the Agents World
Argumentation and the event calculus
Logic Programs, Norms and Action
ABA: argumentation based agents
ArgMAS'11 Proceedings of the 8th international conference on Argumentation in Multi-Agent Systems
| Hi-index | 0.00 |
We show how a class of domains written in the Language E, a high level language for reasoning about actions, narratives and change, can be translated into the argumentation framework of Logic Programming without Negation as Failure (LPwNF). This translation enables us 1) to understand default persistence as captured by various temporal reasoning frameworks in a simple and natural way, by assigning higher priority to information about effects of later actions over effects of earlier actions; 2) to develop an argumentation-based computational model for this type of reasoning in logic programming goal-driven style.