CHR(PRISM)-based probabilistic logic learning

DOI10.1017/S1471068410000207zbMATH Open1209.68100arXiv1007.3858OpenAlexW2114163423MaRDI QIDQ3585158FDOQ3585158

Authors: Jon Sneyers, Wannes Meert, Joost Vennekens, Yoshitaka Kameya, Taisuke Sato 

Publication date: 19 August 2010

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1007.3858

Recommendations

• Learning probabilistic logic models from probabilistic examples
• Learning Probabilistic Logic Models from Probabilistic Examples (Extended Abstract)
• New Advances in Logic-Based Probabilistic Modeling by PRISM
• Structure learning of probabilistic logic programs by searching the clause space
• Lifted discriminative learning of probabilistic logic programs
• Learning hierarchical probabilistic logic programs

zbMATH Keywords

constraint handling rulesprobabilistic logic learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17)

Cites Work

• Title not available (Why is that?)
• Confluence and semantics of constraint simplification rules
• As time goes by: constraint handling rules
• Constraint Handling Rules

Cited In (8)

• Probabilistic termination of CHRiSM programs
• A labelling framework for probabilistic argumentation
• New Advances in Logic-Based Probabilistic Modeling by PRISM
• Probabilistic (logic) programming concepts
• Learning failure-free PRISM programs
• Models and emerging trends of concurrent constraint programming
• Logic-Based Probabilistic Modeling
• Unfolding for CHR programs

This page was built for publication: CHR(PRISM)-based probabilistic logic learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585158)