Advertisement
Published in:
2005 | OriginalPaper | Chapter
circ2dlp — Translating Circumscription into Disjunctive Logic Programming
Authors : Emilia Oikarinen, Tomi Janhunen
Published in: Logic Programming and Nonmonotonic Reasoning
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 [5,12] which makes atoms appearing in a disjunctive program false by default. This is often desirable from the knowledge representation point of view, but certain domains become awkward to formalize if all atoms are blindly subject to minimization. In contrast to this,
parallel circumscription
[11] provides a re.ned notion of minimal models as it distinguishes
varying
and
fixed
atoms in addition to those being falsified. This eases the task of knowledge presentation in many cases. For example, it is straightforward to formalize Reiter-style
minimal diagnoses
[13] for digital circuits using parallel circumscription.