A Family of Defeasible Reasoning Logics and its Implementation

Antoniou, Grigoris, Billington, David, Governatori, Guido, Maher, Michael J. and Rock, Andrew (2000). A Family of Defeasible Reasoning Logics and its Implementation. In: Werner Horn, 14th European Conference on Artificial Intelligence, *, (459-463). *.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
UQ9696_OA.pdf ecai2000f.pdf application/pdf 76.62KB 824
Author Antoniou, Grigoris
Billington, David
Governatori, Guido
Maher, Michael J.
Rock, Andrew
Title of paper A Family of Defeasible Reasoning Logics and its Implementation
Conference name 14th European Conference on Artificial Intelligence
Conference location *
Conference dates *
Publication Year 2000
Sub-type Fully published paper
Open Access Status File (Publisher version)
Editor Werner Horn
Start page 459
End page 463
Total pages 5
Abstract/Summary Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more efficient approach than other nonmonotonic reasoning systems. This paper presents a family of defeasible reasoning formalisms built around Nute's defeasible logic. We describe the motivations of these formalisms and derive some basic properties and interrelationships. We also describe a query answering system that supports these formalisms and is available on the World Wide Web.
Subjects 280403 Logics and Meanings of Programs
280301 Programming Techniques
Keyword Defeasible logic
Logic programming
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status Unknown

Version Filter Type
Citation counts: Google Scholar Search Google Scholar
Created: Mon, 21 Mar 2005, 10:00:00 EST by Guido Governatori on behalf of Scholarly Communication and Digitisation Service