295 search results - page 38 / 59 » SAT, SMT and Applications |
110
click to vote
DAC
2006
ACM
15 years 7 months ago
2006
ACM
In this paper, we propose a novel technique on mining relationships in a sequential circuit to discover global constraints. In contrast to the traditional learning methods, our mi...
114
click to vote
SAT
2004
Springer
15 years 7 months ago
2004
Springer
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
105
click to vote
AI
2003
Springer
15 years 7 months ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
116
click to vote
CADE
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Symbolic reasoning is in the core of many software development tools such as: bug-finders, test-case generators, and verifiers. Of renewed interest is the use of symbolic...
NIPS
2007
15 years 3 months ago
2007
This paper proposes constraint propagation relaxation (CPR), a probabilistic approach to classical constraint propagation that provides another view on the whole parametric family...