Sciweavers

8 search results - page 2 / 2
» Exact DFA Identification Using SAT Solvers
Sort
View
JAIR
2007
132views more  JAIR 2007»
13 years 5 months ago
New Inference Rules for Max-SAT
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliļ¬...
Chu Min Li, Felip Manyà, Jordi Planes
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
14 years 2 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
ā€” In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...
FMCAD
2000
Springer
13 years 9 months ago
SAT-Based Image Computation with Application in Reachability Analysis
Image computation nds wide application in VLSI CAD, such as state reachability analysis in formal veri cation and synthesis, combinational veri cation, combinational and sequential...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Anubhav G...