Sciweavers

19 search results - page 2 / 4
» jsat 2006
Sort
View
78
Voted
JSAT
2006
73views more  JSAT 2006»
15 years 19 days ago
Impurity: Another Phase Transition of SAT
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
Eliezer L. Lozinskii
86
Voted
JSAT
2006
94views more  JSAT 2006»
15 years 19 days ago
A Note on the Use of Independent Sets for the k-SAT Problem
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
Konstantin Kutzkov
101
Voted
JSAT
2006
87views more  JSAT 2006»
15 years 19 days ago
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
Harri Haanpää, Matti Järvisalo, Pet...
118
Voted
JSAT
2006
114views more  JSAT 2006»
15 years 19 days ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos
104
Voted
JSAT
2006
92views more  JSAT 2006»
15 years 19 days ago
A Translation of Pseudo Boolean Constraints to SAT
This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the p...
Olivier Bailleux, Yacine Boufkhad, Olivier Roussel