CIRC2DLP: translating circumscription into disjunctive logic programming

Authors:
Emilia Oikarinen;Tomi Janhunen
Affiliations:
Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Helsinki University of Technology, TKK, Finland;Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Helsinki University of Technology, TKK, Finland
Venue:
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Year:
2005

Citing 8
Cited 4

A theory of diagnosis from first principles

Artificial Intelligence
Eliminating the fixed predicates from a circumscription

Artificial Intelligence
Embedding Circumscriptive Theories in General Disjunctive Programs

LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Unfolding partiality and disjunctions in stable model semantics

ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
The Diagnosis Frontend of the dlv system

AI Communications
Loop formulas for circumscription

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Computing circumscription

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Implementing Prioritized Circumscription by Computing Disjunctive Stable Models

AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
System f2lp --- Computing Answer Sets of First-Order Formulas

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A linear transformation from prioritized circumscription to disjunctive logic programming

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Counterexample guided abstraction refinement algorithm for propositional circumscription

JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.