2007 | OriginalPaper | Chapter
A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming
Authors : Emilia Oikarinen, Tomi Janhunen
Published in: Logic Programming
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The stable model semantics of
disjunctive logic programs
(DLPs) is based on
minimal models
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
minimal diagnoses
[1] provide a good example in this respect. This problem can be alleviated by a more refined control of minimization provided by
parallel circumscription
[2] which allows certain atoms to vary or to have fixed truth values. The scheme of
prioritized circumscription
[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
linear
and
faithful
but
non-modular translation
[4]. Here we present a similar transformation for prioritized circumscription, extend our implementation [5], and report preliminary experiments.