Weight and cardinality constraints constitute a very useful programming construct widely adopted in Answer Set Programming (ASP). In recent work we have proposed RASP, an extension to plain ASP where complex forms of preferences can be flexibly expressed. In this paper, we illustrate an application of these preferences within weight/cardinality constraints. We emphasize, mainly by simple examples, the usefulness of the proposed extension. We also show how the semantics for ASP with weight constraints can be suitably extended so as to encompass RASP-like preferences, without affecting complexity. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Costantini, S., & Formisano, A. (2011). Weight constraints with preferences in ASP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6645 LNAI, pp. 229–235). https://doi.org/10.1007/978-3-642-20895-9_24
Mendeley helps you to discover research relevant for your work.