Evaluating improvements to modern SAT solvers and comparison of two arbitrary solvers is a challenging and important task. Relative performance of two solvers is usually assessed by running them on a set of SAT instances and comparing the number of solved instances and their running time in a straightforward manner. In this paper we point to shortcomings of this approach and advocate more reliable, statistically founded method-ologies that could discriminate better between good and bad ideas. We present one such methodology and illustrate its application.
<p>C: combination, R: ratio, N/A: non applicable.</p><p>*: statistically significant difference (chi...
Developing state-of-the-art approaches for specific tasks is a major driving force in our research c...
The propositional satisfiability problem (SAT) is one of the most promi-nent and widely studied NP-h...
International audienceEmpirical performance evaluations, in competitions and scientific publications...
The choice of the right problem-solving method, from available methods, is a crucial skill for exper...
The choice of an appropriate problem-solving method, from available methods, is a crucial skill for ...
The choice of the right problem-solving method, from available methods, is a crucial skill for exper...
The last decade has seen a growing interest in solver portfolios, automated solver configuration, an...
International audienceWe are interested in this work in solving efficiently a set of instances of th...
A least-squares solution for the method of paired comparisons is given. The approach provokes a th...
Abstract. Boolean Satisfiability (SAT) solving has dramatically evolved in the past decade and a hal...
The past few years have seen an enormous progress in the performance of Boolean satisfiability (SAT)...
This article introduces alternative techniques to compare algorithmic performance. The first approac...
<p>Comparison of our approach and counterpart algorithms in terms of running time (<i>s</i>).</p
AbstractNew heuristics and strategies have enabled major advancements in SAT solving in recent years...
<p>C: combination, R: ratio, N/A: non applicable.</p><p>*: statistically significant difference (chi...
Developing state-of-the-art approaches for specific tasks is a major driving force in our research c...
The propositional satisfiability problem (SAT) is one of the most promi-nent and widely studied NP-h...
International audienceEmpirical performance evaluations, in competitions and scientific publications...
The choice of the right problem-solving method, from available methods, is a crucial skill for exper...
The choice of an appropriate problem-solving method, from available methods, is a crucial skill for ...
The choice of the right problem-solving method, from available methods, is a crucial skill for exper...
The last decade has seen a growing interest in solver portfolios, automated solver configuration, an...
International audienceWe are interested in this work in solving efficiently a set of instances of th...
A least-squares solution for the method of paired comparisons is given. The approach provokes a th...
Abstract. Boolean Satisfiability (SAT) solving has dramatically evolved in the past decade and a hal...
The past few years have seen an enormous progress in the performance of Boolean satisfiability (SAT)...
This article introduces alternative techniques to compare algorithmic performance. The first approac...
<p>Comparison of our approach and counterpart algorithms in terms of running time (<i>s</i>).</p
AbstractNew heuristics and strategies have enabled major advancements in SAT solving in recent years...
<p>C: combination, R: ratio, N/A: non applicable.</p><p>*: statistically significant difference (chi...
Developing state-of-the-art approaches for specific tasks is a major driving force in our research c...
The propositional satisfiability problem (SAT) is one of the most promi-nent and widely studied NP-h...