{"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":1772373089144,"version":"3.50.1"},"reference-count":30,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T00:00:00Z","timestamp":1327449600000},"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,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Distribution semantics is one of the most prominent approaches for the combination of logic programming and probability theory. Many languages follow this semantics, such as Independent Choice Logic, PRISM, pD, Logic Programs with Annotated Disjunctions (LPADs), and ProbLog. When a program contains functions symbols, the distribution semantics is well\u2013defined only if the set of explanations for a query is finite and so is each explanation. Well\u2013definedness is usually either explicitly imposed or is achieved by severely limiting the class of allowed programs. In this paper, we identify a larger class of programs for which the semantics is well\u2013defined together with an efficient procedure for computing the probability of queries. Since Logic Programs with Annotated Disjunctions offer the most general syntax, we present our results for them, but our results are applicable to all languages under the distribution semantics. We present the algorithm \u201cProbabilistic Inference with Tabling and Answer subsumption\u201d (PITA) that computes the probability of queries by transforming a probabilistic program into a normal program and then applying SLG resolution with answer subsumption. PITA has been implemented in XSB and tested on six domains: two with function symbols and four without. The execution times are compared with those of ProbLog,<jats:monospace>cplint<\/jats:monospace>, and CVE. PITA was almost always able to solve larger problems in a shorter time, on domains with and without function symbols.<\/jats:p>","DOI":"10.1017\/s1471068411000664","type":"journal-article","created":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T14:20:41Z","timestamp":1327501241000},"page":"279-302","source":"Crossref","is-referenced-by-count":24,"title":["Well\u2013definedness and efficient inference for probabilistic logic programming under the distribution semantics"],"prefix":"10.1017","volume":"13","author":[{"given":"FABRIZIO","family":"RIGUZZI","sequence":"first","affiliation":[]},{"given":"TERRANCE","family":"SWIFT","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2012,1,25]]},"reference":[{"key":"S1471068411000664_ref30","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-540-27775-0_14","volume-title":"Proc. of the International Conference on Logic Programming","author":"Vennekens","year":"2004"},{"key":"S1471068411000664_ref28","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116838"},{"key":"S1471068411000664_ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"S1471068411000664_ref25","first-page":"171","volume-title":"Proc. of the International Symposium on Multiple-Valued Logic","author":"Thayse","year":"1978"},{"key":"S1471068411000664_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16492-8_66"},{"key":"S1471068411000664_ref23","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018990308362"},{"key":"S1471068411000664_ref22","first-page":"163","volume-title":"Recent Advances in Artifiial Intelligence","author":"Swift","year":"1999"},{"key":"S1471068411000664_ref21","first-page":"1330","volume-title":"Proc. of the International Joint Conference on Artificial Intelligence","author":"Sato","year":"1997"},{"key":"S1471068411000664_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00341-2"},{"key":"S1471068411000664_ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841100010X"},{"key":"S1471068411000664_ref16","first-page":"109","volume-title":"Proc. of the Congress of the Italian Association for Artificial Intelligence","author":"Riguzzi","year":"2007"},{"key":"S1471068411000664_ref15","first-page":"11","volume-title":"Proc. of the Symposium on Principles of Database Systems","author":"Przymusinski","year":"1989"},{"key":"S1471068411000664_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00027-1"},{"key":"S1471068411000664_ref12","first-page":"96","volume-title":"Proc. of the International Conference on Inductive Logic Programming","author":"Meert","year":"2009"},{"key":"S1471068411000664_ref9","volume-title":"Proc. of the International Workshop on Statistical Relational Learning","author":"Kimmig","year":"2009"},{"key":"S1471068411000664_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000566"},{"key":"S1471068411000664_ref4","volume-title":"Proc. of the NIPS2008 Workshop on Probabilistic Programming","author":"De Raedt","year":"2008"},{"key":"S1471068411000664_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89982-2_54"},{"key":"S1471068411000664_ref27","first-page":"1","volume-title":"Proc. of the Symposium on Principles of Database Systems","author":"van Gelder","year":"1989"},{"key":"S1471068411000664_ref20","doi-asserted-by":"crossref","first-page":"715","DOI":"10.7551\/mitpress\/4298.003.0069","volume-title":"Proc. of the International Conference on Logic Programming","author":"Sato","year":"1995"},{"key":"S1471068411000664_ref11","first-page":"124","volume-title":"Proc. of the Technical Communications of the International Conference on Logic Programming","author":"Mantadelis","year":"2010"},{"key":"S1471068411000664_ref29","volume-title":"Logic Programs with Annotated Disjunctions","author":"Vennekens","year":"2003"},{"key":"S1471068411000664_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89982-2_37"},{"key":"S1471068411000664_ref10","volume-title":"Foundations of the Theory of Probability","author":"Kolmogorov","year":"1950"},{"key":"S1471068411000664_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S147106840900372X"},{"key":"S1471068411000664_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00071-0"},{"key":"S1471068411000664_ref6","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(2000)51:2<95::AID-ASI2>3.0.CO;2-H"},{"key":"S1471068411000664_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/227595.227597"},{"key":"S1471068411000664_ref5","first-page":"2462","volume-title":"Proc. of the International Joint Conference on Artificial Intelligence","author":"De Raedt","year":"2007"},{"key":"S1471068411000664_ref7","first-page":"269","volume-title":"Proc. of the International Conference on Computational Logic","author":"Kameya","year":"2000"}],"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\/S1471068411000664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T13:12:46Z","timestamp":1713445966000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068411000664\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,25]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["S1471068411000664"],"URL":"https:\/\/doi.org\/10.1017\/s1471068411000664","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,25]]}}}