610 search results - page 8 / 122 » Using SAT in QBF |
AIPS
2006
13 years 9 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
DATE
2008
IEEE
13 years 9 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
JSAT
2008
13 years 7 months ago
2008
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based o...
JSAT
2006
13 years 7 months ago
2006
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third in a series of non-competitive events established with the ai...