Sciweavers

Share
ECAI
2000
Springer

A Family of Defeasible Reasoning Logics and its Implementation

11 years 4 months ago
A Family of Defeasible Reasoning Logics and its Implementation
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.
Grigoris Antoniou, David Billington, Guido Governa
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 2000
Where ECAI
Authors Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher, Andrew Rock
Comments (0)
books