t-DeLP: an argumentation-based Temporal Defeasible Logic Programming framework
Publication Type:
Journal ArticleSource:
Annals of Mathematics and Artificial Intelligence, Springer-Verlag (In Press)Keywords:
Temporal Reasoning; Argumentation Systems; Defeasible Logic ProgrammingAbstract:
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.
t-DeLP: a temporal extension of the defeasible logic programming argumentative framework
Publication Type:
Conference PaperSource:
SUM 2011, Springer-Verlag, Volume 6929, Dayton (Ohio), USA, p.489-503 (2011)Keywords:
Defeasible logic programming; argumentation; temporal extensionAbstract:
The aim of this paper is to offer an argumentation-based defeasible logic that enables forward reasoning with time. We extend the $\DeLP$ logical framework by associating temporal parameters to literals. A temporal logic program is a set of temporal literals and durative rules. These temporal facts and rules combine to into durative arguments representing temporal processes, that permit us to reason defeasibly about future states. The corresponding notion of logical consequence, or warrant, is defined slightly different from that of $\DeLP$, due to the temporal aspects. As usual, this notion takes care of inconsistencies, and in particular we prove the consistency of any logical program whose strict part is consistent. Finally, we define and study a sub-class of arguments that seem appropriate to reason with natural processes, and suggest a modification to the framework that is equivalent to restricting the logic to this class of arguments.
