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. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
APA
Governatori, G., & Rotolo, A. (2013). Computing temporal defeasible logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8035, pp. 114–128). Springer Verlag. https://doi.org/10.1007/978-3-642-39617-5_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free