Computing Temporal Defeasible Logic

  • Guido Governatori
  • Antonino Rotolo
Conference paper

DOI: 10.1007/978-3-642-39617-5_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8035)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Guido Governatori
    • 1
  • Antonino Rotolo
    • 2
  1. 1.NICTAAustralia
  2. 2.CIRSFID and DSGUniversity of BolognaItaly

Personalised recommendations