Propositional Defeasible Logic has Linear Complexity
Artificial Intelligence
2009-09-29 v1
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.
Cite
@article{arxiv.cs/0405090,
title = {Propositional Defeasible Logic has Linear Complexity},
author = {Michael J. Maher},
journal= {arXiv preprint arXiv:cs/0405090},
year = {2009}
}
Comments
Appeared in Theory and Practice of Logic Programming, vol. 1, no. 6, 2001