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 条
  • [41] On the complexity of k-SAT
    Impagliazzo, R
    Paturi, R
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 62 (02) : 367 - 375
  • [42] Random k-SAT:: the limiting probability for satisfiability for moderately growing k
    Coja-Oghlan, Amin
    Frieze, Alan
    ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
  • [43] Improving configuration checking for satisfiable random k-SAT instances
    Abrame, Andre
    Habet, Djamal
    Toumi, Donia
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2017, 79 (1-3) : 5 - 24
  • [44] Satisfiability and Algorithms for Non-uniform Random k-SAT
    Omelchenko, Oleksii
    Bulatov, Andrei A.
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 3886 - 3894
  • [45] Analysis of two simple heuristics on a random instance of k-SAT
    Frieze, A
    Suen, S
    JOURNAL OF ALGORITHMS, 1996, 20 (02) : 312 - 355
  • [46] Threshold values of random K-SAT from the cavity method
    Mertens, S
    Mézard, M
    Zecchina, R
    RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (03) : 340 - 373
  • [47] Recognizing more unsatisfiable random k-sat instances efficiently
    Friedman, J
    Goerdt, A
    Krivelevich, M
    SIAM JOURNAL ON COMPUTING, 2005, 35 (02) : 408 - 430
  • [48] The Number of Satisfying Assignments of Random Regular k-SAT Formulas
    Coja-Oghlan, Amin
    Wormald, Nick
    COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (04): : 496 - 530
  • [49] Counting good truth assignments of random k-SAT formulae
    Montanari, Andrea
    Shah, Devavrat
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 1255 - +
  • [50] Improving configuration checking for satisfiable random k-SAT instances
    André Abramé
    Djamal Habet
    Donia Toumi
    Annals of Mathematics and Artificial Intelligence, 2017, 79 : 5 - 24