Results 1  10
of
669
Generalizations of matched CNF formulas
, 2002
"... Abstract. A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisfiable and can be recognized efficiently by matching algorithms. We generalize this concept and cover clauses ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract. A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisfiable and can be recognized efficiently by matching algorithms. We generalize this concept and cover clauses
Uunsatisfiable CNF formulas
, 2008
"... A Boolean formula in a conjunctive normal form is called a (k, s)formula if every clause contains exactly k variables and every variable occurs in at most s clauses. We show that there are unsatisfiable (k, 4 · 2k k)CNF formulas. ..."
Abstract
 Add to MetaCart
A Boolean formula in a conjunctive normal form is called a (k, s)formula if every clause contains exactly k variables and every variable occurs in at most s clauses. We show that there are unsatisfiable (k, 4 · 2k k)CNF formulas.
Verification of proofs of unsatisfiability for CNF formulas
"... As SATalgorithms become more and more complex, there is little chance of writing a SATsolver that is free of bugs. So it is of great importance to be able to verify the information returned by a SATsolver. If the CNF formula to be tested is satisfiable, solution verification is trivial and can be ..."
Abstract

Cited by 55 (0 self)
 Add to MetaCart
As SATalgorithms become more and more complex, there is little chance of writing a SATsolver that is free of bugs. So it is of great importance to be able to verify the information returned by a SATsolver. If the CNF formula to be tested is satisfiable, solution verification is trivial and can
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
Verification of Proofs of Unsatisfiability for CNF formulas
"... As SATalgorithms become more and more complex, there is little chance of writing a SATsolver that is free of bugs. So it is of great importance to be able to verify the information returned by a SATsolver. If the CNF formula to be tested is satisfiable, solution verification is trivial and can be ..."
Abstract
 Add to MetaCart
As SATalgorithms become more and more complex, there is little chance of writing a SATsolver that is free of bugs. So it is of great importance to be able to verify the information returned by a SATsolver. If the CNF formula to be tested is satisfiable, solution verification is trivial and can
Clause Elimination Procedures for CNF Formulas
, 2010
"... We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedures such as tautology, subsumption, and blocked clause elimination, we introduce novel elimination procedures based on hidden and as ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedures such as tautology, subsumption, and blocked clause elimination, we introduce novel elimination procedures based on hidden
On the Satisfiability and Maximum Satisfiability of Random 3CNF Formulas
"... We analyze the pure literal rule heuristic for computing a satisfying assignment to a random 3CNF formula with n variables. We show that the pure literal rule by itself nds satisfying assignments for almost all 3CNF formulas with up to 1:63n clauses, but it fails for more than 1:7n clauses. As an ..."
Abstract

Cited by 92 (6 self)
 Add to MetaCart
We analyze the pure literal rule heuristic for computing a satisfying assignment to a random 3CNF formula with n variables. We show that the pure literal rule by itself nds satisfying assignments for almost all 3CNF formulas with up to 1:63n clauses, but it fails for more than 1:7n clauses
Circuit Based Encoding of CNF formula
"... Abstract. In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially translate any formula in conjunctive normal form (CNF) to a circuit sat representation (a conjunction of gates ..."
Abstract
 Add to MetaCart
Abstract. In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially translate any formula in conjunctive normal form (CNF) to a circuit sat representation (a conjunction
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
Results 1  10
of
669