Abstract
Answer Set Programming (ASP), has become a prominent approach for Knowledge Representation and declarative problem solving. ASP has been extended with preferences and several semantics have been proposed. Among the available semantics, the so-called selective semantics have the property of always choosing preferred answer sets from among the standard answer sets, which is a desirable property in many applications. However, there exist programs which while having answer sets, have no preferred answer sets under the existing selective semantics. On the other hand, there are programs which, arguably, have too many preferred answer sets under existing semantics. We propose a new definition of preferred answer sets which is also selective, assigns at most one preferred answer set given a full prioritization of a program, and for negative-cycle-free programs the existence of a preferred answer set is guaranteed as in the case of standard logic programs.
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
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3-4), 365–386 (1991)
Gelfond, M.: Answer sets. In: van Harmelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation, pp. 285–316. Elsevier (2008)
Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence 123(1-2), 185–222 (2000)
Gelfond, M., Son, T.C.: Reasoning with Prioritized Defaults. In: Dix, J., Moniz Pereira, L., Przymusinski, T.C. (eds.) LPKR 1997. LNCS (LNAI), vol. 1471, pp. 164–223. Springer, Heidelberg (1998)
Zhang, Y., Foo, N.Y.: Answer sets for prioritized logic programs. In: Maluszynski, J. (ed.) International Symposium on Logic Programming (ILPS 1997), pp. 69–83 (1997)
Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artificial Intelligence 109(1-2), 297–356 (1999)
Delgrande, J.P., Schaub, T., Tompits, H.: Logic programs with compiled preferences. In: Horn, W. (ed.) 14th European Conference on Artificial Intelligence (ECAI 2000), pp. 464–468 (2000)
Wang, K., Zhou, L.-z., Lin, F.: Alternating Fixpoint Theory for Logic Programs with Priority. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 164–178. Springer, Heidelberg (2000)
Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge University Press (2003)
Schaub, T., Wang, K.: A comparative study of logic programs with preference. In: Nebel, B. (ed.) 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 597–602 (2001)
Sefranek, J., Simko, A.: Warranted derivations of preferred answer sets. In: 25th Workshop on Logic Programming (2011)
Aravindan, C., Dung, P.M.: On the correctness of unfold/fold transformation of normal and extended logic programs. Journal of Logic Programming 24(3), 201–217 (1995)
Dix, J.: A classification theory of semantics of normal logic programs: II. Weak properties. Fundamenta Informaticae 22(3), 257–288 (1995)
Brass, S., Dix, J.: Semantics of (disjunctive) logic programs based on partial evaluation. Journal of Logic Programming 40(1), 1–46 (1999)
Delgrande, J.P., Schaub, T., Tompits, H., Wang, K.: A classification and survey of preference handling approaches in nonmonotonic reasoning. Computational Intelligence 20(2), 308–334 (2004)
Brewka, G.: Adding Priorities and Specificity to Default Logic. In: MacNish, C., Moniz Pereira, L., Pearce, D.J. (eds.) JELIA 1994. LNCS (LNAI), vol. 838, pp. 247–260. Springer, Heidelberg (1994)
Costantini, S.: On the existence of stable models of non-stratified logic programs. Theory and Practice of Logic Programming 6(1-2), 169–212 (2006)
Alferes, J.J., Brogi, A., Leite, J., Moniz Pereira, L.: Evolving Logic Programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 50–62. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabaldon, A. (2012). A Selective Semantics for Logic Programs with Preferences. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds) Logics in Artificial Intelligence. JELIA 2012. Lecture Notes in Computer Science(), vol 7519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33353-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-33353-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33352-1
Online ISBN: 978-3-642-33353-8
eBook Packages: Computer ScienceComputer Science (R0)