Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(12)
Artificial Intelligent
Constraint Handling Rules
Expectation Maximization
Logic In Computer Science
Operational Semantics
Probabilistic Inference
Probabilistic Logic
Programming Language
Rapid Prototyping
Rewrite Rule
Science Learning
Statistical Model
Subscribe
Academic
Publications
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
Edit
CHR(PRISM)based probabilistic logic learning
(
Citations: 1
)
BibTex

RIS

RefWorks
Download
Jon Sneyers
,
Wannes Meert
,
Joost Vennekens
,
Yoshitaka Kameya
,
Taisuke Sato
PRISM is an extension of Prolog with probabilistic predicates and builtin support for expectationmaximization learning.
Constraint Handling Rules
(CHR) is a highlevel
programming language
based on multiheaded 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 highlevel
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. 46, pp. 433447, 2010
DOI:
10.1017/S1471068410000207
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.
(
www.informatik.unitrier.de
)
(
adsabs.harvard.edu
)
(
dx.doi.org
)
(
www.informatik.unitrier.de
)
More »
References
(16)
Confluence and Semantics of Constraint Simplification Rules
(
Citations: 35
)
Slim Abdennadher
,
Thom W. Frühwirth
,
Holger Meuss
Journal:
Constraints  An International Journal  CONSTRAINTS
, vol. 4, no. 2, pp. 133165, 1999
ARM: Automatic Rule Miner
(
Citations: 3
)
Slim Abdennadher
,
Abdellatif Olama
,
Noha Salem
,
Amira Thabet
Conference:
Logic Program Synthesis and Transformation  LOPSTR
, pp. 1725, 2006
CHR grammars
(
Citations: 22
)
Henning Christiansen
Journal:
Theory and Practice of Logic Programming  TPLP
, vol. 5, no. 45, pp. 467501, 2005
Preprocessing for Optimization of ProbabilisticLogic Models for Sequence Analysis
(
Citations: 2
)
Henning Christiansen
,
Ole Torp Lassen
Conference:
International Conference on Logic Programming/Joint International Conference and Symposium on Logic Programming  ICLP(JICSLP)
, pp. 7083, 2009
Userdefinable rule priorities for CHR
(
Citations: 24
)
Leslie De Koninck
,
Tom Schrijvers
,
Bart Demoen
Conference:
Principles and Practice of Declarative Programming  PPDP
, pp. 2536, 2007
Sort by:
Citations
(1)
7th International Workshop on Constraint Handling Rules
Peter Van Weert
,
Leslie De Koninck