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
来源
关键词
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
相关论文
共 50 条
  • [21] Constraint satisfaction: random regular k-SAT
    Coja-Oghlan, Amin
    STATISTICAL PHYSICS, OPTIMIZATION, INFERENCE, AND MESSAGE-PASSING ALGORITHMS, 2016, : 231 - 251
  • [22] Strong refutation heuristics for random k-SAT
    Coja-Oghlan, Amin
    Goerdt, Andreas
    Lanka, Andre
    COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (01): : 5 - 28
  • [23] A novel weighting scheme for random k-SAT
    Jun LIU
    Ke XU
    Science China(Information Sciences), 2016, 59 (09) : 5 - 10
  • [24] A novel weighting scheme for random k-SAT
    Liu, Jun
    Xu, Ke
    SCIENCE CHINA-INFORMATION SCIENCES, 2016, 59 (09)
  • [25] Bounds on Threshold of Regular Random k-SAT
    Rathi, Vishwambhar
    Aurell, Erik
    Rasmussen, Lars
    Skoglund, Mikael
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2010, PROCEEDINGS, 2010, 6175 : 264 - 277
  • [26] Strong refutation heuristics for random k-SAT
    Coja-Oghlan, A
    Goerdt, A
    Lanka, A
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 310 - 321
  • [27] The asymptotic order of the random k-SAT threshold
    Achlioptas, D
    Moore, C
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 779 - 788
  • [28] Survey and Belief Propagation on random K-SAT
    Braunstein, A
    Zecchina, R
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 519 - 528
  • [29] Satisfiability threshold of the skewed random k-SAT
    Sinopalnikov, DA
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2005, 3542 : 263 - 275
  • [30] Random k-SAT and the power of two choices
    Perkins, Will
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (01) : 163 - 173