Maher, Michael ; Rock, Allan ; Antoniou, Grigoris ; Billington, David ; Miller, Tristan (2001)
Efficient Defeasible Reasoning Systems.
In: International Journal on Artificial Intelligence Tools, 10 (4)
doi: 10.1142/S0218213001000623
Artikel, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2001 |
| Autor(en): | Maher, Michael ; Rock, Allan ; Antoniou, Grigoris ; Billington, David ; Miller, Tristan |
| Art des Eintrags: | Bibliographie |
| Titel: | Efficient Defeasible Reasoning Systems |
| Sprache: | Englisch |
| Publikationsjahr: | 2001 |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | International Journal on Artificial Intelligence Tools |
| Jahrgang/Volume einer Zeitschrift: | 10 |
| (Heft-)Nummer: | 4 |
| DOI: | 10.1142/S0218213001000623 |
| URL / URN: | https://dx.doi.org/10.1142/S0218213001000623 |
| Zugehörige Links: | |
| Kurzbeschreibung (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. |
| ID-Nummer: | TUD-CS-2001-0011 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Ubiquitäre Wissensverarbeitung |
| Hinterlegungsdatum: | 31 Dez 2016 14:29 |
| Letzte Änderung: | 10 Sep 2018 20:09 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum