CHR(PRISM)-based probabilistic logic learning

CHR(PRISM)-based probabilistic logic learning,10.1017/S1471068410000207,Theory and Practice of Logic Programming,Jon Sneyers,Wannes Meert,Joost Vennek

CHR(PRISM)-based probabilistic logic learning   (Citations: 1)
BibTex | RIS | RefWorks Download
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. In this paper, we introduce a new probabilistic logic formalism, called CHRiSM, based on a combination of CHR and PRISM. It can be used for high-level rapid prototyping of complex statistical models by means of "chance rules". The underlying PRISM system can then be used for several probabilistic inference tasks, including probability computation and parameter learning. We define the CHRiSM 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 CHRiSM, based on CHR(PRISM). We discuss the relation between CHRiSM and other probabilistic logic programming languages, in particular PCHR. Finally we identify potential application domains.
Journal: Theory and Practice of Logic Programming - TPLP , vol. 10, no. 4-6, pp. 433-447, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: