CHR(PRISM)-based probabilistic logic learning

J Sneyers; W Meert; J Vennekens; Y Kameya; T Sato

doi:10.1017/S1471068410000207

CHR(PRISM)-based probabilistic logic learning

J Sneyers, W Meert, J Vennekens, Y Kameya, T Sato

Research output: Contribution to journal › Article › peer-review

13 Citations (Scopus)

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.

Original language	English
Pages (from-to)	433-447
Number of pages	15
Journal	Theory and Practice of Logic Programming
Volume	10
DOIs	https://doi.org/10.1017/S1471068410000207
Publication status	Published - 1 Jul 2010
Externally published	Yes

Access to Document

10.1017/S1471068410000207

Handle.net

Persistent link

Cite this

@article{11270cbbc32d46889e0c63c2c9ed8974,

title = "CHR(PRISM)-based probabilistic logic learning",

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.",

author = "J Sneyers and W Meert and J Vennekens and Y Kameya and T Sato",

year = "2010",

month = jul,

day = "1",

doi = "10.1017/S1471068410000207",

language = "English",

volume = "10",

pages = "433--447",

journal = "Theory and Practice of Logic Programming",

issn = "1471-0684",

publisher = "Cambridge Univ. Press",

}

TY - JOUR

T1 - CHR(PRISM)-based probabilistic logic learning

AU - Sneyers, J

AU - Meert, W

AU - Vennekens, J

AU - Kameya, Y

AU - Sato, T

PY - 2010/7/1

Y1 - 2010/7/1

N2 - 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.

AB - 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.

U2 - 10.1017/S1471068410000207

DO - 10.1017/S1471068410000207

M3 - Article

SN - 1471-0684

VL - 10

SP - 433

EP - 447

JO - Theory and Practice of Logic Programming

JF - Theory and Practice of Logic Programming

ER -

CHR(PRISM)-based probabilistic logic learning

Abstract

Access to Document

Handle.net

Fingerprint

Cite this