Affiliation:
1. Griffith Univ., Nathan, Australia
2. Queensland Univ. of Technology, Brisbane, Australia
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference22 articles.
1. ANTONIOU G. 1997. Nonmonotonic Reasoning. MIT Press. ANTONIOU G. 1997. Nonmonotonic Reasoning. MIT Press.
2. Defeasible logic versus logic programming without negation as failure;ANTONIOU G.;Journal of Logic Programming,2000
Cited by
214 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献