Sciweavers

44 search results - page 1 / 9
» Formula Caching in DPLL
Sort
View
75
Voted
COCO
2003
Springer
102views Algorithms» more  COCO 2003»
15 years 4 months ago
Memoization and DPLL: Formula Caching Proof Systems
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
Paul Beame, Russell Impagliazzo, Toniann Pitassi, ...
54
Voted
ECCC
2006
51views more  ECCC 2006»
14 years 11 months ago
Formula Caching in DPLL
Paul Beame, Russell Impagliazzo, Toniann Pitassi, ...
98
Voted
ECCC
2007
99views more  ECCC 2007»
14 years 11 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
82
Voted
DAC
2009
ACM
15 years 12 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
60
Voted
ICALP
2004
Springer
15 years 4 months ago
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsy...