Embedding Defeasible Logic into Logic Programming

Details Embedding Defeasible Logic into Logic Programming Embedding Defeasible Logic into Logic Programming

2005-11-15

arxiv.org/abs/cs/0511055v1

Computer Science

Logic in Computer Science

To appear in Theory and Practice of Logic Programming

Scientific paper

Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a meta-program P(D). We show that under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D are included in all stable models of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.

Affiliated with

Also associated with

No associations

Rating

Embedding Defeasible Logic into Logic Programming 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 Embedding Defeasible Logic into Logic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embedding Defeasible Logic into Logic Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-7467