Propositional Defeasible Logic has Linear Complexity
Michael J. Maher
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.
Create a lesson
Related papers
LLM-Based Policy Compliance Verification of Loan Applications
Florentina Voboril
Maximising Transparency in Context Compaction Improves Retention of Facts and Commitments for Lightweight Coding Agents
Felix Woolford
EvalBuilder: Can LLMs Build Efficient Benchmarks?
Huaisheng Zhu, Hangfan Zhang, Teng Xiao et al.
Designing Textual Interfaces To Enhance Llm Reasoning On Audio-Visual Question Answering
Yi Wang, Tianzi Wang, Tong Lei et al.
Beyond Correctness: Compute-Responsive Data Selection for Reasoning Model Post-Training
Liang He, Xiangyu Li, Yuxin Wang et al.
Memorizing Who, Knowing How: Benchmarking Personal and Procedural Memory for Persistent Assistants
Maosheng Qin, Qi Zhang, Mingxuan Xia et al.