112 search results - page 19 / 23 » Ordered Binary Decision Diagrams and the Davis-Putnam Proced... |
AUSAI
2004
Springer
14 years 1 months ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
AGP
1998
IEEE
14 years 3 days ago
1998
IEEE
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
ICCAD
1994
IEEE
13 years 12 months ago
1994
IEEE
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
DAC
2010
ACM
13 years 11 months ago
2010
ACM
State-of-the-art automatic reliability analyses as used in system-level design approaches mainly rely on Binary Decision Diagrams (BDDs) and, thus, face two serious problems: (1) ...