Declarative probabilistic logic programming in discrete-continuous domains

Over the past three decades, the logic programming paradigm has been successfully expanded to support probabilistic modeling, inference and learning. The resulting paradigm of probabilistic logic programming (PLP) and its programming languages owes much of its success to a declarative semantics, the...

Full description

Bibliographic Details

Published in:	Artificial intelligence Vol. 337; p. 104227
Main Authors:	Zuidberg Dos Martires, Pedro, De Raedt, Luc, Kimmig, Angelika
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.12.2024
Subjects:	Algebraic model counting Declarative semantics Discrete-continuous distributions Knowledge compilation Likelihood weighting Logic programming Probabilistic programming Logic programming Probabilistic programming Discrete-continuous distributions Algebraic model counting Declarative semantics Likelihood weighting Knowledge compilation
ISSN:	0004-3702, 1872-7921
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!