TY - GEN
T1 - Temporal extensions to defeasible logic
AU - Governatori, Guido
AU - Terenziani, Paolo
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/38349075318
U2 - 10.1007/978-3-540-76928-6_49
DO - 10.1007/978-3-540-76928-6_49
M3 - Conference contribution
AN - SCOPUS:38349075318
SN - 9783540769262
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 476
EP - 485
BT - AI 2007
PB - Springer Verlag
T2 - 20th Australian Joint Conference on Artificial Intelligence, AI 2007
Y2 - 2 December 2007 through 6 December 2007
ER -