Implementing preferences with asprin?

Abstract. asprin offers a framework for expressing and evaluating combinations of quantitative and qualitative preferences among the stable models of a logic pro-gram. In this paper, we demonstrate the generality and flexibility of the method-ology by showing how easily existing preference relations can be implemented in asprin. Moreover, we show how the computation of optimal stable models can be improved by using declarative heuristics. We empirically evaluate our contri-butions and contrast them with dedicated implementations. Finally, we detail key aspects of asprin’s implementation.