Preprocessing Boolean Formulae for BDDs in a Probabilistic Context

DOI10.1007/978-3-642-15675-5_23zbMath1306.68055OpenAlexW1499336148MaRDI QIDQ4930770

Angelika Kimmig, Theofrastos Mantadelis, Gerda Janssens, Ricardo Rocha

Publication date: 1 October 2010

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/270070

zbMATH Keywords

binary decision diagramsProbLogprobabilistic logic learningBoolean formula manipulation

Mathematics Subject Classification ID

Computational learning theory (68Q32) Logic in artificial intelligence (68T27) Logic programming (68N17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Compacting Boolean Formulae for Inference in Probabilistic Logic Programming ⋮ The Boolean Constraint Solver of SWI-Prolog (System Description)

Uses Software

• ProbLog

This page was built for publication: Preprocessing Boolean Formulae for BDDs in a Probabilistic Context