610 search results - page 91 / 122 » Using SAT in QBF |
ITS
1998
Springer
15 years 1 months ago
1998
Springer
In some domains, including those requiring natural language understanding, we cannot build a system that can complete the entire task. One way to deal with such cases is to encode ...
DISOPT
2008
14 years 9 months ago
2008
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...
90
Voted
JALC
2006
14 years 9 months ago
2006
Minimal parallelism was recently introduced [3] as a way of using the rules of a P system: from each set of applicable rules associated to a membrane, at least one rule must be ap...
JSAT
2008
14 years 9 months ago
2008
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...
73
Voted
CP
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...