In this paper, we extend Defeasible Logic (a computationally-oriented non-monotonic logic) in order to deal with temporalised rules. In particular, we extend the logic to cope with durative facts, as well as with delays between the antecedent and the consequent of rules. We showed that the extended temporalised framework is suitable to model different types of causal relations which have been identified by the specialised literature. We also prove that the computational properties of the original logic are still retained by the extended approach. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Governatori, G., & Terenziani, P. (2007). Temporal extensions to defeasible logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4830 LNAI, pp. 476–485). Springer Verlag. https://doi.org/10.1007/978-3-540-76928-6_49
Mendeley helps you to discover research relevant for your work.