Abstract
Defeasible logic is a logic-programming based nonmonotonic reasoning formalism which has an efficient implementation. It makes use of facts, strict rules, defeasible rules, defeaters, and a superiority relation. We clarify the proof theory of defeasible logic through an analysis of the conclusions it can draw. Using it, we show that defeaters do not add to the expressiveness of defeasible logic, among other results. The analysis also supports the restriction of defeasible logic to admit only acyclic superiority relations.
Original language | English |
---|---|
Title of host publication | Advanced Topics in Artificial Intelligence - 11th Australian Joint Conference on Artificial Intelligence, AI 1998, Selected Papers |
Editors | Grigoris Antoniou, John Slaney |
Publisher | Springer Verlag |
Pages | 215-226 |
Number of pages | 12 |
ISBN (Print) | 3540651381, 9783540651383 |
Publication status | Published - 13 Nov 1998 |
Externally published | Yes |
Event | 11th Australian Joint Conference on Artificial Intelligence - Brisbane, Australia Duration: 13 Jul 1998 → 17 Jul 1998 Conference number: 11 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 1502 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 11th Australian Joint Conference on Artificial Intelligence |
---|---|
Abbreviated title | AI 98 |
Country/Territory | Australia |
City | Brisbane |
Period | 13/07/98 → 17/07/98 |