Preferences à la Brewka and Eiter

Gerhard Brewka and Thomas Eiter have introduced in [2] another approach to preference handling. This approach is also implementable in our framework.

In common with previous work of Gerd Brewka, they begin with a partial order on a rule base, but define preference with respect to total orders that conform to the original partial order. As well, answer sets are first generated and the ``preferred'' answer sets are selected subsequently. To this end, they only deal with ``static'' preferences whose preferred answer sets are defined in terms of a modified definition of answer sets.

Our (prototypical) implementation of their approach is obtainable here. It is best tested with the examples given in Section .