{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:51:29Z","timestamp":1772373089323,"version":"3.50.1"},"reference-count":61,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper develops a declarative language, P-log, that combines logical and probabilistic arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while causal Bayes nets serve as a probabilistic foundation. We give several non-trivial examples and illustrate the use of P-log for knowledge representation and updating of knowledge. We argue that our approach to updates is more appealing than existing approaches. We give sufficiency conditions for the coherency of P-log programs and show that Bayes nets can be easily mapped to coherent P-log programs.<\/jats:p>","DOI":"10.1017\/s1471068408003645","type":"journal-article","created":{"date-parts":[[2009,1,30]],"date-time":"2009-01-30T13:02:29Z","timestamp":1233320549000},"page":"57-144","source":"Crossref","is-referenced-by-count":122,"title":["Probabilistic reasoning with answer sets"],"prefix":"10.1017","volume":"9","author":[{"given":"CHITTA","family":"BARAL","sequence":"first","affiliation":[]},{"given":"MICHAEL","family":"GELFOND","sequence":"additional","affiliation":[]},{"given":"NELSON","family":"RUSHTON","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2009,1,1]]},"reference":[{"key":"S1471068408003645_ref61","doi-asserted-by":"crossref","unstructured":"Wellman M. , Breese J. and Goldman R. 1992. From knowledge bases to decision models. Knowledge Engineering Review. 35\u201353.","DOI":"10.1017\/S0269888900006147"},{"key":"S1471068408003645_ref58","unstructured":"Vennekens J. 2007. Algebraic and Logical Study of Constructive Processes in Knowledge representation Ph.D Dissertation. K.U. Leuven. Belgium."},{"key":"S1471068408003645_ref57","unstructured":"Vennekens J. , Denecker M. and Bruynooge M. 2006. Extending the role of causality in probabilistic modeling. http:\/\/www.cs.kuleuven.ac.be\/~joost\/#research."},{"key":"S1471068408003645_ref56","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"S1471068408003645_ref55","first-page":"715","volume-title":"Proc. of the 12th International Conference on Logic Programming (ICLP95)","author":"Sato","year":"1995"},{"key":"S1471068408003645_ref53","unstructured":"Riezler S. 1998. Probabilistic constraint logic programming. Ph.D. thesis, University of Tubingen, Tubingen, Germany."},{"key":"S1471068408003645_ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-5833-1"},{"key":"S1471068408003645_ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(93)90061-F"},{"key":"S1471068408003645_ref45","unstructured":"Paskin M. 2002. Maximum entropy probabilistic logic. Tech. Rep. UCB\/CSD-01-1161, Computer Science Division, University of California, Berkeley, CA."},{"key":"S1471068408003645_ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90031-7"},{"key":"S1471068408003645_ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90061-J"},{"key":"S1471068408003645_ref49","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00027-1"},{"key":"S1471068408003645_ref54","volume-title":"Proceedings of the Nineteenth International Conference on Uncertainty in AI (UAI-2003)","author":"Costa","year":"2003"},{"key":"S1471068408003645_ref43","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63255-7_32"},{"key":"S1471068408003645_ref14","first-page":"126","volume-title":"Proc. of the Fifteenth Conference on Uncertainty in Artificial Intelligence","author":"Cussens","year":"1999"},{"key":"S1471068408003645_ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90019-V"},{"key":"S1471068408003645_ref15","first-page":"227","volume-title":"Proc. of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS2000)","author":"De Vos","year":"2000"},{"key":"S1471068408003645_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04599-2_13"},{"key":"S1471068408003645_ref46","unstructured":"Pasula H. and Russell S. 2001. Approximate Inference for First-order Probabilistic Languages. IJCAI-01, Seattle, WA, 2001, 741\u2013748."},{"key":"S1471068408003645_ref37","unstructured":"Lukasiewicz T. 1998. Probabilistic logic programming. In Proe. of European Conference on Artificial Intelligence. 388\u2013392."},{"key":"S1471068408003645_ref41","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1023"},{"key":"S1471068408003645_ref32","doi-asserted-by":"publisher","DOI":"10.1007\/11546207_44"},{"key":"S1471068408003645_ref6","unstructured":"Balduccini M. and Gelfond M. 2003. Logic programs with consistency-restoring rules. In International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series. 9\u201318."},{"key":"S1471068408003645_ref18","first-page":"615","volume-title":"We Will Show Them! Essays in Honour of Dov Gabbay","author":"Ferraris","year":"2005"},{"key":"S1471068408003645_ref34","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018978005636"},{"key":"S1471068408003645_ref47","volume-title":"Causality","author":"Pearl","year":"2000"},{"key":"S1471068408003645_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068408003645_ref13","unstructured":"Citrigno S. , Eiter T. , Faber W. , Gottlob G. , Koch C. , Leone N. , Mateis C. , Pfeifer G. and Scarcello F. 1997. The dlv system: Model generator and application front ends. In Proc. of the 12th Workshop on Logic Programming, Bry F. , Freitag B. and Seipel D. , Eds. LMU, Munich, 128\u2013137."},{"key":"S1471068408003645_ref59","doi-asserted-by":"crossref","unstructured":"Vennekens J. , Verbaeten S. and Bruynooghe M. 2004. Logic programs with annotated disjunctions. In Proc. of International Conference on Logic Programming. 431\u2013445.","DOI":"10.1007\/978-3-540-27775-0_30"},{"key":"S1471068408003645_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90051-5"},{"key":"S1471068408003645_ref11","unstructured":"Breese J. 1990. Construction of belief and decision networks. Tech. rep., Technical Memorandom 90, Rockwell International Science Center, Palo Alto, CA."},{"key":"S1471068408003645_ref39","doi-asserted-by":"publisher","DOI":"10.2307\/2268973"},{"key":"S1471068408003645_ref20","first-page":"1070","volume-title":"Proc. of the Fifth Int'l Conference and Symposium on Logic Programming","author":"Gelfond","year":"1988"},{"key":"S1471068408003645_ref50","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00071-0"},{"key":"S1471068408003645_ref16","doi-asserted-by":"crossref","unstructured":"Dekhtyar A. and Dekhtyar M. 2004. Possible worlds semantics for probabilistic logic programs. In ICLP. 137\u2013148.","DOI":"10.1007\/978-3-540-27775-0_10"},{"key":"S1471068408003645_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)00028-5"},{"key":"S1471068408003645_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90025-6"},{"key":"S1471068408003645_ref33","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383783"},{"key":"S1471068408003645_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"S1471068408003645_ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068408003645_ref2","volume-title":"Representing and reasoning with uncertain knowledge","author":"Bacchus","year":"1990"},{"key":"S1471068408003645_ref42","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00128-4"},{"key":"S1471068408003645_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00003-3"},{"key":"S1471068408003645_ref4","first-page":"169","volume-title":"Proc. of Practical Aspects of Declarative Languages","author":"Balduccini","year":"2001"},{"key":"S1471068408003645_ref5","unstructured":"Balduccini M. , Gelfond M. , Nogueira M. and Watson R. 2002. Planning with the USA-Advisor. In 3rd NASA International workshop on Planning and Scheduling for."},{"key":"S1471068408003645_ref38","first-page":"29","volume-title":"Proc. of the 5th International Workshop on Inductive Logic Programming","author":"Muggleton","year":"1995"},{"key":"S1471068408003645_ref9","unstructured":"Baral C. , Gelfond M. and Rushton N. 2004. Probabilistic reasoning with answer sets. In Proc. of LPNMR7, Springer Berlin\/Heidelberg, Volume 2923, 21\u201333."},{"key":"S1471068408003645_ref10","first-page":"690","volume-title":"Proc. of IJCAI 01","author":"Boutilier","year":"2001"},{"key":"S1471068408003645_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001923"},{"key":"S1471068408003645_ref19","doi-asserted-by":"crossref","unstructured":"Gebser M. , Kaufmann B. , Neumann A. and Schaub T. 2007. CLASP: A conflict-driven answer set solver. In LPNMR'07. 260\u2013265.","DOI":"10.1007\/978-3-540-72200-7_23"},{"key":"S1471068408003645_ref51","first-page":"119","volume-title":"Logic and Data Bases","author":"Reiter","year":"1978"},{"key":"S1471068408003645_ref21","first-page":"50","volume-title":"Proc. of AAAI 06 Spring Symposium: Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering","author":"Gelfond","year":"2006"},{"key":"S1471068408003645_ref23","doi-asserted-by":"crossref","unstructured":"Getoor L. and Taskar B. 2007. Statistical Relational Learning. MIT Press, Cambridge, MA.","DOI":"10.7551\/mitpress\/7432.001.0001"},{"key":"S1471068408003645_ref25","volume-title":"Reasoning about Uncertainty","author":"Halpern","year":"2003"},{"key":"S1471068408003645_ref26","doi-asserted-by":"crossref","DOI":"10.1515\/9781400847310","volume-title":"The Ecological Detective","author":"Hilborn","year":"1997"},{"key":"S1471068408003645_ref29","volume-title":"An Introduction to Statistical Relational Learning","author":"Kersting","year":"2007"},{"key":"S1471068408003645_ref27","doi-asserted-by":"crossref","unstructured":"Iwan G. and Lakemeyer G. 2002. What observations really tell us. In CogRob'02.","DOI":"10.1007\/978-3-540-39451-8_15"},{"key":"S1471068408003645_ref28","volume-title":"Uncertain Inference","author":"Jr","year":"2001"},{"key":"S1471068408003645_ref30","doi-asserted-by":"crossref","unstructured":"Koller D. 1999. Probabilistic relational models. In ILP99. 3\u201313.","DOI":"10.1007\/3-540-48751-4_1"},{"key":"S1471068408003645_ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.09.003"},{"key":"S1471068408003645_ref35","unstructured":"Lifschitz V. and Turner H. 1994. Splitting a logic program. In Proc. of the Eleventh Int'l Conf. on Logic Programming, Van Hentenryck P. , Ed. 23\u201338."}],"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\/S1471068408003645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T21:29:13Z","timestamp":1633037353000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068408003645\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["S1471068408003645"],"URL":"https:\/\/doi.org\/10.1017\/s1471068408003645","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}