Preference Logic Programs using Answer Sets
Claudia Zepeda, Mauricio Osorio · Research in Computing Science · 2006
We introduce preference rules which allow us to specify preferences as an ordering among the possible solutions of a problem. Specifi- cally, we propose the semantics for preference logic programs. The formalism used to develop our work is Answer Set Programming(ASP). Most research on ASP and in particular about preferences in ASP supposes syntactically simple rules. So, our approach permits expressing preferences for general theories