610 search results - page 37 / 122 » Using SAT in QBF |
129
click to vote
TABLEAUX
2005
Springer
15 years 10 months ago
2005
Springer
Unit propagation is one of the most important techniques of efficient SAT solvers. Unfortunately, this technique is not directly applicable to first-order clausal tableaux. We sho...
127
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
154
Voted
SAT
2009
Springer
15 years 11 months ago
2009
Springer
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
136
click to vote
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
150
click to vote
KR
2010
Springer
15 years 9 months ago
2010
Springer
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial eq...