EFFICIENT DEFEASIBLE REASONING SYSTEMS
- 1 December 2001
- journal article
- Published by World Scientific Pub Co Pte Ltd in International Journal on Artificial Intelligence Tools
- Vol. 10 (4), 483-501
- https://doi.org/10.1142/s0218213001000623
Abstract
For many years, the non-montonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the practical use of non-monotonic reasoning. In this work we discuss defeasible logic, a less-expressive but more efficient non-monotonic logic. We report on two new implemented systems for defeasible logic: a query answering system employing a backward-chaining approach, and a forward-chaining implementation that computes all conclusions. Our experimental evaluation demonstrates that the systems can deal with large theories (up to hundreds of thousands of rules). We show that defeasible logic has linear complexity, which contrasts markedly with most other non-monotonic logics and helps to explain the impressive experimental results. We believe that defeasible logic, with its efficiency and simplicity, is a good candidate to be used as a modeling language for practical applications, including modelling of regulations and business rules.Keywords
This publication has 13 references indexed in Scilit:
- Propositional defeasible logic has linear complexityTheory and Practice of Logic Programming, 2001
- Defeasible logic versus Logic Programming without Negation as FailureThe Journal of Logic Programming, 2000
- Inheritance comes of age: applying nonmonotonic techniques to problems in industryArtificial Intelligence, 1998
- GOLOG: A logic programming language for dynamic domainsThe Journal of Logic Programming, 1997
- Argument-based extended logic programming with defeasible prioritiesJournal of Applied Non-Classical Logics, 1997
- Representing action and change by logic programsThe Journal of Logic Programming, 1993
- A survey of complexity results for non-monotonic logicsThe Journal of Logic Programming, 1993
- Defeasible Logic is StableJournal of Logic and Computation, 1993
- Resolving ambiguity in nonmonotonic inheritance hierarchiesArtificial Intelligence, 1992
- A modular translation from defeasible nets to defeasible logicsJournal of Experimental & Theoretical Artificial Intelligence, 1990