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.
The research reported in this paper is partially funded by the Academy of Finland (project #211025) and the European Commission (contract IST-FET-2001-37004).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Kleer, J., Konolige, K.: Eliminating the fixed predicates from a circumscription. Artificial Intelligence 39(3), 391–398 (1989)
Eiter, T., Faber, W., Leone, N., Pfeifer, G.: The diagnosis frontend of the DLV system. AI Communications 12(1-2), 99–111 (1999)
Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: Propositional case. Annals of Math. and AI 15, 289–323 (1995)
Gelfond, M., Lifschitz, V.: Compiling circumscriptive theories into logic programs. In: Proceedings of the 7th National Conference on Artificial Intelligence, St. Paul, MN, August 1988, pp. 449–455. AAAI Press, Menlo Park (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Inoue, K., Sakama, C.: Negation as failure in the head. Journal of Logic Programming 35(1), 39–78 (1998)
Janhunen, T., Niemelä, I., Seipel, D., Simons, P., You, J.-H.: Unfolding partiality and disjunctions in stable model semantics. ACM Transactions on Computational Logic (2005), To appear, see http://www.acm.org/tocl/accepted.html
Janhunen, T., Oikarinen, E.: Capturing parallel circumscription with disjunctive logic programs. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 134–146. Springer, Heidelberg (2004)
Lee, J., Lin, F.: Loop formulas for circumscription. In: Proceedings of 19th National Conference on Artificial Intelligence, San Jose, California, USA, July 2004, pp. 281–286. The MIT Press, Cambridge (2004)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic (2005), To appear, see http://www.acm.org/tocl/accepted.html
Lifschitz, V.: Computing circumscription. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, California, USA, August 1985, pp. 121–127. Morgan Kaufmann, San Francisco (1985)
Przymusinski, T.C.: Stable semantics for disjunctive programs. New Generation Computing 9, 401–424 (1991)
Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence 32, 57–95 (1987)
Sakama, C., Inoue, K.: Embedding circumscriptive theories in general disjunctive programs. In: Marek, V.W., Truszczyński, M., Nerode, A. (eds.) LPNMR 1995. LNCS, vol. 928, pp. 344–357. Springer, Heidelberg (1995)
Wakaki, T., Inoue, K.: Compiling prioritized circumscription into answer set programming. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 356–370. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oikarinen, E., Janhunen, T. (2005). circ2dlp — Translating Circumscription into Disjunctive Logic Programming. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2005. Lecture Notes in Computer Science(), vol 3662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546207_36
Download citation
DOI: https://doi.org/10.1007/11546207_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28538-0
Online ISBN: 978-3-540-31827-9
eBook Packages: Computer ScienceComputer Science (R0)