Propositional Defeasible Logic has Linear Complexity
<|reference_start|>Propositional Defeasible Logic has Linear Complexity: 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.<|reference_end|>
@article{maher2004propositional,
    title={Propositional Defeasible Logic has Linear Complexity},
    author={Michael J. Maher},
    journal={Theory and Practice of Logic Programming, vol. 1, no. 6, 2001},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0405090},
    primaryClass={cs.AI}
}