A study of provability in defeasible logic

M. J. Maher, G. Antoniou, D. Billington

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

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.

LanguageEnglish
Title of host publicationAdvanced Topics in Artificial Intelligence - 11th Australian Joint Conference on Artificial Intelligence, AI 1998, Selected Papers
EditorsGrigoris Antoniou, John Slaney
PublisherSpringer Verlag
Pages215-226
Number of pages12
ISBN (Print)3540651381, 9783540651383
Publication statusPublished - 13 Nov 1998
Externally publishedYes
Event11th Australian Joint Conference on Artificial Intelligence - Brisbane, Australia
Duration: 13 Jul 199817 Jul 1998
Conference number: 11

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1502
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th Australian Joint Conference on Artificial Intelligence
Abbreviated titleAI 98
CountryAustralia
CityBrisbane
Period13/07/9817/07/98

Fingerprint

Logic programming
Logic
Nonmonotonic Reasoning
Proof Theory
Expressiveness
Logic Programming
Efficient Implementation
Restriction

Cite this

Maher, M. J., Antoniou, G., & Billington, D. (1998). A study of provability in defeasible logic. In G. Antoniou, & J. Slaney (Eds.), Advanced Topics in Artificial Intelligence - 11th Australian Joint Conference on Artificial Intelligence, AI 1998, Selected Papers (pp. 215-226). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1502). Springer Verlag.
Maher, M. J. ; Antoniou, G. ; Billington, D. / A study of provability in defeasible logic. Advanced Topics in Artificial Intelligence - 11th Australian Joint Conference on Artificial Intelligence, AI 1998, Selected Papers. editor / Grigoris Antoniou ; John Slaney. Springer Verlag, 1998. pp. 215-226 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{40b82d6e782b4cfba37e46ef147c8a3d,
title = "A study of provability in defeasible logic",
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.",
author = "Maher, {M. J.} and G. Antoniou and D. Billington",
year = "1998",
month = "11",
day = "13",
language = "English",
isbn = "3540651381",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "215--226",
editor = "Grigoris Antoniou and John Slaney",
booktitle = "Advanced Topics in Artificial Intelligence - 11th Australian Joint Conference on Artificial Intelligence, AI 1998, Selected Papers",

}

Maher, MJ, Antoniou, G & Billington, D 1998, A study of provability in defeasible logic. in G Antoniou & J Slaney (eds), Advanced Topics in Artificial Intelligence - 11th Australian Joint Conference on Artificial Intelligence, AI 1998, Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1502, Springer Verlag, pp. 215-226, 11th Australian Joint Conference on Artificial Intelligence, Brisbane, Australia, 13/07/98.

A study of provability in defeasible logic. / Maher, M. J.; Antoniou, G.; Billington, D.

Advanced Topics in Artificial Intelligence - 11th Australian Joint Conference on Artificial Intelligence, AI 1998, Selected Papers. ed. / Grigoris Antoniou; John Slaney. Springer Verlag, 1998. p. 215-226 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1502).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A study of provability in defeasible logic

AU - Maher, M. J.

AU - Antoniou, G.

AU - Billington, D.

PY - 1998/11/13

Y1 - 1998/11/13

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84947902250&partnerID=8YFLogxK

UR - https://www.springer.com/gb/book/9783540651383

M3 - Conference contribution

SN - 3540651381

SN - 9783540651383

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 215

EP - 226

BT - Advanced Topics in Artificial Intelligence - 11th Australian Joint Conference on Artificial Intelligence, AI 1998, Selected Papers

A2 - Antoniou, Grigoris

A2 - Slaney, John

PB - Springer Verlag

ER -

Maher MJ, Antoniou G, Billington D. A study of provability in defeasible logic. In Antoniou G, Slaney J, editors, Advanced Topics in Artificial Intelligence - 11th Australian Joint Conference on Artificial Intelligence, AI 1998, Selected Papers. Springer Verlag. 1998. p. 215-226. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).