Representation results for defeasible logic

Details Representation results for defeasible logic Representation results for defeasible logic

2000-03-30

arxiv.org/abs/cs/0003082v1

Computer Science

Logic in Computer Science

30 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Representation results for defeasible logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Representation results for defeasible logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Representation results for defeasible logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-201628