Representation results for defeasible logic
@article{Antoniou2001RepresentationRF,
title={Representation results for defeasible logic},
author={G. Antoniou and D. Billington and G. Governatori and Michael J. Maher},
journal={ACM Trans. Comput. Log.},
year={2001},
volume={2},
pages={255-287}
}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… CONTINUE READING
Figures and Topics from this paper
Figures
350 Citations
On the Equivalence of Defeasible Deontic Logic and Temporal Defeasible Logic
- Computer Science
- PRIMA
- 2014
- 2
- PDF
Temporal Extensions to Defeasible Logic
- Computer Science
- Australian Conference on Artificial Intelligence
- 2007
- 30
- PDF
A Model-Theoretic Semantics for Defeasible Logic
- Computer Science, Mathematics
- Paraconsistent Computational Logic
- 2002
- 48
- PDF
Defeasible reasoning: A discussion of some intuitions
- Mathematics, Computer Science
- Int. J. Intell. Syst.
- 2006
- 7
References
SHOWING 1-4 OF 4 REFERENCES
Transformation of Logic Programs: Foundations and Techniques
- Computer Science
- J. Log. Program.
- 1994
- 243
- Highly Influential
A Machine-Oriented Logic Based on the Resolution Principle
- Computer Science
- JACM
- 1965
- 4,220
- Highly Influential
- PDF
Towards a Declarative Language for Negotiating Executable Contracts, Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99)
- 1999