Temporal Extensions to Defeasible Logic

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...

Full description

Saved in:
Bibliographic Details
Published inAI 2007: Advances in Artificial Intelligence Vol. 4830; pp. 476 - 485
Main Authors Governatori, Guido, Terenziani, Paolo
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2007
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Artificial intelligence
Causal Reasoning
Data mining
Mathematical theory of computation
Strict Rule
Strong Rule
Temporal Constraint
Temporal Extension
Online AccessGet full text
ISBN9783540769262
3540769269
ISSN0302-9743
1611-3349
DOI10.1007/978-3-540-76928-6_49

Cover

More Information
Summary: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.
ISBN:9783540769262
3540769269
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-76928-6_49