Branching rules for satisfiability
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
All Related Versions
This publication has 5 references indexed in Scilit:
- A continuous approach to inductive inferenceMathematical Programming, 1992
- Compact normal forms in propositional logic and integer programming formulationsComputers & Operations Research, 1990
- Algorithms for testing the satisfiability of propositional formulaeThe Journal of Logic Programming, 1989
- Controlled Experimental Design for Statistical Comparison of Integer Programming AlgorithmsManagement Science, 1979
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960