Abstract
Recently linear 0–1 programming methods have been successfully applied to the satisfiability problem of propositional logic. We present a preprocessing method that simplifies the linear 0–1 integer problem corresponding to a clausal satisfiability problem. Valid extended clauses, a generalization of classical clauses, are added to the problem as long as they dominate at least one extended clause of the problem. We describe how to efficiently obtain these valid extended clauses and apply the method to some combinatorial satisfiability problems. The reformulated 0–1 problems contain less but usually stronger 0–1 inequalities and are typically solved much faster than the original one with traditional 0–1 integer programming methods.
The work was supported by the German Ministry for Research and Technology (BMFT) (contract ITS 9103), the ESPRIT Basic Research Project ACCLAIM (contract EP 7195) and the ESPRIT Working Group CCL (contract EP 6028).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Barth. Linear 0–1 inequalities and extended clauses. In Logic Programming and Automated Reasoning: international conference LPAR '93; St. Petersburg, Russia; proceedings, July 1993.
B. Benhamou and L. Sais. Theoretical study of symmetries in propositional calculus and applications. In Proc. 11th CADE, Saratoga Springs. Springer, LNCS 607, 1992.
W. Cook, C. R. Coullard, and G. Turán. On the complexity of cutting plane proofs. Discrete Applied Mathematics, 18:25–38, 1987.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201–205, 1960.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39(2 & 3):297–308, 1985.
J. N. Hooker. A quantitative approach to logical inference. Decision Support Systems, 4:45–69, 1988.
J. N. Hooker. Resolution vs. cutting plane solution of inference problems: some computational experience. Operations Research Letters, 7(1):1–7, 1988.
J. N. Hooker. Generalized resolution for 0–1 linear inequalities. Annals of Mathematics and Artificial Intelligence, 6:271–286, 1992.
J. N. Hooker and C. Fedjki. Branch-and-cut solution of inference problems in propositional logic. Annals of Mathematics and Artificial Intelligence, 1:123–139, 1990.
D. W. Loveland. Automated theorem proving: a logical basis, volume 6 of Fundamental studies in computer science. North-Holland, Amsterdam, 1978.
I. Mitterreiter and F. J. Radermacher. Experiments on the running time behaviour of some algorithms solving propositional logic problems. Technical report, FAW Ulm, 1991.
G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. Series in Discrete Mathematics and Optimization. Wiley-Interscience, 1988.
J. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23–41, 1965.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barth, P. (1994). Simplifying clausal satisfiability problems. In: Jouannaud, JP. (eds) Constraints in Computational Logics. CCL 1994. Lecture Notes in Computer Science, vol 845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016842
Download citation
DOI: https://doi.org/10.1007/BFb0016842
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58403-2
Online ISBN: 978-3-540-48699-2
eBook Packages: Springer Book Archive