Computing Temporal Defeasible Logic
- Cite this paper as:
- Governatori G., Rotolo A. (2013) Computing Temporal Defeasible Logic. In: Morgenstern L., Stefaneas P., Lévy F., Wyner A., Paschke A. (eds) Theory, Practice, and Applications of Rules on the Web. RuleML 2013. Lecture Notes in Computer Science, vol 8035. Springer, Berlin, Heidelberg
We investigate the complexity of temporal defeasible logic, and propose an efficient algorithm to compute the extension of any theory. The logic and algorithm are discussed in regard to modeling deadlines and normative retroactivity.
Unable to display preview. Download preview PDF.