Representation results for defeasible logic
File version
Accepted Manuscript (AM)
Author(s)
Billington, D
Governatori, G
Maher, MJ
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
License
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.
Journal Title
ACM Transactions on Computational Logic
Conference Title
Book Title
Edition
Volume
2
Issue
2
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© ACM, 2001. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Volume 2 Issue 2, April 2001, DOI: 10.1145/371316.371517.
Item Access Status
Note
Access the data
Related item(s)
Subject
Pure mathematics
Theory of computation