[full paper] |
Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher, Andrew Rock
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.
Keywords: Nonmonotonic Reasoning, Knowledge Representation, Logic Programming
Citation: Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher, Andrew Rock: A Family of Defeasible Reasoning Logics and its Implementation. In W.Horn (ed.): ECAI2000, Proceedings of the 14th European Conference on Artificial Intelligence, IOS Press, Amsterdam, 2000, pp.459-463.