A semantic framework for preference handling in answer set programming

Details A semantic framework for preference handling in answer set programming A semantic framework for preference handling in answer set programming

2003-01-23

arxiv.org/abs/cs/0301023v1

Computer Science

Artificial Intelligence

39 pages. To appear in Theory and Practice of Logic Programming

Scientific paper

We provide a semantic framework for preference handling in answer set programming. To this end, we introduce preference preserving consequence operators. The resulting fixpoint characterizations provide us with a uniform semantic framework for characterizing preference handling in existing approaches. Although our approach is extensible to other semantics by means of an alternating fixpoint theory, we focus here on the elaboration of preferences under answer set semantics. Alternatively, we show how these approaches can be characterized by the concept of order preservation. These uniform semantic characterizations provide us with new insights about interrelationships and moreover about ways of implementation.

Affiliated with

Also associated with

No associations

Rating

A semantic framework for preference handling in answer set 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 A semantic framework for preference handling in answer set programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A semantic framework for preference handling in answer set programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-74146