Abstract
In this paper, we show how the formalism of Logic Programs with Ordered Disjunction (LPODs) and Possibilistic Answer Set Programming (PASP) can be merged into the single framework of Logic Programs with Possibilistic Ordered Disjunction (LPPODs). The LPPODs framework embeds in a unified way several aspects of common-sense reasoning, nonmonotonocity, preferences, and uncertainty, where each part is underpinned by a well established formalism. On one hand, from LPODs it inherits the distinctive feature of expressing context-dependent qualitative preferences among different alternatives (modeled as the atoms of a logic program). On the other hand, PASP allows for qualitative certainty statements about the rules themselves (modeled as necessity values according to possibilistic logic) to be captured. In this way, the LPPODs framework supports a reasoning which is nonmonotonic, preference- and uncertainty-aware. The LPPODs syntax allows for the specification of (1) preferences among the exceptions to default rules, and (2) necessity values about the certainty of program rules. As a result, preferences and uncertainty can be used to select the preferred uncertain default rules of an LPPOD and, consequently, to order its possibilistic answer sets. Furthermore, we describe the implementation of an ASP-based solver able to compute the LPPODs semantics.
Similar content being viewed by others
References
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
Baral, C., Gelfond, M.: Logic programming and knowledge representation. J. Log. Program. 19/20, 73–148 (1994)
Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theory Pract. Log. Program. 9(1), 57–144 (2009)
Bauters, K., Schockaert, S., Cock, M.D., Vermeir, D.: Possibilistic answer set programming revisited. In: Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, (UAI’10). AUAI Press (2010)
Bauters, K., Schockaert, S., Cock, M.D., Vermeir, D.: Weak and strong disjunction in possibilistic ASP. In: Benferhat, S., Grant, J. (eds.) Proceedings of the 11th International Conference on Scalable Uncertainty Management (SUM 2011). Lecture Notes in Computer Science, vol. 6929, pp. 475–488. Springer, New York (2011)
Benferhat, S., Dubois, D., Prade, H.: Towards a possibilistic logic handling of preferences. Appl. Intell. 14(3), 303–317 (2001)
Bosc, P., Pivert, O., Prade, H.: A model based on possibilistic certainty levels for incomplete databases. In: Godo, L., Pugliese, A. (eds.) Proceedings of the 3rd International Conference on Scalable Uncertainty Management (SUM’09). Lecture Notes in Computer Science, vol. 5785, pp. 80–94. Springer, Berlin (2009)
Bosc, P., Pivert, O., Prade, H.: A possibilistic logic view of preference queries to an uncertain database. In: Proceedings of 19th IEEE International Conference on Fuzzy Systems (FUZZ-IEEE’10), pp. 581–595 (2010)
Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. 21(1), 135–191 (2004)
Brass, S., Dix, J.: Characterizations of the stable semantics by partial evaluation. In: Marek, V., Nerode, A., Truszczyński, M. (eds.) Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning, (LPNMR’95). Lecture Notes in Computer Science, vol. 928, pp. 85–98. Springer, London (1995)
Brass, S., Dix, J.: Semantics of (disjunctive) logic programs based on partial evaluation. J. Log. Program. 40(1), 1–46 (1999)
Brass, S., Dix, J., Freitag, B., Zukowski, U.: Transformation-based bottom-up computation of the well-founded model. Theory Pract. Log. Program. 1(5), 497–538 (2001)
Brewka, G., Dix, J., Konolige, K.: Nonmonotonic reasoning: an overview. In: CSLI Lecture Notes 73. CSLI Publications, Stanford (1997)
Brewka, G., Niemelä, I., Truszczyński, M.: Answer set optimization. In: Gottlob, G., Walsh, T. (eds.) Proceedings of 18th International Joint Conference on Artificial Intelligence, (IJCAI’03), pp 867–872. Morgan Kaufmann, San Mateo (2003)
Brewka, G., Niemelä, I., Syrjänen, T.: Logic programs with ordered disjunction. Comput. Intell. 20(2), 333–357 (2004)
Brewka, G., Niemelä, I., Truszczyński, M.: Preferences and nonmonotonic reasoning. AI Mag. 29(4), 69–78 (2008)
Confalonieri, R.: The role of preferences in logic programming: nonmonotonic reasoning, user preferences, decision under uncertainty. PhD thesis, Universitat Politècnica de Catalunya, Barcelona, Spain (2011)
Confalonieri, R., Nieves, J.C.: Nested preferences in answer set programming. Fundam. Inform. 113(1), 19–39 (2011). doi:10.3233/FI-2011-597
Confalonieri, R., Prade, H.: Answer set programming for computing decisions under uncertainty. In: Liu, W. (ed.) Proceedings of the 11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2011). Lecture Notes in Artificial Intelligence, vol. 6717, pp. 485–496. Springer, Berlin (2011)
Confalonieri, R., Nieves, J., Vázquez-Salceda, J.: Pstable semantics for logic programs with possibilistic ordered disjunction. In: Serra, R., Cucchiara, R. (eds.) Proceedings of the 11th International Conference of the Italian Association for Artificial Intelligence on Emergent Perspectives in Artificial Intelligence (AI*IA ’09). Lecture Notes in Artificial Intelligence, vol. 5883, pp. 52–61. Springer, Berlin (2009)
Confalonieri, R., Nieves, J.C., Osorio, M., Vázquez-Salceda, J.: Possibilistic semantics for logic programs with ordered disjunction. In: Link, S., Prade, H. (eds.) Proceedings of 6th International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2010). Lecture Notes in Computer Science, vol. 5956, pp. 133–152. Springer, Berlin (2010)
Confalonieri, R., Prade, H., Nieves, J.C.: Handling exceptions in logic programming without negation as failure. In: Liu, W. (ed.) Proceedings of the 11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2011). Lecture Notes in Artificial Intelligence, vol. 6717, pp. 509–520. Springer, Berlin (2011)
Confalonieri, R., Iñan, H., Palau, M.: Handling uncertain user preferences in a context-aware system. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds.) Advances in Computational Intelligence: Proceedings of 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems (IPMU 2012), Part II, Communications in Computer and Information Science, vol. 298, pp. 88–97. Springer, Berlin (2012)
Costantini, S., Formisano, A.: Modeling preferences and conditional preferences on resource consumption and production in ASP. J. Algorithms 64(1), 3–15 (2009)
Costantini, S., Formisano, A.: Weight constraints with preferences in ASP. In: Delgrande, J., Faber, W. (eds.) Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR11). Lecture Notes in Artificial Intelligence, vol. 6645, pp. 229–235. Springer, Berlin (2011)
van Dalen, D.: Logic and Structure, 3rd edn. Springer, Berlin (1994)
Delgrande, J., Schaub, T., Tompits, H., Wang, K.: A classification and survey of preference handling approaches in nonmonotonic reasoning. Comput. Intell. 20(2), 308–334 (2004)
Dershowitz, N., Plaisted, D.A.: Rewriting. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 535–610. Elsevier and MIT Press (2001)
Dix, J., Osorio, M., Zepeda, C.: A general theory of confluent rewriting systems for logic programming and its applications. Ann. Pure Appl. Logic 108(1–3), 153–188 (2001)
Domshlak, C., Hüllermeier, E., Kaci, S., Prade, H.: Preferences in AI: an overview. Artif. Intell. 175(7–8), 1037–1052 (2011)
Dubois, D., Prade, H.: Possibility theory as a basis for qualitative decision theory. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, (IJCAI’95), pp. 1924–1930. Morgan Kaufmann, San Francisco (1995)
Dubois, D., Lang, J., Prade, H.: Towards possibilistic logic programming. In: Furukawa, K. (ed.) Proceedings of International Conference on Logic Programming, (ICLP’91), pp. 581–595. MIT Press, Cambridge (1991)
Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A., Siekmann, J.H. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3: Nonmonotonic Reasoning and Uncertain Reasoning, pp. 439–513. Oxford University Press, New York (1994)
Garcia, L., Ngoma, S., Nicolas, P.: Dealing automatically with exceptions by introducing specificity in ASP. In: Sossai, C., Chemello, G. (eds.) Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, (ECSQARU’99). Lecture Notes in Artificial Intelligence, vol. 5590, pp. 614–625. Springer, Berlin (2009)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the Fifth International Conference on Logic Programming, (ICLP’88), pp. 1070–1080. MIT Press, Cambridge (1988)
Kaci, S.: Working with Preferences: Less Is More. Springer, New York (2011)
Kärger, P., Lopes, N., Olmedilla, D., Polleres, A.: Towards logic programs with ordered and unordered disjunction. In: Proceedings of Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP2008), 24th International Conference on Logic Programming (ICLP 2008), pp. 46–60 (2008)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2(4), 526–541 (2001)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, New York (1987)
Lukasiewicz, T.: Weak nonmonotonic probabilistic logics. Artif. Intell. 168(1–2), 119–161 (2005)
Newman, M.H.A.: On theories with a combinatorial definition of equivalence. Ann. Math. 43(2), 223–243 (1942)
Nicolas, P., Garcia, L., Stéphan, I., Lefèvre, C.: Possibilistic uncertainty handling for answer set programming. Ann. Math. Artif. Intell. 47(1–2), 139–181 (2006)
Nieves, J.C., Osorio, M., Cortés, U.: Semantics for possibilistic disjunctive programs. Theory Pract. Log. Program. (2011). doi:10.1017/S1471068411000408
Osorio, M., Nieves, J.C.: Pstable semantics for possibilistic logic programs. In: Gelbukh, A., Morales, A.F.K. (eds.) Proceedings of the Artificial Intelligence 6th Mexican International Conference on Advances in Artificial Intelligence, MICAI’07, pp. 294–304. Springer, Berlin (2007)
Osorio, M., Navarro, J.A., Arrazola, J.: Equivalence in answer set programming. In: Pettorossi, A. (ed.) Selected Papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation, (LOPSTR 2001). Lecture Notes in Computer Science, vol. 2372, pp. 57–75. Springer, London (2001)
Saad, E., Pontelli, E.: Hybrid probabilistic logic programs with non-monotonic negation. In: Gabbrielli, M., Gupta, G. (eds.) Proceedings of 21st International Conference on Logic Programming, (ICLP’05). Lecture Notes in Computer Science, vol. 3668, pp. 204–220. Springer, Berlin (2005)
Dupin de, Saint-Cyr, F., Prade, H.: Handling uncertainty and defeasibility in a possibilistic logic setting. Int. J. Approx. Reason. 49(1), 67–82 (2008)
Schaub, T., Wang, K.: A comparative study of logic programs with preference. In: Nebel, B. (ed.) Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI’01), vol. 1, pp. 597–602. Morgan Kaufmann, San Francisco (2001)
Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285–309 (1955)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Confalonieri, R., Nieves, J.C., Osorio, M. et al. Dealing with explicit preferences and uncertainty in answer set programming. Ann Math Artif Intell 65, 159–198 (2012). https://doi.org/10.1007/s10472-012-9311-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-012-9311-0