Title
t-DeLP: an argumentation-based Temporal Defeasible Logic Programming framework
Abstract
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.
Year
DOI
Venue
2013
10.1007/s10472-013-9334-1
Ann. Math. Artif. Intell.
Keywords
DocType
Volume
Logic programming,Argumentation,Non-monotonic logic,Temporal reasoning,03B44,03B53
Journal
69
Issue
ISSN
Citations 
1
1012-2443
6
PageRank 
References 
Authors
0.52
36
2
Name
Order
Citations
PageRank
Pere Pardo1478.63
Lluís Godo288856.28