Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Representation results for defeasible logic

Representation results for defeasible logic 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Loading next page...
 
/lp/association-for-computing-machinery/representation-results-for-defeasible-logic-tSBWPnEB8C
Publisher
Association for Computing Machinery
Copyright
Copyright © 2001 by ACM Inc.
ISSN
1529-3785
DOI
10.1145/371316.371517
Publisher site
See Article on Publisher Site

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

ACM Transactions on Computational Logic (TOCL)Association for Computing Machinery

Published: Apr 1, 2001

There are no references for this article.