On Concise Encodings of Preferred Extensions

Details On Concise Encodings of Preferred Extensions On Concise Encodings of Preferred Extensions

2002-07-08

arxiv.org/abs/cs/0207024v1

Computer Science

Artificial Intelligence

Proc. 9th Worskhop on Non-monotonic reasoning, Toulouse, 2002 (NMR'02) (7 pages)

Scientific paper

Much work on argument systems has focussed on preferred extensions which define the maximal collectively defensible subsets. Identification and enumeration of these subsets is (under the usual assumptions) computationally demanding. We consider approaches to deciding if a subset S is a preferred extension which query a representations encoding all such extensions, so that the computational effort is invested once only (for the initial enumeration) rather than for each separate query.

Affiliated with

Also associated with

No associations

Rating

On Concise Encodings of Preferred Extensions 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 On Concise Encodings of Preferred Extensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Concise Encodings of Preferred Extensions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-172477