On SAT instance classes and a method for reliable performance experiments with SAT solvers

Annals of Mathematics and Artificial Intelligence

Volumn 43, Issue 1-4, 2005, Pages 1-34

  Brglez, Franc ^a   Li, Xiao Yu ^a   Stallmann, Matthias F ^a  

^a North Carolina State University   (United States)

Author keywords

conjunctive normal form; equivalence classes; experimental design; exponential and heavy tail distributions; reliability function; satisfiability

Indexed keywords

EID: 10344265045     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-005-0417-5     Document Type: Article

References (10)

1. S. Baase and A. Van Gelder, Computer Algorithms, 3rd edition (Addison-Wesley, Reading, MA, 2000).
2. G.E.P. Box, W.G. Hunter and J.S. Hunter, Statistics for Experimenters: An Introduction to Design, Data Analysis and Model Building (Wiley, 1978).
3. F. Brglez, Design of experiments to evaluate CAD algorithms: which improvements are due to improved heuristic and which are merely due to chance?, Technical Report 1998-TR@CBL-04-Brglez, CBL, CS Dept., NCSU, Raleigh, NC (April 1998). Also available at http://www.cbl.ncsu. edu/publications/#1998-TR@CBL-04- Brglez.
4. F. Brglez and R. Drechsler, Design of experiments in CAD: Context and new data sets for ISCAS'99, in: Proc. of IEEE 1999 International Symposium on Circuits and Systems - ISCAS'99 (May 1999). A reprint is accessible from http://www.cbl.ncsu.edu/publications/#I999-ISCAS-Brglez.
5. F. Brglez, X.Y. Li and M. Stallmann, The role of a skeptic agent in testing and benchmarking of SAT algorithms, in: Proc. of Fifth International Symposium on the Theory and Applications of Satisfiability Testing, http://www.cbl.ncsu.edu/publications/ (May 2002).
6. F. Brglez, M.F. Stallmann and X.Y. Li, SATbed - An environment for reliable performance experiments with SAT instance classes and algorithms, in: Proc. of SAT 2003, Sixth International Symposium on the Theory and Applications of Satisfiability Testing, Portofino, Italy, ed. S.M. Ligure (May 5-8, 2003). A revised version available at http://www.cbl.ncsu.edu/publications/.
7. F. Brglez, M. Stallmann and X.Y. Li, SATbed home page: A tutorial, a user guide, a software archive, archives of SAT instance classes and experimental results, http://www.cbl.ncsu.edu/OpenExperiments/SAT/ (2003).
8. C. Coarfa, D.D. Demopoulos, A.S.M. Aguirre, D. Subramanian and M.Y. Vardi, Random 3-SAT: The plot thickens, in: Principles and Practice of Constraint Programming (2000) pp. 143-159.
9. S. Cook and D. Mitchell, Finding hard instances of the satisfiability problem: A survey, http:// dream.dai.ed.ac.uk/group/tw/sat/sat-survey3.ps (1997).
10. E.L. Crow, F.A. Davis and M.W. Maxfield, Statistics Manual (Dover, New York, 1960).