Sciweavers

3 search results - page 1 / 1
» Local Autarkies Searching for the Dynamic Partition of CNF F...
Sort
View
ICTAI
2009
IEEE
13 years 11 months ago
Local Autarkies Searching for the Dynamic Partition of CNF Formulae
In this paper an original dynamic partition of formulae in Conjunctive Normal Form (CNF) is presented. It is based on the autarky concept first introduced by Monien and Speckenme...
Éric Grégoire, Bertrand Mazure, Lakh...
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
14 years 1 months ago
Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Lintao Zh...
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
14 years 1 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah