Abstract
We found that the Jeroslow-Wang rule is substantially better than random branching, but the original motivation for it (the Satisfaction Hypothesis) does not explain its success, for several reasons. The reasons may be found in the final version.
We found that performance is better explained by a Simplification Hypothesis that focuses on a rule's propensity to choose branches that simplify the problem. In any case, the resulting positive 2-sided Jeroslow-Wang rule appears to be the best examined here and is significantly better than the old Jeroslow-Wang rule.
The first author is partially supported by ONR grant N00014-92-J-1028. The authors wish to thank Ajai Kapoor for assistance in computational testing and statistical analysis.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Amini, M. M., and M. Racer, A variable-depth-search heuristic for the generalized assignment problem, to appear in Management Science.
Böhm, H., Report on a SAT competition, Technical report No. 110, Universität Paderborn, Germany, 1992.
Crawford, J., problems contributed to DIMACS. For information contact Crawford at AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ 07974-0636 USA, email jc@research.att.com.
Davis, M., and H. Putnam, A computing procedure for quantification theory, Journal of the ACM 7 (1960) 201–215.
Dubois, O., problems contributed to DIMACS. For information contact Dubois at Laforia, CNRS-Université Paris 6, 4 place Jussieu, 75252 Paris cedex 05, France, email dubois@laforia.ibp.fr.
Dubois, O., P. Andre, Y. Boufkhad and J. Carlier, SAT versus UNSAT, manuscript, Laforia, CNRS-Université Paris 6, 4 place Jussieu, 75252 Paris cedex 05, France, email dubois@laforia.ibp.fr, 1993.
Erdös, P., and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets (North-Holland, Amsterdam) 1975.
Gallo, G., and D. Pretolani, A new algorithm for the propositional satisfiability problem, report TR-3/90, Dip. di Informatica, Universitá di Pisa, to appear in Discrete Applied Mathematics.
Gallo, G., and G. Urbani, Algorithms for testing the satisfiability of propositional formulae, Journal of Logic programming 7 (1989) 45–61.
Golden, B. L., and W. R. Stewart, Empirical analysis of heuristics, in Lawler, Lenstra, Rinnooy Kan and Schmoys, eds., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985) 207–249.
Harche, F., J. N. Hooker and G. Thompson, A computational study of sastifiability algorithms for prepositional logic, to appear in ORSA Journal on Computing. For more information contact J. Hooker, email jh38@andrew.cmu.edu.
Hooker, J. N., Needed: An empirical science of algorithms, to appear in Operations Research.
Hooker, J. N., and C. Fedjki, Branch and cut solution of inference problems in propositional logic, Annals of Mathematics and AI 1 (1990) 123–139.
Iwama, K., H. Albeta and E. Miyano, Random generation of satisfiable and unsatisfiable CNF predicates, Proceedings of 12th IFIP World Computer Congress (1992) 322–328. For further information contact Eiji Miyano, Dept. of Computer Science and Communication Engineering, Kyushu University, Fukuoka 812, Japan, email miyano@csce.kyushu-u.ac.jp.
Jeroslow, R., and J. Wang, Solving propositional satisfiability problems, Annals of Mathematics and AI 1 (1990) 167–187.
Kamath, A., N. Karmarkar, K. Ramakrishnan, and M. Resende, A continuous approach to inductive inference, Mathematical Programming 57 (1992) 215–238. For further information contact Mauricio Resende, AT&T Bell Laboratories, Murray Hill, NJ 07974 USA, email mgcr@research.att.com.
Lin, B. W., and R. L. Rardin, Controlled experimental design for statistical comparison of integer programming algorithms, Management Science 25 (1980) 1258–1271.
Loveland, D. W., Automated Theorem Proving: A Logical Basis (North-Holland, 1978).
Mitterreiter, I., and F. J. Radermacher, Experiments on the running time behavior of some algorithms solving propositional logic problems, manuscript, Forschungsinstitut für anwendungsorientierte Wissensverarbeitung, Ulm, Germany, 1991.
Petersen, R. G., Design and Analysis of Experiments (M. Dekker, New York, 1985).
Pretolani, D., Centre de recherche sur les transports, 3535 Queen Mary, Suite 430, Montréal, Québec H3V 1H8, Canada, email daniele@crt.umontreal.ca.
Spencer, J., Ten Lectures on the Probabilistic Method, Regional Conference Series in Applied Mathematics 52, (Society for Industrial and Applied Mathematics, Philadelphia, 1987).
Van Gelder, A., and Y. K. Tsuji, problems contributed to DIMACS. For information contact them at University of California, Santa Cruz, CA USA, email avg@cs.ucsc.edu or tsuji@cs.ucsc.edu.
Wilson, J. M., Compact normal forms in propositional logic and integer programming formulations, Computers and Operations Research. 90 (1990) 309–314.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hooker, J.N., Vinay, V. (1994). Branching rules for satisfiability. In: Thiagarajan, P.S. (eds) Foundation of Software Technology and Theoretical Computer Science. FSTTCS 1994. Lecture Notes in Computer Science, vol 880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58715-2_143
Download citation
DOI: https://doi.org/10.1007/3-540-58715-2_143
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58715-6
Online ISBN: 978-3-540-49054-8
eBook Packages: Springer Book Archive