A logic-based calculus of events
New Generation Computing
Logics of time and computation
Logics of time and computation
On the relation between default and autoepistemic logic
Artificial Intelligence
Handbook of theoretical computer science (vol. B)
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Dynamic Logic
Merging structured text using temporal knowledge
Data & Knowledge Engineering
A Reasoning Model Based on the Production of Acceptable Arguments
Annals of Mathematics and Artificial Intelligence
Inferring from Inconsistency in Preference-Based Argumentation Frameworks
Journal of Automated Reasoning
Relating defeasible and normal logic programming through transformation properties
Theoretical Computer Science
Execution of defeasible temporal clauses for building preferred models
FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
Adding Priorities and Specificity to Default Logic
JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Semantics for Persistency in Propositional Dynamic Logic
CL '00 Proceedings of the First International Conference on Computational Logic
PDL-based framework for reasoning about actions
AI*IA '95 Proceedings of the 4th Congress of the Italian Association for Artificial Intelligence on Topics in Artificial Intelligence
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
Argumentation and the Dynamics of Warranted Beliefs in Changing Environments
Autonomous Agents and Multi-Agent Systems
On the evaluation of argumentation formalisms
Artificial Intelligence
Reasoning about preferences in argumentation frameworks
Artificial Intelligence
Argumentation Using Temporal Knowledge
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
On the Relationship of Defeasible Argumentation and Answer Set Programming
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Argumentation in Artificial Intelligence
Argumentation in Artificial Intelligence
On the comparison of theories: preferring the most specific explanation
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
On specificity in default logic
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Temporal extensions to defeasible logic
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
t-DeLP: a temporal extension of the defeasible logic programming argumentative framework
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Stable extensions in timed argumentation frameworks
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Hi-index | 0.00 |
The aim of this paper is to propose an argumentation-based defeasible logic, called t-DeLP, that focuses on forward temporal reasoning for causal inference. We extend the language of the DeLP logical framework by associating temporal parameters to literals. A temporal logic program is a set of basic temporal facts and (strict or defeasible) durative rules. Facts and rules combine into durative arguments representing temporal processes. As usual, a dialectical procedure determines which arguments are undefeated, and hence which literals are warranted, or defeasibly follow from the program. t-DeLP, though, slightly differs from DeLP in order to accommodate temporal aspects, like the persistence of facts. The output of a t-DeLP program is a set of warranted literals, which is first shown to be non-contradictory and be closed under sub-arguments. This basic framework is then modified to deal with programs whose strict rules encode mutex constraints. The resulting framework is shown to satisfy stronger logical properties like indirect consistency and closure.