Sciweavers

113 search results - page 8 / 23
» Solving Boolean Equations Using ROSOP Forms
Sort
View
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
15 years 7 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz
CSC
2008
14 years 11 months ago
The Dirichlet problem for the Laplace equation in a starlike domain
Many applications of Mathematical Physics and Engineering are connected with the Laplacian, however, the most part of BVP relevant to the Laplacian are solved in explicit form onl...
Diego Caratelli, Paolo Emilio Ricci
CSCLP
2004
Springer
15 years 3 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
QEST
2006
IEEE
15 years 4 months ago
Exploring correctness and accuracy of solutions to matrix polynomial equations in queues
Spectral expansion and matrix analytic methods are important solution mechanisms for matrix polynomial equations. These equations are encountered in the steady-state analysis of M...
David Thornley, Harf Zatschler
AUSAI
2004
Springer
15 years 3 months ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...