Preprocessing Boolean formulae for BDDs in a probabilistic context

DOI10.1007/978-3-642-15675-5_23MaRDI QIDQ4930770zbMATH OpenOpenAlexFDO

Authors Theofrastos Mantadelis, Ricardo Rocha, Angelika Kimmig, Gerda Janssens

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 diagramsBoolean formula manipulationprobabilistic logic learningProbLog

Mathematics Subject Classification ID

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

Recommendations

• Variable Compression in ProbLog
• Compacting Boolean formulae for inference in probabilistic logic programming
• Preprocessing for DQBF
• Binary decision diagrams for first-order predicate logic.
• BDDs -- design, analysis, complexity, and applications.

Cited in

(5)

• The Boolean constraint solver of SWI-Prolog (system description)
• Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
• A New Look at BDDs for Pseudo-Boolean Constraints
• Compacting Boolean formulae for inference in probabilistic logic programming
• Theory and Applications of Satisfiability Testing

Describes a project that uses

Uses Software

• ProbLog

This page was built for publication: Preprocessing Boolean formulae for BDDs in a probabilistic context

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