Abstract
In computing circumscription by logic programming, circumscription is usually transformed into some target logic program whose answer sets (or stable models) yield the Herbrand models of circumscription. In this paper, we propose a new method of computing models of prioritized circumscription in answer set programming, which is correct and more efficient than previous approaches. The basic idea of our approach is to transform a given circumscription into a general extended disjunctive program whose answer sets (if exist) yield strictly preferred models to a given candidate model with respect to the preorder \(\leq^{P^{1}> \cdots>P^{k};Z}\). Hence its inconsistency enables us to determine models of prioritized circumscription. Based on our new method, a circumscriptive model generator has already been implemented. Its performance for some interesting examples of circumscription is also addressed.
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
Brewka, G., Niemelä, I., Syrjänen, T.: Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 444–455. Springer, Heidelberg (2002)
Brewka, G., Niemelä, I., Truszczynski, M.: Answer set Optimization. In: Proc. of 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), pp. 867–872 (2003)
Cadoli, M.: The complexity of model checking for circumscriptive formulae. Information Processing Letters 44, 113–118 (1992)
Delgrande, J.P., Schaub, T., Tompits, H.: A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming 3(2), 129–187 (2003)
Eiter, T., Gottlob, G.: Propositional circumscription and extended closed-world reasoning are Πp 2 -Complete. Theoretical Computer Science 114(2), 231–245 (1993)
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for nonmonotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 364–375. Springer, Heidelberg (1997)
Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing preferred answer sets by meta-interpretation in answer set programming. Theory and Practice of Logic Programming 3(4-5), 463–498 (2003)
Gelfond, M., Lifschitz, V.: Compiling circumscriptive theories into logic programs. In: Proc. of AAAI 1988, pp. 455–459 (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Inoue, K.: Linear resolution for consequence finding. Artificial Intelligence 56, 301–353 (1992)
Inoue, K., Sakama, C.: On positive occurrences of negation as failure. In: Proc. of KR 1994, pp. 293–304 (1994)
Janhunen, T., Niemelä, I., Simons, P., You, J.: Unfolding Partiality and Disjunctions in Stable Model Semantics. In: Proc. of KR 2000, pp. 411–422 (2000)
Janhunen, T., Oikarinen, E.: Testing the equivalence of logic programs under stable models semantics. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 493–504. Springer, Heidelberg (2002)
Lifschitz, V.: Computing circumscription. In: Proc. of IJCAI 1985, pp. 121–127 (1985)
McCarthy, J.: Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence 28, 89–116 (1986)
Nerode, A., Ng, R.T., Subrahmanian, V.S.: Computing circumscriptive databases, part I: theory and algorithms. Information and Computation 116, 58–80 (1995)
Oikarinen, E., Janhunen, T.: Verifying the equivalence of logic programs in the disjunctive case. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 180–193. Springer, Heidelberg (2003)
Pfeifer, G.: Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 220–233. Springer, Heidelberg (2003)
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)
Sakama, C., Inoue, K.: Representing priorities in logic programs. In: Proc. of Joint Int. Conf. and Sympo. on Logic Programming (JICSLP 1996), pp. 82–96 (1996)
Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence 123, 185–222 (2000)
Satoh, K.: Formalizing soft constraints by interpretation ordering. In: Proc. of 9th European Conference on Artificial Intelligence (ECAI 1990), pp. 585–590 (1990)
Wakaki, T., Satoh, K.: Compiling prioritized circumscription into extended logic programs. In: Proc. of IJCAI 1997, pp. 182–187 (1997)
Wakaki, T., Inoue, K., Sakama, C., Nitta, K.: Computing preferred answer sets in answer set programming. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol. 2850, pp. 259–273. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wakaki, T., Inoue, K. (2004). Compiling Prioritized Circumscription into Answer Set Programming. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-27775-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22671-0
Online ISBN: 978-3-540-27775-0
eBook Packages: Springer Book Archive