In this paper we formally prove that compliance results derived from temporal defeasible logic are equivalent to the ones obtained in the standard defeasible deontic logic. In order to do so we first introduce an operator allowing us to translate rules from the standard to the temporal framework. Then we consider the sets of obligations used in the compliance checking algorithm from and prove that they are isomorphic to the previously defined operator. Being able to add time to standard deontic logic will allow for a better and more elegant representation of obligations and improvement in computational efficiency.
展开▼