Abstract.
Prioritized logic programs (PLPs) have a mechanism of representing priority knowledge in logic programs. The declarative semantics of a PLP is given as preferred answer sets which are used for representing nonmonotonic reasoning as well as preference abduction. From the computational viewpoint, however, its implementation issues have little been studied and no sound procedure is known for computing preferred answer sets of PLPs. In this paper, we present a sound and complete procedure to compute all preferred answer sets of a PLP in answer set programming. The procedure is based on a program transformation from a PLP to a logic program and is realized on top of any procedure for answer set programming. The proposed technique also extends PLPs to handle dynamic preference and we address its application to legal reasoning.
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. 445–455. Springer, Heidelberg (2002)
Brewka, G., Eiter, T.: Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence 109, 297–356 (1999)
Brewka, G.: Well-founded Semantics for Extended Logic Programs with Dynamic Preferences. Journal of Artificial Intelligence Research 4, 19–36 (1996)
Delgrande, J.P., Schaub, T.: Expressing Preferences in Default Logic. Artificial Intelligence 123, 41–87 (2000)
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., 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)
Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)
Gelfond, M., Lifschitz, V.: Compiling Circumscriptive Theories into Logic Programs. In: Proc. AAA1 1988, pp. 455-459 (1988); Extended version in Reinfrank, M., Ginsberg, M.L., de Kleer, J., Sandewall, E. (eds.): Non-Monotonic Reasoning 1988. LNCS, vol. 346, pp. 74–99. Springer, Heidelberg (1988)
Gorden, T.F.: The Pleadings Game: An Artifical Intelligence Model of Procedural Justice. Ph.D. thesis, TU Darmstadt (1993)
Inoue, K., Koshimura, M., Hasegawa, R.: Embedding negation as failure into a model generation theorem prover. In: Kapur, D. (ed.) CADE 1992. LNCS (LNAI), vol. 607, pp. 400–415. Springer, Heidelberg (1992)
Inoue, K., Sakama, C.: On Positive Occurrences of Negation as Failure. In: Proc. KR 1994, pp. 293–304 (1994)
Inoue, K., Sakama, C.: Abducing Priorities to Derive Intended Conclusions. In: Proc. Sixteenth International Joint Conference on Artificial Intelligence, pp. 44–49 (1999)
Lifschitz, V.: Computing Circumscription. In: Proc. IJCAI 1985, pp. 121–127 (1985)
McCarthy, J.: Applications of Circumscription to Formalizing Commonsense Knowledge. Artificial Intelligence 28, 89–116 (1986)
Niemelä, I., Simons, P.: Smodels: An implementation of the stable model and well-founded semantics for normal logic programs. In: Proc. the Fourth International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 420–429. Springer, Heidelberg (1997)
Poole, D.: A Logical framework for default reasoning. Artificial Intelligence 36, 27–47 (1988)
Sakama, C., Inoue, K.: Representing Priorities in Logic Programs. In: Proc. Joint International Conference and Symposium on Logic Programming, pp. 82–96 (1996)
Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence 123, 185–222 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wakaki, T., Inoue, K., Sakama, C., Nitta, K. (2003). Computing Preferred Answer Sets in Answer Set Programming. In: Vardi, M.Y., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2003. Lecture Notes in Computer Science(), vol 2850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39813-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-39813-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20101-4
Online ISBN: 978-3-540-39813-4
eBook Packages: Springer Book Archive