On the complexity of Temporal Defeasible Logic
Guido Governatori, Antonino Rotolo · 2010
In this paper we investigate the complexity of temporal defeasible logic, and we propose an efficient algorithm to compute the extension of a temporalised defeasible theory. We motivate the logic showing how it can be used to model deadlines.