Finding the Optimal Variable Ordering for Binary Decision Diagrams.
Steven J. FriedmanKenneth J. SupowitPublished in: IEEE Trans. Computers (1990)
Keyphrases
- variable ordering
- binary decision diagrams
- branch and bound algorithm
- boolean functions
- optimal solution
- propositional satisfiability
- planning problems
- upper bound
- max sat
- dynamic programming
- search algorithm
- information extraction
- orders of magnitude
- branch and bound
- np hard
- lower bound
- randomly generated
- knowledge base