Sciweavers

25 search results - page 1 / 5
» A new hybrid solution to boost SAT solver performance
Sort
View
DATE
2007
IEEE
80views Hardware» more  DATE 2007»
13 years 11 months ago
A new hybrid solution to boost SAT solver performance
Due to the widespread demands for efficient SAT solvers in Electronic Design Automation applications, methods to boost the performance of the SAT solver are highly desired. We pr...
Lei Fang, Michael S. Hsiao
JSAT
2008
63views more  JSAT 2008»
13 years 5 months ago
Whose side are you on? Finding solutions in a biased search-tree
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
Marijn Heule, Hans van Maaren
SAT
2005
Springer
134views Hardware» more  SAT 2005»
13 years 10 months ago
A Clause-Based Heuristic for SAT Solvers
We propose a new decision heuristic for DPLL-based propositional SAT solvers. Its essence is that both the initial and the conflict clauses are arranged in a list and the next deci...
Nachum Dershowitz, Ziyad Hanna, Alexander Nadel
FMCAD
2004
Springer
13 years 9 months ago
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
Orna Grumberg, Assaf Schuster, Avi Yadgar
AIPS
2008
13 years 7 months ago
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Katrina Ray, Matthew L. Ginsberg