Branching rules for satisfiability

Publisher Website

1 January 1995

journal article
Published by Springer Nature in Journal of Automated Reasoning

Vol. 15 (3) , 359-383
https://doi.org/10.1007/bf00881805

Abstract

No abstract available

Keywords

All Related Versions

Version 1, RePEc (Unconfirmed version)

This publication has 8 references indexed in Scilit:

A Computational Study of Satisfiability Algorithms for Propositional Logic
INFORMS Journal on Computing, 1994
Needed: An Empirical Science of Algorithms
Operations Research, 1994
A continuous approach to inductive inference
Mathematical Programming, 1992
Compact normal forms in propositional logic and integer programming formulations
Computers & Operations Research, 1990
Algorithms for testing the satisfiability of propositional formulae
The Journal of Logic Programming, 1989
Controlled Experimental Design for Statistical Comparison of Integer Programming Algorithms
Management Science, 1979
The complexity of theorem-proving procedures
Published by Association for Computing Machinery (ACM) ,1971
A Computing Procedure for Quantification Theory
Journal of the ACM, 1960