{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:56:02Z","timestamp":1674568562894},"reference-count":22,"publisher":"Cambridge University Press (CUP)","issue":"4-6","license":[{"start":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T00:00:00Z","timestamp":1278633600000},"content-version":"unspecified","delay-in-days":8,"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":[[2010,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>PRISM is an extension of Prolog with probabilistic predicates and built-in support for expectation-maximization learning. Constraint Handling Rules (CHR) is a high-level programming language based on multi-headed multiset rewrite rules.<\/jats:p><jats:p>In this paper, we introduce a new probabilistic logic formalism, called <jats:monospace>CHRiSM<\/jats:monospace>, based on a combination of CHR and PRISM. It can be used for high-level rapid prototyping of complex statistical models by means of \u201cchance rules\u201d. The underlying PRISM system can then be used for several probabilistic inference tasks, including probability computation and parameter learning. We define the <jats:monospace>CHRiSM<\/jats:monospace> language in terms of syntax and operational semantics, and illustrate it with examples. We define the notion of ambiguous programs and define a distribution semantics for unambiguous programs. Next, we describe an implementation of <jats:monospace>CHRiSM<\/jats:monospace>, based on CHR(PRISM). We discuss the relation between <jats:monospace>CHRiSM<\/jats:monospace> and other probabilistic logic programming languages, in particular PCHR. Finally, we identify potential application domains.<\/jats:p>","DOI":"10.1017\/s1471068410000207","type":"journal-article","created":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T08:44:40Z","timestamp":1278665080000},"page":"433-447","source":"Crossref","is-referenced-by-count":11,"title":["CHR(PRISM)-based probabilistic logic learning"],"prefix":"10.1017","volume":"10","author":[{"given":"JON","family":"SNEYERS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WANNES","family":"MEERT","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JOOST","family":"VENNEKENS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YOSHITAKA","family":"KAMEYA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TAISUKE","family":"SATO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2010,7,9]]},"reference":[{"key":"S1471068410000207_ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009842826135"},{"key":"S1471068410000207_ref22","first-page":"431","volume-title":"ICLP 2004","author":"Vennekens","year":"2004"},{"key":"S1471068410000207_ref20","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068409990123"},{"key":"S1471068410000207_ref5","first-page":"70","volume-title":"ICLP 2009","author":"Christiansen","year":"2009"},{"key":"S1471068410000207_ref19","unstructured":"Sneyers J. , Meert W. , and Vennekens J. 2009. CHRiSM: Chance rules induce statistical models. In CHR 2009, Raiser F. and Sneyers J. , Eds. 62\u201376."},{"key":"S1471068410000207_ref18","unstructured":"Sneyers J. and Fr\u00fchwirth T. 2008. Generalized CHR machines. In CHR 2008, Schrijvers T. , Fr\u00fchwirth T. , and Raiser F. , Eds. 143\u2013157."},{"key":"S1471068410000207_ref16","unstructured":"Schrijvers T. and Demoen B. 2004. The K.U. Leuven CHR system: Implementation and application. In CHR 2004, Fr\u00fchwirth T. and Meister M. , Eds. 8\u201312."},{"key":"S1471068410000207_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45632-5_22"},{"key":"S1471068410000207_ref12","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"Pearl","year":"1988"},{"key":"S1471068410000207_ref13","unstructured":"Raiser F. , Betz H. , and Fr\u00fchwirth T. 2009. Equivalence of CHR states revisited. In CHR 2009, Raiser F. and Sneyers J. , Eds. 34\u201348."},{"key":"S1471068410000207_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609886"},{"key":"S1471068410000207_ref2","first-page":"17","volume-title":"LOPSTR 2006","author":"Abdennadher","year":"2006"},{"key":"S1471068410000207_ref4","first-page":"467","article-title":"CHR grammars","volume":"5","author":"Christiansen","year":"2005","journal-title":"TPLP"},{"key":"S1471068410000207_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-008-0062-7"},{"key":"S1471068410000207_ref21","unstructured":"Sneyers J. , Vennekens J. , and De Schreye D. 2006. Probabilistic-logical modeling of music. In PADL 2006, Hentenryck P. Van , Ed. 60\u201372."},{"key":"S1471068410000207_ref17","unstructured":"Sneyers J. 2010. Result-directed CHR execution. In CHR 2010, Van Weert P. and Koninck L. De , Eds. (to appear)."},{"key":"S1471068410000207_ref10","volume-title":"Statistical Relational Learning","author":"Getoor","year":"2007"},{"key":"S1471068410000207_ref9","volume-title":"WFLP 2002","author":"Fr\u00fchwirth","year":"2002"},{"key":"S1471068410000207_ref11","first-page":"269","volume-title":"CL 2000","author":"Kameya","year":"2000"},{"key":"S1471068410000207_ref6","first-page":"25","volume-title":"PPDP 2007","author":"De Koninck","year":"2007"},{"key":"S1471068410000207_ref7","first-page":"90","volume-title":"ICLP 2004","author":"Duck","year":"2004"},{"key":"S1471068410000207_ref3","first-page":"160","volume-title":"ICLP 2008","author":"Boenn","year":"2008"}],"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\/S1471068410000207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:32:17Z","timestamp":1556465537000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068410000207\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":22,"journal-issue":{"issue":"4-6","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["S1471068410000207"],"URL":"https:\/\/doi.org\/10.1017\/s1471068410000207","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}