Resolution vs. cutting plane solution of inference problems: Some computational experience

Authors:
J. N. Hooker
Affiliations:
Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA 15213, USA
Venue:
Operations Research Letters
Year:
1988

Citing 8
Cited 3

Hard examples for resolution

Journal of the ACM (JACM)
Some results and experiments in programming techniques for propositional logic

Computers and Operations Research - Special issue: Applications of integer programming
Principles of artificial intelligence

Principles of artificial intelligence
Generalized resolution and cutting planes

Annals of Operations Research
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

Journal of the ACM (JACM)
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)

The state of SAT

Discrete Applied Mathematics
A weight-balanced branching rule for SAT

Mathematical and Computer Modelling: An International Journal
Backtracking tactics in the backtrack method for SAT

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Resolvents in the propositional calculus correspond to certain cutting planes in integer programming models of inference problems. We compare the performance of a rudimentary cutting plane algorithm that uses only resolvents as cuts with that of 'set-of-support' resolution on random inference problems. The cutting plane algorithm is orders of magnitude faster on problems in which the premises do not imply the given proposition (i.e., the majority of random problems), and moderately faster on other random problems.