Sciweavers

4255 search results - page 209 / 851
» On Learning Boolean Functions
Sort
View
ICCD
2001
IEEE
176views Hardware» more  ICCD 2001»
16 years 3 months ago
BDD Variable Ordering by Scatter Search
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
William N. N. Hung, Xiaoyu Song
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
16 years 1 months ago
Exploiting structure in an AIG based QBF solver
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...
Florian Pigorsch, Christoph Scholl
DSD
2007
IEEE
87views Hardware» more  DSD 2007»
16 years 25 days ago
On the Construction of Small Fully Testable Circuits with Low Depth
During synthesis of circuits for Boolean functions area, delay and testability are optimization goals that often contradict each other. Multi-level circuits are often quite small ...
Görschwin Fey, Anna Bernasconi, Valentina Cir...
AB
2007
Springer
16 years 21 days ago
Relating Attractors and Singular Steady States in the Logical Analysis of Bioregulatory Networks
Abstract. In 1973 R. Thomas introduced a logical approach to modeling and analysis of bioregulatory networks. Given a set of Boolean functions describing the regulatory interaction...
Heike Siebert, Alexander Bockmayr
ICALP
2007
Springer
16 years 20 days ago
Complexity of Propositional Proofs Under a Promise
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
Nachum Dershowitz, Iddo Tzameret