Preferred extensions as stable models

Details Preferred extensions as stable models Preferred extensions as stable models

2008-03-26

arxiv.org/abs/0803.3812v1

Computer Science

Artificial Intelligence

17 pages, 2 Figures; to appear in Theory and Practice of Logic Programming (TPLP)

Scientific paper

Given an argumentation framework AF, we introduce a mapping function that constructs a disjunctive logic program P, such that the preferred extensions of AF correspond to the stable models of P, after intersecting each stable model with the relevant atoms. The given mapping function is of polynomial size w.r.t. AF. In particular, we identify that there is a direct relationship between the minimal models of a propositional formula and the preferred extensions of an argumentation framework by working on representing the defeated arguments. Then we show how to infer the preferred extensions of an argumentation framework by using UNSAT algorithms and disjunctive stable model solvers. The relevance of this result is that we define a direct relationship between one of the most satisfactory argumentation semantics and one of the most successful approach of non-monotonic reasoning i.e., logic programming with the stable model semantics.

Affiliated with

Also associated with

No associations

Rating

Preferred extensions as stable models 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 Preferred extensions as stable models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Preferred extensions as stable models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353237