Propositional Defeasible Logic has Linear Complexity

Details Propositional Defeasible Logic has Linear Complexity Propositional Defeasible Logic has Linear Complexity

2004-05-24

arxiv.org/abs/cs/0405090v1

Theory and Practice of Logic Programming, vol. 1, no. 6, 2001

Computer Science

Artificial Intelligence

Appeared in Theory and Practice of Logic Programming, vol. 1, no. 6, 2001

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Propositional Defeasible Logic has Linear Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Propositional Defeasible Logic has Linear Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Propositional Defeasible Logic has Linear Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-711998