Speculative Pruning for Boolean Satisfiability
MetadataShow full item record
CitationRuml, Wheeler, Adam Ginsburg, and Stuart Shieber. Speculative Pruning for Boolean Satisfiability. Harvard Computer Science Group Technical Report TR-02-99.
AbstractMuch recent work on boolean satisfiability has focussed on incomplete algorithms that sacrifice accuracy for improved running time. Statistical predictors of satisfiability do not return actual satisfying assignments, but at least two have been developed that run in linear time. Search algorithms allow increased accuracy with additional running time, and can return satisfying assignments. The efficient search algorithms have been proposed are based on iteratively improving a random assignment, in effect searching a graph of degree equal to the number of variables. In this paper, we examine an incomplete algorithm based on searching a standard binary tree, in which statistical predictors are used to speculatively prune the tree in constant time. Experimental evaluation on hard random instances shows it to be the first practical incomplete algorithm based on tree search, surpassing even graph-based methods on smaller instances.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:23518799
- FAS Scholarly Articles