Satisfiability problemCNF formulasLinear equationsFast exponential algorithmsAlgorithmica - We introduce the problem of finding a satisfying assignment to a CNF formula that must further belong to a prescribed input subspace. Equivalent formulations of the problem include......
Complexity of the CNF-satisfiability problem 来自 Semantic Scholar 喜欢 0 阅读量: 50 作者: Bokov, Grigoriy V 摘要: This paper is devoted to the complexity of the Boolean satisfiability problem. We consider a version of this problem, where the Boolean formula is specified in the conjunctive ...
Boolean Satisfiability (SAT) has seen significant use in various tasks in circuit verification in recent years. A key contributor to the efficiency of contemporary SAT solvers is fast deduction using Boolean Constraint Propagation (BCP). This can be efficiently implemented with a Conjunctive Normal For...
In this paper, we take the initiative to study the power of data reductions in the context of random instances of a generic intractable parameterized problem, the weighted d-CNF satisfiability problem. We propose a non-trivial random model for the problem and study the probabilistic behavior of ...
We study random instances of the weighted $d$-CNF satisfiability problem (WEIGHTED $d$-SAT), a generic W[1]-complete problem. A random instance of the problem consists of a fixed parameter $k$ and a random $d$-CNF formula $\weicnf{n}{p}{k, d}$ generated
The aim of this paper is to study the threshold behavior for the satisfiability property of a random κ-XOR-CNF formula or equivalently for the consistency of a random Boolean linear system with κ variables per equation. For κ≥ 3 we show the existence of a sharp threshold f...
We determine the thresholds for the number of variables, number of clauses,number of clause intersection pairs and the maximum clause degree of a k-CNFformula that guarantees satisfiability under the assumption that every twoclauses share at most $\\\alpha$ variables. More formally, we call the...
Robust pcps of proximity, shorter pcps and applications to coding We continue the study of the trade-off between the length of PCP sand their query complexity, establishing the following main results(which refer to proofs of satisfiability of circuits of size n): 1 We present PCPs of length ...
Multi-Cycle Path Detection Based on Propositional Satisfiability with CNF Simplification Using Adaptive Variable Insertion (Special Section on VLSI Design ... Multi-Cycle Path Detection Based on Propositional Satisfiability with CNF Simplification Using Adaptive Variable Insertion (Special Section on VLSI ...
Maaren, H.V., Norden, L.V.: Correlations between horn fractions, satisfiability and solver performance for fixed density random 3-cnf instances. Annals of Math- ematics and Artificial Intelligence 44 (2005) 157- 177Maaren, H.V., Norden, L.V.: Correlations between horn fractions, ...