{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:19:11Z","timestamp":1760170751284},"reference-count":33,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2011,7,6]],"date-time":"2011-07-06T00:00:00Z","timestamp":1309910400000},"content-version":"unspecified","delay-in-days":5,"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":[[2011,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many real world domains require the representation of a measure of uncertainty. The most common such representation is probability, and the combination of probability with logic programs has given rise to the field of Probabilistic Logic Programming (PLP), leading to languages such as the Independent Choice Logic, Logic Programs with Annotated Disjunctions (LPADs), Problog, PRISM, and others. These languages share a similar distribution semantics, and methods have been devised to translate programs between these languages. The complexity of computing the probability of queries to these general PLP programs is very high due to the need to combine the probabilities of explanations that may not be exclusive. As one alternative, the PRISM system reduces the complexity of query answering by restricting the form of programs it can evaluate. As an entirely different alternative, Possibilistic Logic Programs adopt a simpler metric of uncertainty than probability.<\/jats:p><jats:p>Each of these approaches\u2014general PLP, restricted PLP, and Possibilistic Logic Programming\u2014can be useful in different domains depending on the form of uncertainty to be represented, on the form of programs needed to model problems, and on the scale of the problems to be solved. In this paper, we show how the PITA system, which originally supported the general PLP language of LPADs, can also efficiently support restricted PLP and Possibilistic Logic Programs. PITA relies on tabling with answer subsumption and consists of a transformation along with an API for library functions that interface with answer subsumption. We show that, by adapting its transformation and library functions, PITA can be parameterized to PITA(IND, EXC) which supports the restricted PLP of PRISM, including optimizations that reduce non-discriminating arguments and the computation of Viterbi paths. Furthermore, we show PITA to be competitive with PRISM for complex queries to Hidden Markov Model examples, and sometimes much faster. We further show how PITA can be parameterized to PITA(COUNT) which computes the number of different explanations for a subgoal, and to PITA(POSS) which scalably implements Possibilistic Logic Programming. PITA is a supported package in version 3.3 of XSB.<\/jats:p>","DOI":"10.1017\/s147106841100010x","type":"journal-article","created":{"date-parts":[[2011,7,6]],"date-time":"2011-07-06T09:15:37Z","timestamp":1309943737000},"page":"433-449","source":"Crossref","is-referenced-by-count":46,"title":["The PITA system: Tabling and answer subsumption for reasoning under uncertainty"],"prefix":"10.1017","volume":"11","author":[{"given":"FABRIZIO","family":"RIGUZZI","sequence":"first","affiliation":[]},{"given":"TERRANCE","family":"SWIFT","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2011,7,6]]},"reference":[{"key":"S147106841100010X_ref12","doi-asserted-by":"crossref","unstructured":"Kersting K. and De Raedt L. 2000. Bayesian logic programs. In Inductive Logic Programming, CEUR Workshop Proceedings. Sun SITE Central Europe.","DOI":"10.1007\/3-540-44797-0_9"},{"key":"S147106841100010X_ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27775-0_14"},{"key":"S147106841100010X_ref8","unstructured":"De Raedt L. , Kimmig A. and Toivonen H. 2007. ProbLog: A probabilistic Prolog and its application in link discovery. In Internation Joint Conference on Artificial Intelligence, IJCAI, 2462\u20132467."},{"key":"S147106841100010X_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.07.008"},{"key":"S147106841100010X_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068408003645"},{"key":"S147106841100010X_ref10","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":"Dubois","year":"1994"},{"key":"S147106841100010X_ref26","unstructured":"Riguzzi F. and Swift T. 2010b. Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions. In Technical Communications of the International Conference on Logic Programming. LIPIcs, vol. 7. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, 162\u2013171."},{"key":"S147106841100010X_ref21","first-page":"109","volume-title":"Congress of the Italian Association for Artificial Intelligence","author":"Riguzzi","year":"2007"},{"key":"S147106841100010X_ref14","first-page":"96","volume-title":"International Conference on Inductive Logic Programming","author":"Meert","year":"2009"},{"key":"S147106841100010X_ref25","unstructured":"Riguzzi F. and Swift T. 2010a. An extended semantics for logic programs with annotated disjunctions and its efficient implementation. In Italian Conference on Computational Logic. CEUR Workshop Proceedings, vol. 598. Sun SITE Central Europe."},{"key":"S147106841100010X_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89982-2_54"},{"key":"S147106841100010X_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02846-5_10"},{"key":"S147106841100010X_ref29","unstructured":"Sato T. , Zhou N.-F. , Kameya Y. and Izumi Y. 2010. PRISM Users Manual (Version 2.0). http:\/\/sato-www.cs.titech.ac.jp\/prism\/download\/prism20.pdf."},{"key":"S147106841100010X_ref6","first-page":"152","volume-title":"Russian Conference on Logic Programming","author":"Dantsin","year":"1991"},{"key":"S147106841100010X_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037184"},{"key":"S147106841100010X_ref30","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018990308362"},{"key":"S147106841100010X_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00071-0"},{"key":"S147106841100010X_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00027-1"},{"key":"S147106841100010X_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2003.10.011"},{"key":"S147106841100010X_ref33","unstructured":"Zhou N.-F. 2011. The language features and architecture of B-Prolog. CoRR abs\/1103.0812."},{"key":"S147106841100010X_ref27","volume-title":"Conference on Uncertainty in Artificial Intelligence","author":"Santos Costa","year":"2003"},{"key":"S147106841100010X_ref28","doi-asserted-by":"crossref","first-page":"715","DOI":"10.7551\/mitpress\/4298.003.0069","volume-title":"International Conference on Logic Programming","author":"Sato","year":"1995"},{"key":"S147106841100010X_ref9","first-page":"581","volume-title":"International Conference on Logic Programming","author":"Dubois","year":"1991"},{"key":"S147106841100010X_ref17","first-page":"15","volume-title":"Mexican International Conference on Artificial Intelligence","author":"Osorio","year":"2009"},{"key":"S147106841100010X_ref24","doi-asserted-by":"crossref","first-page":"429","DOI":"10.3233\/FI-2010-313","article-title":"SLGAD resolution for inference on Logic Programs with Annotated Disjunctions.","volume":"102","author":"Riguzzi","year":"2010","journal-title":"Fundam. Inform."},{"key":"S147106841100010X_ref31","doi-asserted-by":"crossref","unstructured":"Vennekens J. and Verbaeten S. 2003. Logic programs with annotated disjunctions. Tech. Rep. CW386, K. U. Leuven.","DOI":"10.1007\/978-3-540-27775-0_30"},{"key":"S147106841100010X_ref2","volume-title":"Conference on Uncertainty in Artificial Intelligence","author":"Bauters","year":"2010"},{"key":"S147106841100010X_ref7","unstructured":"De Raedt L. , Demoen B. , Fierens D. , Gutmann B. , Janssens G. , Kimmig A. , Landwehr N. , Mantadelis T. , Meert W. , Rocha R. , Santos Costa V. , Thon I. and Vennekens J. 2008. Towards digesting the alphabet-soup of statistical relational learning. In NIPS2008 Workshop on Probabilistic Programming, 13 December 2008, Whistler, Canada."},{"key":"S147106841100010X_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-006-9029-y"},{"key":"S147106841100010X_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89982-2_22"},{"key":"S147106841100010X_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72200-7_32"},{"key":"S147106841100010X_ref23","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzp025"},{"key":"S147106841100010X_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/383721.383725"}],"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\/S147106841100010X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T14:14:30Z","timestamp":1712585670000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106841100010X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":33,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["S147106841100010X"],"URL":"https:\/\/doi.org\/10.1017\/s147106841100010x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}