TU Darmstadt / ULB / TUbiblio

Efficient Defeasible Reasoning Systems

Maher, Michael and Rock, Allan and Antoniou, Grigoris and Billington, David and Miller, Tristan (2001):
Efficient Defeasible Reasoning Systems.
In: International Journal on Artificial Intelligence Tools, pp. 483-501, 10, (4), DOI: 10.1142/S0218213001000623,
[Online-Edition: https://dx.doi.org/10.1142/S0218213001000623],
[Article]

Abstract

For many years, the non-monotonic 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 modelling language for practical applications, including modelling of regulations and business rules.

Item Type: Article
Erschienen: 2001
Creators: Maher, Michael and Rock, Allan and Antoniou, Grigoris and Billington, David and Miller, Tristan
Title: Efficient Defeasible Reasoning Systems
Language: English
Abstract:

For many years, the non-monotonic 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 modelling language for practical applications, including modelling of regulations and business rules.

Journal or Publication Title: International Journal on Artificial Intelligence Tools
Volume: 10
Number: 4
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Ubiquitous Knowledge Processing
Date Deposited: 31 Dec 2016 14:29
DOI: 10.1142/S0218213001000623
Official URL: https://dx.doi.org/10.1142/S0218213001000623
Identification Number: TUD-CS-2001-0011
Related URLs:
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item