{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:56:16Z","timestamp":1743026176498,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118289"},{"type":"electronic","value":"9783642118296"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11829-6_11","type":"book-chapter","created":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T11:55:32Z","timestamp":1265025332000},"page":"133-152","source":"Crossref","is-referenced-by-count":7,"title":["Possibilistic Semantics for Logic Programs with Ordered Disjunction"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Confalonieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Carlos","family":"Nieves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio","family":"Osorio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"V\u00e1zquez-Salceda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"11_CR1","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1002\/int.10069","volume":"17","author":"T. Alsinet","year":"2002","unstructured":"Alsinet, T., Godo, L.: Towards an Automated Deduction System for First-Order Possibilistic Logic Programming with Fuzzy Constants. International Journal of Intelligent Systems\u00a017(9), 887\u2013924 (2002)","journal-title":"International Journal of Intelligent Systems"},{"key":"11_CR2","unstructured":"Balduccini, M., Mellarkod, V.: CR-Prolog with Ordered Disjunction. In: Balduccini, M., Mellarkod, V. (eds.) Advances in Theory and Implementation. CEUR Workshop Proceedings, vol.\u00a078, CEUR-WS.org, pp. 98\u2013112 (2003)"},{"key":"11_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C. Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1017\/S1471068408003645","volume":"9","author":"C. Baral","year":"2009","unstructured":"Baral, C., Gelfond, M., Rushton, N.: Probabilistic Reasoning with Answer Sets. Theory and Practice of Logic Programming\u00a09(1), 57\u2013144 (2009)","journal-title":"Theory and Practice of Logic Programming"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/POLICY.2005.21","volume-title":"Proc. of the Sixth IEEE International Workshop on Policies for Distributed Systems and Networks","author":"E. Bertino","year":"2005","unstructured":"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\u2013222. IEEE Computer Society, Washington (2005)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1609\/aimag.v30i1.2114","volume":"30","author":"R.I. Brafman","year":"2009","unstructured":"Brafman, R.I., Domshlak, C.: Preference Handling - An Introductory Tutorial. AI Magazine\u00a030(1), 58\u201386 (2009)","journal-title":"AI Magazine"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-59487-6_7","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"S. Brass","year":"1995","unstructured":"Brass, S., Dix, J.: Characterizations of the Stable Semantics by Partial Evaluation. In: Marek, V.W., Nerode, A., Truszczy\u0144ski, M. (eds.) LPNMR 1995. LNCS, vol.\u00a0928, pp. 85\u201398. Springer, Heidelberg (1995)"},{"issue":"1-2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1005952908693","volume":"20","author":"S. Brass","year":"1998","unstructured":"Brass, S., Dix, J.: Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA. Journal of Automated Reasoning\u00a020(1-2), 143\u2013165 (1998)","journal-title":"Journal of Automated Reasoning"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10030-4","volume":"40","author":"S. Brass","year":"1999","unstructured":"Brass, S., Dix, J.: Semantics of (disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming\u00a040(1), 1\u201346 (1999)","journal-title":"Journal of Logic Programming"},{"key":"11_CR10","series-title":"CSLI Lecture Notes","volume-title":"Nonmonotonic Reasoning: An Overview","author":"G. Brewka","year":"1997","unstructured":"Brewka, G., Dix, J., Konolige, K.: Nonmonotonic Reasoning: An Overview. CSLI Lecture Notes, vol.\u00a073. CSLI Publications, Stanford (1997)"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1111\/j.0824-7935.2004.00241.x","volume":"20","author":"G. Brewka","year":"2004","unstructured":"Brewka, G., Niemel\u00e4, I., Syrj\u00e4nen, T.: Logic Programs with Ordered Disjunction. Computational Intelligence\u00a020(2), 333\u2013357 (2004)","journal-title":"Computational Intelligence"},{"issue":"4","key":"11_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1609\/aimag.v29i4.2179","volume":"29","author":"G. Brewka","year":"2008","unstructured":"Brewka, G., Niemel\u00e4, I., Truszczy\u0144ski, M.: Preferences and Nonmonotonic Reasoning. AI Magazine\u00a029(4), 69\u201378 (2008)","journal-title":"AI Magazine"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Confalonieri, R., Nieves, J.C., V\u00e1zquez-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","DOI":"10.1007\/978-3-642-10291-2_6"},{"key":"11_CR14","unstructured":"Confalonieri, R., Nieves, J.C., V\u00e1zquez-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"},{"key":"11_CR15","series-title":"LNAI","first-page":"52","volume-title":"AI*IA 2009","author":"R. Confalonieri","year":"2009","unstructured":"Confalonieri, R., Nieves, J.C., V\u00e1zquez-Salceda, J.: Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction. In: Serra, R., Cucchiara, R. (eds.) AI*IA 2009. LNCS (LNAI), vol.\u00a05883, pp. 52\u201361. Springer, Heidelberg (2009)"},{"key":"11_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"2002","unstructured":"Davey, B.A., Priestly, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1111\/j.0824-7935.2004.00240.x","volume":"20","author":"J. Delgrande","year":"2004","unstructured":"Delgrande, J., Schaub, T., Tompits, H., Wang, K.: A classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. Computational Intelligence\u00a020(2), 308\u2013334 (2004)","journal-title":"Computational Intelligence"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Plaisted, D.A.: Rewriting. In: Handbook of Automated Reasoning, pp. 535\u2013610. Elsevier\/MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50011-4"},{"issue":"1-3","key":"11_CR19","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0168-0072(00)00044-0","volume":"108","author":"J. Dix","year":"2001","unstructured":"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\u00a0108(1-3), 153\u2013188 (2001)","journal-title":"Annals of Pure and Applied Logic"},{"key":"11_CR20","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1093\/oso\/9780198537472.003.0009","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"D. Dubois","year":"1994","unstructured":"Dubois, D., Lang, J., Prade, H.: Possibilistic Logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol.\u00a03, pp. 439\u2013513. Oxford University Press, Oxford (1994)"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.fss.2003.10.011","volume":"144","author":"D. Dubois","year":"2004","unstructured":"Dubois, D., Prade, H.: Possibilistic logic: a retrospective and prospective view. Fuzzy Sets and Systems\u00a0144(1), 3\u201323 (2004)","journal-title":"Fuzzy Sets and Systems"},{"key":"11_CR22","unstructured":"Faber, W., Konczak, K.: Strong Equivalence for Logic Programs with Preferences. In: Proc. of the Nineteenth Int. Joint Conference on Artificial Intelligence, pp. 430\u2013435. Professional Book Center (2005)"},{"key":"11_CR23","first-page":"433","volume-title":"Proc. of the 11th International Conference on Principles of Knowledge Representation and Reasoning","author":"W. Faber","year":"2008","unstructured":"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\u2013443. AAAI Press, Menlo Park (2008)"},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)90014-G","volume":"11","author":"S. Fitting","year":"1991","unstructured":"Fitting, S.: Bilattices and the Semantics of Logic Programming. Journal of Logic Programming\u00a011(2), 91\u2013116 (1991)","journal-title":"Journal of Logic Programming"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-30502-6_25","volume-title":"Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making","author":"N.Y. Foo","year":"2004","unstructured":"Foo, N.Y., Meyer, T., Brewka, G.: LPOD Answer Sets and Nash Equilibria. In: Maher, M.J. (ed.) ASIAN 2004. LNCS, vol.\u00a03321, pp. 343\u2013351. Springer, Heidelberg (2004)"},{"issue":"3\/4","key":"11_CR26","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing\u00a09(3\/4), 365\u2013386 (1991)","journal-title":"New Generation Computing"},{"issue":"1-2","key":"11_CR27","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.artint.2004.04.003","volume":"157","author":"G. Kern-Isberner","year":"2004","unstructured":"Kern-Isberner, G., Lukasiewicz, T.: Combining probabilistic logic programming with the power of maximum entropy. Artificial Intelligence\u00a0157(1-2), 139\u2013202 (2004)","journal-title":"Artificial Intelligence"},{"key":"11_CR28","unstructured":"Konczak, K.: Weak Order Equivalence for Logic Programs with Preferences. In: Workshop on Logic Programming, Technische Universit\u00e4t Wien, Austria. volume 1843-06-02 of INFSYS Research Report, pp. 154\u2013163 (2006)"},{"key":"11_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72200-7_1","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"N. Leone","year":"2007","unstructured":"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.\u00a04483, p. 1. Springer, Heidelberg (2007)"},{"issue":"4","key":"11_CR30","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transaction on Computational Logic\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM Transaction on Computational Logic"},{"key":"11_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of logic programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of logic programming. Springer, New York (1987)"},{"key":"11_CR32","volume-title":"Introduction to Mathematical Logic","author":"E. Mendelson","year":"1997","unstructured":"Mendelson, E.: Introduction to Mathematical Logic. Chapman & Hall, Boca Raton (1997)"},{"issue":"2","key":"11_CR33","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"Newman, M.H.A.: On Theories with a Combinatorial Definition of Equivalence. The Annals of Mathematics\u00a043(2), 223\u2013243 (1942)","journal-title":"The Annals of Mathematics"},{"issue":"1-2","key":"11_CR34","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10472-006-9029-y","volume":"47","author":"P. Nicolas","year":"2006","unstructured":"Nicolas, P., Garcia, L., St\u00e9phan, I., Lef\u00e8vre, C.: Possibilistic Uncertainty Handling for Answer Set Programming. Annals of Mathematics and Artificial Intelligence\u00a047(1-2), 139\u2013181 (2006)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3-4","key":"11_CR35","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10472-007-9080-3","volume":"50","author":"D. Nieuwenborgh","year":"2007","unstructured":"Nieuwenborgh, D., Cock, M., Vermeir, D.: An introduction to fuzzy answer set programming. Annals of Mathematics and Artificial Intelligence\u00a050(3-4), 363\u2013388 (2007)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"11_CR36","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-72200-7_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J.C. Nieves","year":"2007","unstructured":"Nieves, J.C., Osorio, M., Cort\u00e9s, U.: Semantics for Possibilistic Disjunctive Programs. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 315\u2013320. Springer, Heidelberg (2007)"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45607-4_4","volume-title":"Logic Based Program Synthesis and Transformation","author":"M. Osorio","year":"2002","unstructured":"Osorio, M., Navarro, J.A., Arrazola, J.: Equivalence in Answer Set Programming. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol.\u00a02372, pp. 57\u201375. Springer, Heidelberg (2002)"},{"key":"11_CR38","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-76631-5_28","volume-title":"MICAI 2007: Advances in Artificial Intelligence","author":"M. Osorio","year":"2007","unstructured":"Osorio, M., Nieves, J.C.: PStable Semantics for Possibilistic Logic Programs. In: Gelbukh, A., Kuri Morales, \u00c1.F. (eds.) MICAI 2007. LNCS (LNAI), vol.\u00a04827, pp. 294\u2013304. Springer, Heidelberg (2007)"},{"key":"11_CR39","first-page":"146","volume-title":"AAAI 2001 Spring Symposium Series","author":"M. Osorio","year":"2001","unstructured":"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\u2013152. AAAI Press, Stanford (2001)"},{"key":"11_CR40","first-page":"697","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"A. Pettorossi","year":"1998","unstructured":"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.\u00a05, pp. 697\u2013787. Oxford University Press, Oxford (1998)"},{"key":"11_CR41","first-page":"68","volume-title":"Logic for Default Reasoning","author":"R. Reiter","year":"1987","unstructured":"Reiter, R.: Readings in Nonmonotonic Reasoning. In: Reiter, R. (ed.) Logic for Default Reasoning, ch.\u00a0A, pp. 68\u201393. Morgan Kaufmann Publishers Inc., San Francisco (1987)"},{"key":"11_CR42","first-page":"227","volume-title":"Readings in Nonmonotonic Reasoning","author":"Y. Shoham","year":"1987","unstructured":"Shoham, Y.: A Semantical Approach to Nonmonotonic Logics. In: Ginsberg, M.L. (ed.) Readings in Nonmonotonic Reasoning, pp. 227\u2013250. Morgan Kaufmann Publishers Inc., San Francisco (1987)"},{"key":"11_CR43","unstructured":"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.\u00a0142 (2005)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11829-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T08:37:12Z","timestamp":1711183032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11829-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118289","9783642118296"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11829-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}