Skip to main content
SpringerLink
Log in

Possibilistic Semantics for Logic Programs with Ordered Disjunction

  • Conference paper
Foundations of Information and Knowledge Systems (FoIKS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5956))

Abstract

Logic programs with ordered disjunction (or LPODs) have shown to be a flexible specification language able to model and reason about preferences in a natural way. However, in some realistic applications which use user preferences in the reasoning, information can be pervaded with vagueness and a preference-aware reasoning process that can handle uncertainty is required. In this paper we address these issues, and we propose a framework which combines LPODs and possibilistic logic to be able to deal with a reasoning process that is preference-aware, non-monotonic, and uncertain. We define a possibilistic semantics for capturing logic programs with possibilistic ordered disjunction (or LPPODs) which is a generalization of the original semantics. Moreover, we present several transformation rules which can be used to optimize LPODs and LPPODs code and we show how the semantics of LPODs and the possibilistic semantics of LPPODs are invariant w.r.t. these transformations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alsinet, T., Godo, L.: Towards an Automated Deduction System for First-Order Possibilistic Logic Programming with Fuzzy Constants. International Journal of Intelligent Systems 17(9), 887–924 (2002)

    Article  MATH  Google Scholar 

  2. Balduccini, M., Mellarkod, V.: CR-Prolog with Ordered Disjunction. In: Balduccini, M., Mellarkod, V. (eds.) Advances in Theory and Implementation. CEUR Workshop Proceedings, vol. 78, CEUR-WS.org, pp. 98–112 (2003)

    Google Scholar 

  3. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  4. Baral, C., Gelfond, M., Rushton, N.: Probabilistic Reasoning with Answer Sets. Theory and Practice of Logic Programming 9(1), 57–144 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bertino, E., Mileo, A., Provetti, A.: PDL with Preferences. In: Proc. of the Sixth IEEE International Workshop on Policies for Distributed Systems and Networks, pp. 213–222. IEEE Computer Society, Washington (2005)

    Chapter  Google Scholar 

  6. Brafman, R.I., Domshlak, C.: Preference Handling - An Introductory Tutorial. AI Magazine 30(1), 58–86 (2009)

    Google Scholar 

  7. Brass, S., Dix, J.: Characterizations of the Stable Semantics by Partial Evaluation. In: Marek, V.W., Nerode, A., Truszczyński, M. (eds.) LPNMR 1995. LNCS, vol. 928, pp. 85–98. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  8. Brass, S., Dix, J.: Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA. Journal of Automated Reasoning 20(1-2), 143–165 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Brass, S., Dix, J.: Semantics of (disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming 40(1), 1–46 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Brewka, G., Dix, J., Konolige, K.: Nonmonotonic Reasoning: An Overview. CSLI Lecture Notes, vol. 73. CSLI Publications, Stanford (1997)

    MATH  Google Scholar 

  11. Brewka, G., Niemelä, I., Syrjänen, T.: Logic Programs with Ordered Disjunction. Computational Intelligence 20(2), 333–357 (2004)

    Article  Google Scholar 

  12. Brewka, G., Niemelä, I., Truszczyński, M.: Preferences and Nonmonotonic Reasoning. AI Magazine 29(4), 69–78 (2008)

    Google Scholar 

  13. Confalonieri, R., Nieves, J.C., Vázquez-Salceda, J.: A Preference Meta-Model for Logic Programs with Possibilistic Ordered Disjunction. In: Software Engineering for Answer Set Programming (SEA 2009) (September 2009), To appear in CEUR Workshop Proc. of SEA 2009, Co-located with LPNMR 2009, http://sea09.cs.bath.ac.uk/downloads/sea09proceedings.pdf

  14. Confalonieri, R., Nieves, J.C., Vázquez-Salceda, J.: Logic Programs with Possibilistic Ordered Disjunction. Research Report LSI-09-19-R, UPC - LSI (2009), http://www.lsi.upc.edu/~techreps/files/R09-19.zip

  15. Confalonieri, R., Nieves, J.C., Vázquez-Salceda, J.: Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction. In: Serra, R., Cucchiara, R. (eds.) AI*IA 2009. LNCS (LNAI), vol. 5883, pp. 52–61. Springer, Heidelberg (2009)

    Google Scholar 

  16. Davey, B.A., Priestly, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)

    Book  MATH  Google Scholar 

  17. Delgrande, J., Schaub, T., Tompits, H., Wang, K.: A classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. Computational Intelligence 20(2), 308–334 (2004)

    Article  MathSciNet  Google Scholar 

  18. Dershowitz, N., Plaisted, D.A.: Rewriting. In: Handbook of Automated Reasoning, pp. 535–610. Elsevier/MIT Press (2001)

    Google Scholar 

  19. Dix, J., Osorio, M., Zepeda, C.: A General Theory of Confluent Rewriting Systems for Logic Programming and its Applications. Annals of Pure and Applied Logic 108(1-3), 153–188 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  20. Dubois, D., Lang, J., Prade, H.: Possibilistic Logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 439–513. Oxford University Press, Oxford (1994)

    Google Scholar 

  21. Dubois, D., Prade, H.: Possibilistic logic: a retrospective and prospective view. Fuzzy Sets and Systems 144(1), 3–23 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  22. Faber, W., Konczak, K.: Strong Equivalence for Logic Programs with Preferences. In: Proc. of the Nineteenth Int. Joint Conference on Artificial Intelligence, pp. 430–435. Professional Book Center (2005)

    Google Scholar 

  23. Faber, W., Tompits, H., Woltran, S.: Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. In: Proc. of the 11th International Conference on Principles of Knowledge Representation and Reasoning, pp. 433–443. AAAI Press, Menlo Park (2008)

    Google Scholar 

  24. Fitting, S.: Bilattices and the Semantics of Logic Programming. Journal of Logic Programming 11(2), 91–116 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  25. Foo, N.Y., Meyer, T., Brewka, G.: LPOD Answer Sets and Nash Equilibria. In: Maher, M.J. (ed.) ASIAN 2004. LNCS, vol. 3321, pp. 343–351. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  26. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9(3/4), 365–386 (1991)

    Article  Google Scholar 

  27. Kern-Isberner, G., Lukasiewicz, T.: Combining probabilistic logic programming with the power of maximum entropy. Artificial Intelligence 157(1-2), 139–202 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  28. Konczak, K.: Weak Order Equivalence for Logic Programs with Preferences. In: Workshop on Logic Programming, Technische Universität Wien, Austria. volume 1843-06-02 of INFSYS Research Report, pp. 154–163 (2006)

    Google Scholar 

  29. Leone, N.: Logic Programming and Nonmonotonic Reasoning: From Theory to Systems and Applications. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, p. 1. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  30. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transaction on Computational Logic 2(4), 526–541 (2001)

    Article  MathSciNet  Google Scholar 

  31. Lloyd, J.W.: Foundations of logic programming. Springer, New York (1987)

    Book  MATH  Google Scholar 

  32. Mendelson, E.: Introduction to Mathematical Logic. Chapman & Hall, Boca Raton (1997)

    MATH  Google Scholar 

  33. Newman, M.H.A.: On Theories with a Combinatorial Definition of Equivalence. The Annals of Mathematics 43(2), 223–243 (1942)

    Article  MATH  Google Scholar 

  34. Nicolas, P., Garcia, L., Stéphan, I., Lefèvre, C.: Possibilistic Uncertainty Handling for Answer Set Programming. Annals of Mathematics and Artificial Intelligence 47(1-2), 139–181 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  35. Nieuwenborgh, D., Cock, M., Vermeir, D.: An introduction to fuzzy answer set programming. Annals of Mathematics and Artificial Intelligence 50(3-4), 363–388 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  36. Nieves, J.C., Osorio, M., Cortés, U.: Semantics for Possibilistic Disjunctive Programs. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 315–320. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  37. Osorio, M., Navarro, J.A., Arrazola, J.: Equivalence in Answer Set Programming. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol. 2372, pp. 57–75. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  38. Osorio, M., Nieves, J.C.: PStable Semantics for Possibilistic Logic Programs. In: Gelbukh, A., Kuri Morales, Á.F. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 294–304. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  39. Osorio, M., Nieves, J.C., Giannella, C.: Useful Transformations in Answer Set Programming. In: Provetti, A., Son, T.C. (eds.) AAAI 2001 Spring Symposium Series, Stanford, E.U., pp. 146–152. AAAI Press, Stanford (2001)

    Google Scholar 

  40. Pettorossi, A., Proietti, M.: Transformation of Logic Programs. In: Gabbay, D.M., Robinson, J.A., Hogger, C.J. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 697–787. Oxford University Press, Oxford (1998)

    Google Scholar 

  41. Reiter, R.: Readings in Nonmonotonic Reasoning. In: Reiter, R. (ed.) Logic for Default Reasoning, ch. A, pp. 68–93. Morgan Kaufmann Publishers Inc., San Francisco (1987)

    Google Scholar 

  42. Shoham, Y.: A Semantical Approach to Nonmonotonic Logics. In: Ginsberg, M.L. (ed.) Readings in Nonmonotonic Reasoning, pp. 227–250. Morgan Kaufmann Publishers Inc., San Francisco (1987)

    Google Scholar 

  43. Zepeda, C., Osorio, M., Nieves, J.C., Solnon, C., Sol, D.: Applications of Preferences using Answer Set Programming. In: Zepeda, C., Osorio, M., Nieves, J.C., Solnon, C., Sol, D. (eds.) Proc. of the 3rd Intl. Workshop in Advances in Theory and Implementation. CEUR Workshop Proceedings, CEUR-WS.org, vol. 142 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, C/ Jordi Girona Salgado 1-3, E - 08034, Barcelona, Spain

    Roberto Confalonieri, Juan Carlos Nieves & Javier Vázquez-Salceda

  2. CENTIA, Universidad de las Américas, Sta. Catarina Mártir, Cholula, México, 72820, Puebla

    Mauricio Osorio

Authors
  1. Roberto Confalonieri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juan Carlos Nieves
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mauricio Osorio
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Javier Vázquez-Salceda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Management, The Victoria University of Wellington, Wellington, New Zealand

    Sebastian Link

  2. IRIT, University of Toulouse III, 118 route de Narbonne, 31062, Toulouse, Cedex 9, France

    Henri Prade

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Confalonieri, R., Nieves, J.C., Osorio, M., Vázquez-Salceda, J. (2010). Possibilistic Semantics for Logic Programs with Ordered Disjunction. In: Link, S., Prade, H. (eds) Foundations of Information and Knowledge Systems. FoIKS 2010. Lecture Notes in Computer Science, vol 5956. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11829-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11829-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11828-9

  • Online ISBN: 978-3-642-11829-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation