Some results and experiments in programming techniques for propositional logic

@article{Blair1986SomeRA,
  title={Some results and experiments in programming techniques for propositional logic},
  author={Charles E. Blair and Robert G. Jeroslow and James K. Lowe},
  journal={Computers & OR},
  year={1986},
  volume={13},
  pages={633-645}
}
We provide some results which relate mathematical programming techniques for treating propositional logic to theorem-proving techniques for this logic. We show that the branch-and-bound method, applied to the usual linear representation of clauses, is very similar to an implementation of Loveland’s (generally stronger) form of the algorithm of Davis and Putnam. However, branch-and-bound does not include the fixing of monotone variables. while it does have the incumbent-finding feature which is… CONTINUE READING