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.
G. Governatori, A. Rotolo (2013). Computing Temporal Defeasible Logic. Berlin : Springer Berlin Heidelberg [10.1007/978-3-642-39617-5_13].
Computing Temporal Defeasible Logic
GOVERNATORI, GUIDO;ROTOLO, ANTONINO
2013
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.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
