Sciweavers

261 search results - page 1 / 53
» SAT-Based Algorithms for Logic Minimization
Sort
View
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
13 years 9 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
ITC
2003
IEEE
148views Hardware» more  ITC 2003»
13 years 10 months ago
HyAC: A Hybrid Structural SAT Based ATPG for Crosstalk
As technology evolves into the deep sub-micron era, signal integrity problems are growing into a major challenge. An important source of signal integrity problems is the crosstalk...
Xiaoliang Bai, Sujit Dey, Angela Krstic
IJCAI
2007
13 years 6 months ago
The Logic Behind Weighted CSP
We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an orig...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
AAAI
2000
13 years 6 months ago
A Demand-Driven Algorithm for Generating Minimal Models
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...
Rachel Ben-Eliyahu-Zohary
ICCD
2003
IEEE
177views Hardware» more  ICCD 2003»
14 years 1 months ago
SAT-Based Algorithms for Logic Minimization
This paper introduces a new method for two-level logic minimization. Unlike previous approaches, the new method uses a SAT solver as an underlying engine. While the overall minimi...
Samir Sapra, Michael Theobald, Edmund M. Clarke