Sciweavers

COMBINATORICS
2004
102views more  COMBINATORICS 2004»
13 years 4 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
JETAI
2008
86views more  JETAI 2008»
13 years 4 months ago
Weighting strategy for non-clausal resolution
Abstract. This paper describes a proof search procedure for propositional nonclausal resolution based on a new weighting strategy that utilizes search methods for propositional sat...
Zbigniew Stachniak, Anton Belov
C3S2E
2010
ACM
13 years 5 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
AAAI
2000
13 years 5 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman
CP
2006
Springer
13 years 8 months ago
Propagation in CSP and SAT
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
Yannis Dimopoulos, Kostas Stergiou
HVC
2005
Springer
160views Hardware» more  HVC 2005»
13 years 10 months ago
Simultaneous SAT-Based Model Checking of Safety Properties
We present several algorithms for simultaneous SAT (propositional satisfiability) based model checking of safety properties. More precisely, we focus on Bounded Model Checking and ...
Zurab Khasidashvili, Alexander Nadel, Amit Palti, ...