Computing temporal defeasible logic

  • Authors:
  • Guido Governatori;Antonino Rotolo

  • Affiliations:
  • NICTA, Australia;CIRSFID and DSG, University of Bologna, Italy

  • Venue:
  • RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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.