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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Cited by
90 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献