Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Who are the variables in your neighborhood
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
Faster SAT and smaller BDDs via common function structure
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
IEEE Transactions on Computers
The Most Reliable Subgraph Problem
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
On the Efficient Execution of ProbLog Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Constraint and variable ordering heuristics for compiling configuration problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
ProbLog: a probabilistic prolog and its application in link discovery
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Link discovery in graphs derived from biological databases
DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences
| Hi-index | 0.00 |
In order to compute the probability of a query, ProbLog represents the proofs of the query as disjunctions of conjunctions, for which a Reduced Ordered Binary Decision Diagram (ROBDD) is computed. The paper identifies patterns of Boolean variables that occur in Boolean formulae, namely AND-clusters and OR-clusters. Our method compresses the variables in these clusters and thus reduces the size of ROBDDs without affecting the probability. We give a polynomial algorithm that detects AND-clusters in disjunctive normal form (DNF) Boolean formulae, or OR-clusters in conjunctive normal form (CNF) Boolean formulae. We do an experimental evaluation of the effects of AND-cluster compression for a real application of ProbLog. With our prototype implementation we have a significant improvement in performance (up to 87%) for the generation of ROBDDs. Moreover, compressing AND-clusters of Boolean variables in the DNFs makes it feasible to deal with ProbLog queries that give rise to larger DNFs.