asprin: Answer Set Programming with Preferences

Abstract

Answer Set Programming (ASP) is a well established approach to declarative problem solving, combining a rich yet simple modeling language with high-performance solving capacities. In this talk we present asprin, a general, flexible and extensible framework for preferences in ASP. asprin is general and captures many of the existing approaches to preferences. It is flexible, because it allows for the combination of different types of preferences. It is also extensible, allowing for an easy implementation of new approaches to preferences. Since it is straightforward to capture propositional theories and constraint satisfaction problems in ASP, the framework is also relevant to optimization in Satisfiability Testing and Constraint Processing.