Results 1  10
of
223,070
On the diameter of the set of satisfying assignments in random satisfiable kCNF formulas
, 2008
"... ..."
Counting Satisfiable kCNF Formulas
"... We use basic combinatorial techniques to count the number of satisable boolean formulas given in conjunctive normal form. The intention is to provide information about the relative frequency of boolean functions with respect to statements of a given size. This in turn will provide information about ..."
Abstract
 Add to MetaCart
], and Dubois [Dub91] address kCNF formulas; Creignou and Daude [CD99] consider the XORCNF problem (where instead of literals connected by `or' the are connected by `exclusiveor'). These and others all attack the problem probabilistically. There is also much work on the performance of satisability
On Computing kCNF Formula Properties
 In Theory and Applications of Satisfiability Testing, SpringerVerlag LNCS 2919:330–340
, 2003
"... The latest generation of SAT solvers (e.g. [9, 5]) generally have three key features: randomization of variable selection, backtracking search, and some form of clause learning. We present a simple algorithm with these three features and prove that for instances with constant # (where # is the cl ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
# is the clausetovariable ratio) the algorithm indeed has good worstcase performance, not only for computing SAT/UNSAT but more general properties as well, such as maximum satisfiability and counting the number of satisfying assignments. In general, the algorithm can determine any property
Why almost all satisfiable kcnf formulas are easy, in
 Proc. of the 13th International Conference on Analysis of Algorithms, 2007
"... Why almost all satisfiable kCNF formulas are easy ..."
On smoothed kCNF formulas and the Walksat algorithm
"... In this paper we study the model of εsmoothed kCNF formulas. Starting from an arbitrary instance F with n variables and m = dn clauses, apply the εsmoothing operation of flipping the polarity of every literal in every clause independently at random with probability ε. Keeping ε and k fixed, and l ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
In this paper we study the model of εsmoothed kCNF formulas. Starting from an arbitrary instance F with n variables and m = dn clauses, apply the εsmoothing operation of flipping the polarity of every literal in every clause independently at random with probability ε. Keeping ε and k fixed
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
On the Complexity of Unsatisfiability Proofs for Random kCNF Formulas
 In 30th Annual ACM Symposium on the Theory of Computing
, 1997
"... We study the complexity of proving unsatisfiability for random kCNF formulas with clause density D = m=n where m is number of clauses and n is the number of variables. We prove the first nontrivial general upper bound, giving algorithms that, in particular, for k = 3 produce refutations almost cer ..."
Abstract

Cited by 50 (1 self)
 Add to MetaCart
We study the complexity of proving unsatisfiability for random kCNF formulas with clause density D = m=n where m is number of clauses and n is the number of variables. We prove the first nontrivial general upper bound, giving algorithms that, in particular, for k = 3 produce refutations almost
InclusionExclusion for kCNF Formulas
 Inf. Process. Lett
, 2002
"... We show that the number of satisfying assignments of a kCNF formula is determined uniquely from the numbers of unsatisfying assignments for clausesets of size up to k#+ 2. The information of this size is also shown to be necessary. key words: combinatorial problems; SAT; kCNF formula; counting ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We show that the number of satisfying assignments of a kCNF formula is determined uniquely from the numbers of unsatisfying assignments for clausesets of size up to k#+ 2. The information of this size is also shown to be necessary. key words: combinatorial problems; SAT; kCNF formula
Results 1  10
of
223,070