Conflict-Based Selection of Branching Rules
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 441-451
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Efficient Computation of Recurrence Diameters2002
- Partition-based decision heuristics for image computation using SAT and BDDs2002
- QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability2001
- Chaff2001
- Symbolic Model Checking without BDDs1999
- Symbolic model checking for sequential circuit verificationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- A note on succinct representations of graphsInformation and Control, 1986
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Succinct representations of graphsInformation and Control, 1983