A family of defeasible reasoning logics and its implementation

Loading...
Thumbnail Image
File version
Author(s)
Antoniou, G
Billington, D
Governatori, G
Maher, MJ
Rock, A
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Horn, W

Date
2000
Size

633973 bytes

File type(s)

application/pdf

Location

BERLIN, GERMANY

License
Abstract

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.

Journal Title
Conference Title

ECAI 2000: 14TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS

Book Title
Edition
Volume

54

Issue
Thesis Type
Degree Program
School
DOI
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2000 IOS Press. For information about this conference please refer to the conference's website or contact the authors.

Item Access Status
Note
Access the data
Related item(s)
Subject

History, heritage and archaeology

Persistent link to this record
Citation