Some results and experiments in programming techniques for propositional logic


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… (More)
DOI: 10.1016/0305-0548(86)90056-0


4 Figures and Tables


Citations per Year

126 Citations

Semantic Scholar estimates that this publication has 126 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics