7 search results - page 2 / 2 » On extracting computations from propositional proofs (a surv... |
FMCAD
2006
Springer
13 years 8 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...