Expressing Preferences using Preference Set Constraint Atoms

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Additional info

9 pages

Type

Scientific paper

Abstract

This paper introduces an extension of Answer Set Programming called Preference Set Constraint Programming which is a convenient and general formalism to reason with preferences. PSC programming extends Set Constraint Programming introduced by Marek and Remmel (Marek and Remmel 2004) by introducing two types of preference set constraint atoms, measure preference set constraint atoms and pre-ordered preference set constraint atoms, which are extensions of set constraint atoms. We show that the question of whether a PSC program has a preferred stable model is CoNP-complete. We give examples of the uses of the preference set constraint atoms and show that Answer Set Optimization (Brewka, Niemel\"a, and Truszczynski 2003) and General Preference (Son and Pontelli 2006) can be expressed using preference set constraint atoms.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Expressing Preferences using Preference Set Constraint Atoms 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 Expressing Preferences using Preference Set Constraint Atoms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Expressing Preferences using Preference Set Constraint Atoms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-344672

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.