Considering Circuit Observability Don't Cares in CNF Satisfiability

Boolean Satisfiability (SAT) has seen significant use in various tasks in circuit verification in recent years. A key contributor to the efficiency of contemporary SAT solvers is fast deduction using Boolean Constraint Propagation (BCP). This can be efficiently implemented with a Conjunctive Normal...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Design, Automation and Test in Europe s. 1108 - 1113
Hlavní autoři:	Fu, Zhaohui, Yu, Yinlei, Malik, Sharad
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	Washington, DC, USA IEEE Computer Society 07.03.2005 IEEE
Edice:	ACM Conferences
Témata:	Bridge circuits Business continuity Computer science Computing methodologies > Machine learning > Learning paradigms Computing methodologies > Machine learning > Machine learning approaches > Markov decision processes Data structures Driver circuits Electronic design automation and methodology Hardware > Hardware test Hardware > Hardware validation > Functional verification Hardware > Robustness Logic circuits Observability Performance gain Theory of computation > Logic > Constraint and logic programming Theory of computation > Theory and algorithms for application domains > Machine learning theory > Markov decision processes
ISBN:	9780769522883, 0769522882
ISSN:	1530-1591
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!