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

DOI10.1007/s10472-005-0417-5zbMath1100.68575OpenAlexW4251990699MaRDI QIDQ1777389

Franc Brglez, Xiao Yu Li, Matthias F. M. Stallmann

Publication date: 13 May 2005

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-005-0417-5

zbMATH Keywords

reliability functionequivalence classessatisfiabilityexperimental designconjunctive normal formexponential and heavy-tail distributions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reliability and life testing (62N05)

Related Items

Careful Ranking of Multiple Solvers with Timeouts and Ties ⋮ Vampire getting noisy: Will random bits help conquer chaos? (system description)

Uses Software

• UnitWalk
• SatEx
• SATLIB
• SATO
• QingTing1
• SATIRE
• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of blocks-world planning
• Design of experiments and evaluation of BDD ordering heuristics
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• Testing heuristics: We have it all wrong
• Generating hard satisfiability problems
• Needed: An Empirical Science of Algorithms
• Inference for Exponential Order Statistic Models Based on an Integrated Likelihood Function
• A Brief History of Generative Models for Power Law and Lognormal Distributions
• SATO: An efficient propositional prover
• Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
• Theory and Applications of Satisfiability Testing
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving