{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:38:47Z","timestamp":1760708327934},"reference-count":47,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2011,7,28]],"date-time":"2011-07-28T00:00:00Z","timestamp":1311811200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2013,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete, and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses, which are able to capture incomplete information and states of a knowledge base at the same time. By considering a possibilistic logic program as a possibilistic logic theory, a construction of a possibilistic logic programming semantic based on answer sets and the proof theory of possibilistic logic is defined. It shows that this possibilistic semantics for disjunctive logic programs can be characterized by a fixed-point operator. It is also shown that the suggested possibilistic semantics can be computed by a resolution algorithm and the consideration of optimal refutations from a possibilistic logic theory. In order to manage inconsistent possibilistic logic programs, a preference criterion between inconsistent possibilistic models is defined. In addition, the approach of cuts for restoring consistency of an inconsistent possibilistic knowledge base is adopted. The approach is illustrated in a medical scenario.<\/jats:p>","DOI":"10.1017\/s1471068411000408","type":"journal-article","created":{"date-parts":[[2011,7,28]],"date-time":"2011-07-28T09:24:05Z","timestamp":1311845045000},"page":"33-70","source":"Crossref","is-referenced-by-count":10,"title":["Semantics for Possibilistic Disjunctive Programs"],"prefix":"10.1017","volume":"13","author":[{"given":"JUAN CARLOS","family":"NIEVES","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MAURICIO","family":"OSORIO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ULISES","family":"CORT\u00c9S","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2011,7,28]]},"reference":[{"key":"S1471068411000408_ref43","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.285"},{"key":"S1471068411000408_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2007.12.013"},{"key":"S1471068411000408_ref34","first-page":"225","article-title":"Quantitative disjunctive logic programming: Semantics and computation","volume":"13","author":"Mateis","year":"2000","journal-title":"AI Communications"},{"key":"S1471068411000408_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068408003645"},{"key":"S1471068411000408_ref3","doi-asserted-by":"publisher","DOI":"10.1002\/int.10069"},{"key":"S1471068411000408_ref17","first-page":"581","volume-title":"International Conference on Logic Programming (ICLP)","author":"Dubois","year":"1991"},{"key":"S1471068411000408_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(96)00115-X"},{"key":"S1471068411000408_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068411000408_ref9","first-page":"167","article-title":"Semantics of (disjunctive) logic programs based on partial evaluation","volume":"38","author":"Brass","year":"1999","journal-title":"Journal of Logic Programming"},{"key":"S1471068411000408_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(91)90014-G"},{"key":"S1471068411000408_ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(98)10015-8"},{"key":"S1471068411000408_ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005952908693"},{"key":"S1471068411000408_ref33","first-page":"336","volume-title":"6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)","author":"Lukasiewicz","year":"2001"},{"key":"S1471068411000408_ref16","unstructured":"DLV S. 1996. Vienna University of Technology. Accessed 10 October 2008. URL: http:\/\/www.dbai.tuwien.ac.at\/proj\/dlv\/."},{"key":"S1471068411000408_ref18","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, Vol. 3: Nonmonotonic Reasoning and Uncertain Reasoning","author":"Dubois","year":"1994"},{"key":"S1471068411000408_ref39","first-page":"11","volume-title":"Proceedings of 10th International Conference of the CCIA","author":"Nieves","year":"2007"},{"key":"S1471068411000408_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511584312.007"},{"key":"S1471068411000408_ref11","first-page":"133","volume-title":"FoIKS","author":"Confalonieri","year":"2010"},{"key":"S1471068411000408_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088"},{"key":"S1471068411000408_ref2","first-page":"1","volume-title":"Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence","author":"Alsinet","year":"2000"},{"key":"S1471068411000408_ref13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-1995-2233","article-title":"A classification theory of semantics of normal logic programs: I. Strong properties","volume":"22","author":"Dix","year":"1995","journal-title":"Fundamenta Informaticae"},{"key":"S1471068411000408_ref14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-1995-2234","article-title":"A classification theory of semantics of normal logic programs: II. Weak properties","volume":"22","author":"Dix","year":"1995","journal-title":"Fundamenta Informaticae"},{"key":"S1471068411000408_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90061-J"},{"key":"S1471068411000408_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(00)00044-0"},{"key":"S1471068411000408_ref21","volume-title":"Safe and Sound: Artificial Intelligence in Hazardous Applications","author":"Fox","year":"2000"},{"key":"S1471068411000408_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-4938-5_18"},{"key":"S1471068411000408_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(07)03007-6"},{"key":"S1471068411000408_ref24","first-page":"1070","volume-title":"5th Conference on Logic Programming","author":"Gelfond","year":"1988"},{"key":"S1471068411000408_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068411000408_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037535"},{"key":"S1471068411000408_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.003"},{"key":"S1471068411000408_ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90007-P"},{"key":"S1471068411000408_ref29","unstructured":"Lakshmanan L. V. S. 1994. An epistemic foundation for logic programming with uncertainty. In Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 89\u2013100."},{"key":"S1471068411000408_ref30","doi-asserted-by":"publisher","DOI":"10.1034\/j.1399-0012.2003.00119.x"},{"key":"S1471068411000408_ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-007-9080-3"},{"key":"S1471068411000408_ref31","first-page":"1607","volume-title":"Proceedings of XVI International Congress of the Transplantation Society","author":"L\u00f3pez-Navidad","year":"1997"},{"key":"S1471068411000408_ref32","first-page":"388","volume-title":"13th European Conference on Artificial Intelligence, (ECAI)","author":"Lukasiewicz","year":"1998"},{"key":"S1471068411000408_ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-006-9029-y"},{"key":"S1471068411000408_ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72200-7_32"},{"key":"S1471068411000408_ref38","first-page":"271","volume-title":"Answer Set Programming: Advances in Theory and Implementation","author":"Nieves","year":"2007"},{"key":"S1471068411000408_ref44","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809477.002"},{"key":"S1471068411000408_ref40","first-page":"225","article-title":"Applications of intuitionistic logic in answer set programming","volume":"4","author":"Osorio","year":"2004","journal-title":"Theory and Practice of Logic Programming (TPLP)"},{"key":"S1471068411000408_ref42","first-page":"272","volume-title":"9th International Symposium, FLOPS","author":"Rodr\u00edguez-Artalejo","year":"2008"},{"key":"S1471068411000408_ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02962-6"},{"key":"S1471068411000408_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2003.10.011"},{"key":"S1471068411000408_ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(86)90003-8"},{"key":"S1471068411000408_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0165-0114(87)90110-2"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068411000408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T09:52:42Z","timestamp":1712656362000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068411000408\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,28]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["S1471068411000408"],"URL":"https:\/\/doi.org\/10.1017\/s1471068411000408","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,28]]}}}