Maher, Michael ; Rock, Allan ; Antoniou, Grigoris ; Billington, David ; Miller, Tristan (2000)
Efficient Defeasible Reasoning Systems.
doi: 10.1109/TAI.2000.889898
Konferenzveröffentlichung, 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: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2000 |
| Autor(en): | Maher, Michael ; Rock, Allan ; Antoniou, Grigoris ; Billington, David ; Miller, Tristan |
| Art des Eintrags: | Bibliographie |
| Titel: | Efficient Defeasible Reasoning Systems |
| Sprache: | Englisch |
| Publikationsjahr: | 2000 |
| Buchtitel: | Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000) |
| DOI: | 10.1109/TAI.2000.889898 |
| URL / URN: | https://dx.doi.org/10.1109/TAI.2000.889898 |
| 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-2000-0009 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Ubiquitäre Wissensverarbeitung |
| Hinterlegungsdatum: | 31 Dez 2016 14:29 |
| Letzte Änderung: | 23 Aug 2018 12:00 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum