{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:53:01Z","timestamp":1747806781909},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642239625"},{"type":"electronic","value":"9783642239632"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23963-2_37","type":"book-chapter","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T01:29:02Z","timestamp":1317864542000},"page":"475-488","source":"Crossref","is-referenced-by-count":3,"title":["Weak and Strong Disjunction in Possibilistic ASP"],"prefix":"10.1007","author":[{"given":"Kim","family":"Bauters","sequence":"first","affiliation":[]},{"given":"Steven","family":"Schockaert","sequence":"additional","affiliation":[]},{"given":"Martine","family":"De Cock","sequence":"additional","affiliation":[]},{"given":"Dirk","family":"Vermeir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","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":"37_CR2","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":"37_CR3","unstructured":"Bauters, K., Schockaert, S., De Cock, M., Vermeir, D.: Possibilistic answer set programming revisited. In: Proc. of UAI 2010 (2010)"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Confalonieri, R., Nieves, J.C., V\u00e1zquez-Salceda, J.: Pstable semantics for logic programs with possibilistic ordered disjunction. In: Proc. of AI*IA 2009, pp. 52\u201361 (2009)","DOI":"10.1007\/978-3-642-10291-2_6"},{"key":"37_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1007\/3-540-44652-4_66","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"C.V. Dam\u00e1sio","year":"2001","unstructured":"Dam\u00e1sio, C.V., Pereira, L.M.: Monotonic and residuated logic programs. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol.\u00a02143, pp. 748\u2013759. Springer, Heidelberg (2001)"},{"key":"37_CR6","unstructured":"Dubois, D., Lang, J., Prade, H.: Towards possibilistic logic programming. In: Proc. of ICLP 1991, pp. 581\u2013595 (1991)"},{"issue":"1","key":"37_CR7","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1093\/oso\/9780198537472.003.0009","volume":"3","author":"D. Dubois","year":"1994","unstructured":"Dubois, D., Lang, J., Prade, H.: Possibilistic logic. Handbook of Logic for Artificial Intelligence and Logic Programming\u00a03(1), 439\u2013513 (1994)","journal-title":"Handbook of Logic for Artificial Intelligence and Logic Programming"},{"key":"37_CR8","unstructured":"Dubois, D., Prade, H.: Can we enforce full compositionality in uncertainty calculi? In: Proc. of AAAI 1994, pp. 149\u2013154 (1994)"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Dubois, D., Prade, H., Schockaert, S.: Rules and meta-rules in the framework of possibility theory and possibilistic logic. Scientia Iranica (to appear, 2011)","DOI":"10.1016\/j.scient.2011.04.008"},{"key":"37_CR10","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, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"37_CR11","unstructured":"Gelfond, M., Lifzchitz, V.: The stable model semantics for logic programming. In: Proc. of ICLP 1988, pp. 1081\u20131086 (1988)"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Lifschitz, V., Schwarz, G.: Extended logic programs as autoepistemic theories. In: Proc. of LPNMR 1993, pp. 101\u2013114 (1993)","DOI":"10.7551\/mitpress\/4307.003.0011"},{"issue":"1\u20132","key":"37_CR13","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\u20132), 139\u2013181 (2006)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"37_CR14","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)"},{"issue":"6","key":"37_CR15","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1093\/logcom\/exl013","volume":"16","author":"M. Osorio","year":"2006","unstructured":"Osorio, M., P\u00e9rez, J.A.N., Ram\u00edrez, J.R.A., Mac\u00edas, V.B.: Logics with common weak completions. Journal of Logic and Computation\u00a016(6), 867\u2013890 (2006)","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"37_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics\u00a05(2), 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems, 3\u201328 (1978)","DOI":"10.1016\/0165-0114(78)90029-5"}],"container-title":["Lecture Notes in Computer Science","Scalable Uncertainty Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23963-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T09:33:22Z","timestamp":1713000802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23963-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239625","9783642239632"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23963-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}