Propositional defeasible logic has linear complexity

  • Authors:
  • Michael J. Maher

  • Affiliations:
  • Department of Mathematical and Computer Sciences, Loyola University Chicago, Chicago, IL, USA/ (e-mail: mjm@cs.luc.edu) and aff2 School of Computing & Information Technology, Griffith University

  • Venue:
  • Theory and Practice of Logic Programming
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.