Some pitfalls for experimenters with random SAT
Authors:
- David G. MitchellDMDavid G. Mitchell
- Hector J. LevesqueHLHector J. Levesque
- 1 March 1996
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 81 (1-2) , 111-125
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Critical behavior in the computational cost of satisfiability testingArtificial Intelligence, 1996
- Solving satisfiability via Boltzmann machinesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1993
- Efficient local search for very large-scale satisfiability problemsACM SIGART Bulletin, 1992
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problemInformation Sciences, 1990
- Algorithms for testing the satisfiability of propositional formulaeThe Journal of Logic Programming, 1989
- Resolution vs. cutting plane solution of inference problems: Some computational experienceOperations Research Letters, 1988
- On the probabilistic performance of algorithms for the satisfiability problemInformation Processing Letters, 1986
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- A machine program for theorem-provingCommunications of the ACM, 1962
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960