Sciweavers

610 search results - page 88 / 122
» Using SAT in QBF
Sort
View
DAC
1998
ACM
14 years 8 months ago
Functional Vector Generation for HDL Models Using Linear Programming and 3-Satisfiability
Abstract-Our strategy for automatic generation of functional vectors is based on exercising selected paths in the given hardware description language (HDL) model. The HDL model des...
Farzan Fallah, Srinivas Devadas, Kurt Keutzer
VLSID
2004
IEEE
91views VLSI» more  VLSID 2004»
14 years 8 months ago
Program Slicing for ATPG-Based Property Checking
This paper presents a novel technique for abstracting designs in order to increase the efficiency of formal property checking. Bounded Model Checking (BMC), using Satisfiability (...
Vivekananda M. Vedula, Whitney J. Townsend, Jacob ...
VLSID
2002
IEEE
83views VLSI» more  VLSID 2002»
14 years 8 months ago
Identifying Redundant Wire Replacements for Synthesis and Verification
We propose the redundancy identification of wire replacement faults. The solutions rely on the satisfiability (SAT) formulation of redundancy identification, augmented with the me...
Katarzyna Radecka, Zeljko Zilic
MEMBRANE
2005
Springer
14 years 1 months ago
Boolean Circuits and a DNA Algorithm in Membrane Computing
In the present paper we propose a way to simulate Boolean gates and circuits in the framework of P systems with active membranes using inhibiting/de-inhibiting rules. This new appr...
Mihai Ionescu, Tseren-Onolt Ishdorj
LPNMR
2004
Springer
14 years 1 months ago
Answer Set Programming with Clause Learning
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
Jeffrey Ward, John S. Schlipf