The stable model semantics of
disjunctive logic programs
(DLPs) is based on
which assign atoms false by default. While this feature is highly useful-leading to concise problem encodings-it occasionally renders knowledge representation with disjunctive rules difficult. Reiter-style
 provide a good example in this respect. This problem can be alleviated by a more refined control of minimization provided by
 which allows certain atoms to vary or to have fixed truth values. The scheme of
[3,2] generalizes this setting with priority classes for atoms being minimized. Our aim is to bring these enhancements of minimality to the realm of disjunctive logic programming.We strive for a translation-based approach where varying and fixed atoms, as well as priority classes are effectively removed from representations by transformations. We have already addressed parallel circumscription and provided a
. Here we present a similar transformation for prioritized circumscription, extend our implementation , and report preliminary experiments.