Sciweavers

190 search results - page 2 / 38
» Symmetry and Satisfiability: An Update
Sort
View
DAC
2006
ACM
14 years 10 months ago
Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...
Jin S. Zhang, Alan Mishchenko, Robert K. Brayton, ...
ASPDAC
2008
ACM
150views Hardware» more  ASPDAC 2008»
13 years 11 months ago
Constraint-free analog placement with topological symmetry structure
Abstract-- In analog circuits, blocks need to be placed symmetrically to satisfy the devices matching. Different from the existing constraint-driven approaches, the proposed topolo...
Qing Dong, Shigetoshi Nakatake
DISOPT
2008
88views more  DISOPT 2008»
13 years 9 months ago
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...
Renato Bruni, Andrea Santori
DAC
2008
ACM
14 years 10 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
CADE
2002
Springer
14 years 10 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
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...
Eugene Goldberg