Propositional Defeasible Logic has Linear Complexity

@article{Maher2001PropositionalDL,
  title={Propositional Defeasible Logic has Linear Complexity},
  author={Michael J. Maher},
  journal={ArXiv},
  year={2001},
  volume={cs.AI/0405090}
}
  • Michael J. Maher
  • Published 2001
  • Computer Science
  • ArXiv
  • 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. 
    164 Citations

    Figures and Topics from this paper

    An inclusion theorem for defeasible logics
    • 37
    • PDF
    Formalizing Defeasible Logic in CAKE
    • 3
    • PDF
    Possible World Semantics for Defeasible Deontic Logic
    • 11
    • PDF
    Defeasible logic with dynamic priorities
    • 11
    • PDF
    Temporalised normative positions in defeasible logic
    • 147
    • PDF
    Temporal Extensions to Defeasible Logic
    • 30
    • PDF
    Argumentation Semantics for Defeasible Logics
    • 55
    • PDF
    Practical Normative Reasoning with Defeasible Deontic Logic
    • 7
    Defeasible Logic: Agency, Intention and Obligation
    • 79
    • PDF

    References

    SHOWING 1-10 OF 31 REFERENCES
    A Study of Provability in Defeasible Logic
    • 27
    A Denotational Semantics of Defeasible Logic
    • 18
    Normal Forms for Defeasible Logic
    • 36
    • PDF
    Representation results for defeasible logic
    • 350
    • PDF
    The Complexity of Propositional Default Logics
    • 79
    A Semantic Decomposition of Defeasible Logics
    • 63
    • PDF
    Defeasible Logic is Stable
    • 128
    • PDF
    Efficient defeasible reasoning systems
    • 79
    • PDF