4 search results - page 1 / 1 » Solving SAT for CNF Formulas with a One-Sided Restriction on... |
104
Voted
SAT
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
122
click to vote
SAT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
151
Voted
JAR
2006
15 years 3 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
126
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...