Hostname: page-component-7c8c6479df-7qhmt Total loading time: 0 Render date: 2024-03-28T22:52:01.038Z Has data issue: false hasContentIssue false

A semantic framework for preference handling in answer set programming

Published online by Cambridge University Press:  31 July 2003

TORSTEN SCHAUB
Affiliation:
Institut für Informatik, Universität Potsdam, Postfach 60 15 53, D-14415 Potsdam, Germany (e-mail: torsten@cs.uni-potsdam.de)
KEWEN WANG
Affiliation:
School of Computing and Information Technology, Griffith University, Brisbane 4111, Australia (e-mail: K.Wang@cit.gu.edu.au)

Abstract

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 inter-relationships and moreover about ways of implementation.

Type
Regular Papers
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)