Possibilistic semantics for logic programs with Ordered Disjunction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5956 LNCS, Issue , 2010, Pages 133-152

  Confalonieri, Roberto ^a   Nieves, Juan Carlos ^a   Osorio, Mauricio ^b   Vázquez Salceda, Javier ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSIDAD DE LAS AMÉRICAS PUEBLA   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMS; LOGIC PROGRAMS WITH ORDERED DISJUNCTIONS; POSSIBILISTIC; POSSIBILISTIC LOGIC; REALISTIC APPLICATIONS; REASONING PROCESS; TRANSFORMATION RULES;

LOGIC PROGRAMMING; SPECIFICATION LANGUAGES;

SEMANTICS;

EID: 77951119242     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11829-6_11     Document Type: Conference Paper

References (43)

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)
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)
3. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
4. Baral, C., Gelfond, M., Rushton, N.: Probabilistic Reasoning with Answer Sets. Theory and Practice of Logic Programming 9(1), 57-144 (2009)
5. Bertino, E., Mileo, A., Provetti, A.: PDL with P. In: Proc. of the Sixth IEEE International Workshop on Policies for Distributed Systems and Networks, pp. 213-222. IEEE Computer Society, Washington (2005)
6. Brafman, R.I., Domshlak, C.: Preference Handling - An Introductory Tutorial. AI Magazine 30(1), 58-86 (2009)
7. Brass, S., Dix, J.: Characterizations of the Stable Semantics by Partial Evaluation. In: Marek, V.W., Nerode, A., Truszczýnski, M. (eds.) LPNMR 1995. LNCS, vol.928, pp. 85-98. Springer, Heidelberg (1995)
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)
9. Brass, S., Dix, J.: Semantics of (disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming 40(1), 1-46 (1999)
10. Brewka, G., Dix, J., Konolige, K.: Nonmonotonic Reasoning: An Overview. CSLI Lecture Notes, vol.73. CSLI Publications, Stanford (1997)
11. Brewka, G., Niemel̈a, I., Syrj̈anen, T.: Logic Programs with Ordered Disjunction. Computational Intelligence 20(2), 333-357 (2004)
12. Brewka, G., Niemel̈a, I., Truszczýnski, M.: P and Nonmonotonic Reasoning. AI Magazine 29(4), 69-78 (2008)
13. Confalonieri, R., Nieves, J.C., V́azquez-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́azquez-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́azquez-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)
16. Davey, B.A., Priestly, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)
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)
18. Dershowitz, N., Plaisted, D.A.: Rewriting. In: Handbook of Automated Reasoning, pp. 535-610. Elsevier/MIT Press (2001)
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)
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)
21. Dubois, D., Prade, H.: Possibilistic logic: a retrospective and prospective view. Fuzzy Sets and Systems 144(1), 3-23 (2004)
22. Faber, W., Konczak, K.: Strong Equivalence for Logic Programs with P. In: Proc. of the Nineteenth Int. Joint Conference on Artificial Intelligence, pp. 430-435. Professional Book Center (2005)
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)
24. Fitting, S.: Bilattices and the Semantics of Logic Programming. Journal of Logic Programming 11(2), 91-116 (1991)
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)
26. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9(3/4), 365-386 (1991)
27. Kern-Isberner, G., Lukasiewicz, T.: Combining probabilistic logic programming with the power of maximum entropy. Artificial Intelligence 157(1-2), 139-202 (2004)
28. Konczak, K.: Weak Order Equivalence for Logic Programs with P. In: Workshop on Logic Programming, Technische Universiẗat Wien, Austria. volume 1843-06-02 of INFSYS Research Report, pp. 154-163 (2006)
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)
30. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transaction on Computational Logic 2(4), 526-541 (2001)
31. Lloyd, J.W.: Foundations of logic programming. Springer, New York (1987)
32. Mendelson, E.: Introduction to Mathematical Logic. Chapman & Hall, Boca Raton (1997)
33. Newman, M.H.A.: On Theories with a Combinatorial Definition of Equivalence. The Annals of Mathematics 43(2), 223-243 (1942)
34. Nicolas, P., Garcia, L., St́ephan, I., Lef̀evre, C.: Possibilistic Uncertainty Handling for Answer Set Programming. Annals of Mathematics and Artificial Intelligence 47(1-2), 139-181 (2006)
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)
36. Nieves, J.C., Osorio, M., Cort́es, 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)
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)
38. Osorio, M., Nieves, J.C.: PStable Semantics for Possibilistic Logic Programs. In: Gelbukh, A., Kuri Morales, ́A.F. (eds.) MICAI 2007. LNCS (LNAI), vol.4827, pp. 294-304. Springer, Heidelberg (2007)
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)
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)
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)
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)
43. Zepeda, C., Osorio, M., Nieves, J.C., Solnon, C., Sol, D.: Applications of P 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)