Sciweavers

37 search results - page 1 / 8
» Automatic Generation of Propagation Complete SAT Encodings
Sort
View
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
13 years 8 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
CP
2010
Springer
13 years 2 months ago
A Complete Multi-valued SAT Solver
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann
CP
2004
Springer
13 years 7 months ago
Full Dynamic Substitutability by SAT Encoding
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
Steven David Prestwich
CP
2000
Springer
13 years 8 months ago
Automatic Generation of Propagation Rules for Finite Domains
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
Slim Abdennadher, Christophe Rigotti
ACSD
2007
IEEE
109views Hardware» more  ACSD 2007»
13 years 7 months ago
Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
Victor Khomenko