Propositional Defeasible Logic has Linear Complexity
arXiv:cs/0405090
Abstract
Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts markedly with most other propositional nonmonotonic logics, in which inference is intractable.
Appeared in Theory and Practice of Logic Programming, vol. 1, no. 6, 2001