3044 search results - page 386 / 609 » Linear logical approximations |
182
click to vote
SAT
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
327
click to vote
GLVLSI
2011
IEEE
14 years 10 months ago
2011
IEEE
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
213
click to vote
EON
2008
15 years 8 months ago
2008
We reuse here the framework, the setting, and the semantic modelling for the automated synthesis of the SWS Challenge Mediator presented in the companion paper [5], and show how to...
217
click to vote
LICS
2012
IEEE
13 years 9 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
181
click to vote
CADE
2002
Springer
16 years 7 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...