22 search results - page 2 / 5 » Fractal Parallelism: Solving SAT in Bounded Space and Time |
CP
2007
Springer
13 years 11 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
CSR
2007
Springer
13 years 11 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
JAR
2000
13 years 5 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper examines the task of constructing boundedtime self-stabilizing rule-based systems that take their input from an external environment. Bounded response-time and self-sta...