Lex-Partitioning: A New Option for BDD Search

by   Stefan Edelkamp, et al.
Universidad Carlos III de Madrid

For the exploration of large state spaces, symbolic search using binary decision diagrams (BDDs) can save huge amounts of memory and computation time. State sets are represented and modified by accessing and manipulating their characteristic functions. BDD partitioning is used to compute the image as the disjunction of smaller subimages. In this paper, we propose a novel BDD partitioning option. The partitioning is lexicographical in the binary representation of the states contained in the set that is represented by a BDD and uniform with respect to the number of states represented. The motivation of controlling the state set sizes in the partitioning is to eventually bridge the gap between explicit and symbolic search. Let n be the size of the binary state vector. We propose an O(n) ranking and unranking scheme that supports negated edges and operates on top of precomputed satcount values. For the uniform split of a BDD, we then use unranking to provide paths along which we partition the BDDs. In a shared BDD representation the efforts are O(n). The algorithms are fully integrated in the CUDD library and evaluated in strongly solving general game playing benchmarks.


page 1

page 2

page 3

page 4


Non-uniform quantization with linear average-case computation time

A new method for binning a set of n data values into a set of m bins for...

UpMax: User partitioning for MaxSAT

It has been shown that Maximum Satisfiability (MaxSAT) problem instances...

Conformant Planning via Symbolic Model Checking

We tackle the problem of planning in nondeterministic domains, by presen...

A Hybrid Partitioning Strategy for Backward Reachability of Neural Feedback Loops

As neural networks become more integrated into the systems that we depen...

Binary Space Partitioning as Intrinsic Reward

An autonomous agent embodied in a humanoid robot, in order to learn from...

Optimal Parametric Search for Path and Tree Partitioning

We present linear-time algorithms for partitioning a path or a tree with...

Please sign up or login with your details

Forgot password? Click here to reset