Skip to main content
Article thumbnail
Location of Repository

Representation Results for Defeasible Logic

By Grigoris Antoniou, David Billington, Guido Governatori and Michael J. Maher

Abstract

The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism for nonmonotonic reasoning based on rules and priorities. The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the other hand they have been used in the development of an efficient implementation of defeasible logic

Topics: defeasible logic, transformations, normal forms, 279901 Global Change Biology, 280402 Mathematical Logic and Formal Languages, 280403 Logics and Meanings of Programs, 440106 Logic
Year: 2001
DOI identifier: 10.1145/371316.371517
OAI identifier: oai:espace.library.uq.edu.au:UQ:9620

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.