Branching Process approach for 2-SAT thresholds
نویسندگان
چکیده
It is well known that, as n tends to infinity, the probability of satisfiability for a random 2-SAT formula on n variables, where each clause occurs independently with probability α/2n, exhibits a sharp threshold at α = 1. We provide a simple conceptual proof of this fact based on branching process arguments. We also study a generalized 2-SAT model in which each clause occurs independently but with probability αi/2n where i ∈ {0, 1, 2} is the number of positive literals in that clause. We use 2-type branching process arguments to determine the satisfiability threshold for this model in terms of the maximum eigenvalue of the branching matrix.
منابع مشابه
Conflict-based Selection of Branching Rules in SAT-Algorithms
The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer science. The application of SAT solvers in VLSI CAD has become of major interest. The most popular SAT algorithms are based on the well known Davis-Putnam procedure. There, to guide the search, a branching rule is applied for selecting and assigning unassigned variable...
متن کاملImproving Propositional Satisfiability Algorithms by Dynamic Selection of Branching Rules
The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer science. The most popular SAT algorithms are based on the well known Davis-Putnam procedure. There, to guide search, a branching rule is applied for selecting still unassigned variables and computing an assignment to this variable. Additionally, conflict analysis metho...
متن کاملConflict-Based Selection of Branching Rules
We propose an adaptive framework for branching rule selection that is based on a set of branching rules. Each branching rule is attached a preference value that is dynamically adapted with respect to conflict analysis. Thus, our approach brings together two essential features of modern SAT algorithms which were traditionally independent from each other. Experimental results show the feasibility...
متن کاملThe Impact of Branching Heuristics in Propositional Satisfiability Algorithms
This paper studies the practical impact of the branching heuristics used in Propositional Satisfiability (SAT) algorithms, when applied to solving real-world instances of SAT. In addition, different SAT algorithms are experimentally evaluated. The main conclusion of this study is that even though branching heuristics are crucial for solving SAT, other aspects of the organization of SAT algorith...
متن کاملThe Effect of Structural Branching on the Efficiency of Clause Learning SAT Solving
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured instances of propositional satisfiability (SAT). Experimental case studies in specific problem domains have shown that in, some cases, SAT solvers benefit from structure-based limitations on which variables the solver is allowed to branch. Mainly, the focus has been on input (or ...
متن کامل