An Efficient Approach to Solving Random k-sat Problems

被引:0
作者
Gilles Dequen
Olivier Dubois
机构
[1] LaRIA,
[2] Université de Picardie Jules Verne,undefined
[3] LIP6,undefined
[4] CNRS-Université Paris 6,undefined
来源
Journal of Automated Reasoning | 2006年 / 37卷
关键词
satisfiability; solving; heuristic;
D O I
暂无
中图分类号
学科分类号
摘要
Proving that a propositional formula is contradictory or unsatisfiable is a fundamental task in automated reasoning. This task is coNP-complete. Efficient algorithms are therefore needed when formulae are hard to solve. Random \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$k-$\end{document}sat formulae provide a test-bed for algorithms because experiments that have become widely popular show clearly that these formulae are consistently difficult for any known algorithm. Moreover, the experiments show a critical value of the ratio of the number of clauses to the number of variables around which the formulae are the hardest on average. This critical value also corresponds to a ‘phase transition’ from solvability to unsolvability. The question of whether the formulae located around or above this critical value can efficiently be proved unsatisfiable on average (or even for a.e. formula) remains up to now one of the most challenging questions bearing on the design of new and more efficient algorithms. New insights into this question could indirectly benefit the solving of formulae coming from real-world problems, through a better understanding of some of the causes of problem hardness. In this paper we present a solving heuristic that we have developed, devoted essentially to proving the unsatisfiability of random \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$k-$\end{document}sat formulae and inspired by recent work in statistical physics. Results of experiments with this heuristic and its evaluation in two recent sat competitions have shown a substantial jump in the efficiency of solving hard, unsatisfiable random \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$k-$\end{document}sat formulae.
引用
收藏
页码:261 / 276
页数:15
相关论文
共 27 条
[1]  
Beame P.(2002)The efficiency of resolution and Davis–Putnam procedures SIAM 31 1048-1075
[2]  
Karp R.(1999)Length of prime implicants and number of solutions of random CNF formulae Theor. Comp. Sci. 215 1-30
[3]  
Pitassi T.(2004)Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances Theor. Comp. Sci. 320 345-372
[4]  
Saks M.(1962)A machine program for theorem-proving J. Assoc. Comput. Mach. 5 394-397
[5]  
Boufkhad Y.(1997)A general upper bound for the satisfiability threshold of random J. Algorithms 24 395-420
[6]  
Dubois O.(1996)-SAT formulae Artif. Intell. 81 183-198
[7]  
Cocco S.(2003)Hard random 3-SAT problems and the Davis–Putnam procedure Comb. Probab. Comput. 12 245-267
[8]  
Monasson R.(2000)Some results on random unsatisfiable k-Sat instances and approximation algorithms applied to random structures J. Autom. Reason. 24 421-481
[9]  
Davis M.(2002)Local search algorithms for SAT: An empirical evaluation Science 297 812-815
[10]  
Logemann G.(1999)Analytic and algorithmic solutions of random satisfiability problems J. Log. Comput. 9 501-513