CHR(PRISM)-based Probabilistic Logic Learning

Details CHR(PRISM)-based Probabilistic Logic Learning CHR(PRISM)-based Probabilistic Logic Learning

2010-07-22

arxiv.org/abs/1007.3858v1

Theory and Practice of Logic Programming, 10(4-6), 433-447, 2010

Computer Science

Programming Languages

Scientific paper

10.1017/S1471068410000207

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.

Affiliated with

Also associated with

No associations

Rating

CHR(PRISM)-based Probabilistic Logic Learning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with CHR(PRISM)-based Probabilistic Logic Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and CHR(PRISM)-based Probabilistic Logic Learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-612278