Abstract
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. At first, we are interested in semantical underpinnings for existing approaches to preference handling in extended logic programming. To begin with, we explore three different approaches that have been recently proposed in the literature. Because these approaches use rather different formal means, we furnish a uniform characterizations that allows us to gain insights into the relationships among these approaches.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schaub, T. (2001). What’s Your Preference? And How to Express and Implement It in Logic Programming!. In: Benferhat, S., Besnard, P. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2001. Lecture Notes in Computer Science(), vol 2143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44652-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-44652-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42464-2
Online ISBN: 978-3-540-44652-1
eBook Packages: Springer Book Archive