Weight Constraints with Preferences in ASP

摘要

Abstract. 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.