Representation results for defeasible logic
Top Cited Papers
- 1 April 2001
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 2 (2), 255-287
- https://doi.org/10.1145/371316.371517
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.Keywords
This publication has 8 references indexed in Scilit:
- A study of provability in defeasible logicPublished by Springer Science and Business Media LLC ,1998
- Nonmonotonic ReasoningPublished by MIT Press ,1997
- Abstract argumentationArtificial Intelligence and Law, 1996
- Transformation of logic programs: Foundations and techniquesThe Journal of Logic Programming, 1994
- Ordered logic: defeasible reasoning for multiple agentsDecision Support Systems, 1994
- Defeasible Logic is StableJournal of Logic and Computation, 1993
- Nonmonotonic LogicPublished by Springer Science and Business Media LLC ,1993
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965