Some Pitfalls for Experimenters with Random SAT
نویسندگان
چکیده
We consider the use of random CNF formulas in evaluating the performance of SAT testing algorithms, and in particular the role that the phase transition phenomenon plays in this use. Examples from the literature illustrate the importance of understanding the properties of formula distributions prior to designing an experiment. We expect this to be of increasing importance in the eld.
منابع مشابه
Locality and Hard SAT-Instances
In this note we construct a family of SAT-instance based on Eulerian graphs which are aimed at being hard for resolution based SAT-solvers. We discuss some experiments made with instances of this type and how a solver can try to avoid at least some of the pitfalls presented by these instances. Finally we look at how the density of subformulae can influence the hardness of SAT instances.
متن کاملA Cohort of Self-Experimenters: Lessons Learned from N=1 Personal Informatics Experiments
Personal informatics, the trend in collecting and analyzing data about one’s own self, has been heavily influenced by the involvement of technology in our daily lives. In this paper we aim to understand what happens when novice self-experimenters are provided with a structured lesson in experimental design. We conducted a month-long study on self-experimentation, where twenty students in a semi...
متن کاملThe Optimization of Magnetic Resonance Imaging Pulse Sequences in Order to Better Detection of Multiple Sclerosis Plaques
Background and objective: Magnetic resonance imaging (MRI) is the most sensitive technique to detect multiple sclerosis (MS) plaques in central nervous system. In some cases, the patients who were suspected to MS, Whereas MRI images are normal, but whether patients don’t have MS plaques or MRI images are not enough optimized enough in order to show MS plaques? The aim of the current study is ...
متن کاملShould Algorithms for Random SAT and Max-SAT Be Different?
We analyze to what extent the random SAT and Max-SAT problems differ in their properties. Our findings suggest that for random k-CNF with ratio in a certain range, Max-SAT can be solved by any SAT algorithm with subexponential slowdown, while for formulae with ratios greater than some constant, algorithms under the random walk framework require substantially different heuristics. In light of th...
متن کاملVerifying Propositional Unsatisfiability: Pitfalls to Avoid
The importance of producing a certi cate of unsatis ability is increasingly recognized for high performance propositional satis ability solvers. The leading solvers develop a con ict graph as the basis for deriving (or \learning") new clauses. Extracting a resolution derivation from the con ict graph is theoretically straightforward, but it turns out to have some surprising practical pitfalls (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Artif. Intell.
دوره 81 شماره
صفحات -
تاریخ انتشار 1996