Sciweavers

851 search results - page 51 / 171
» Inaccessibility in Decision Procedures
Sort
View
CADE
2005
Springer
14 years 8 months ago
A Combination Method for Generating Interpolants
We present a combination method for generating interpolants for a class of first-order theories. Using interpolant-generation procedures for individual theories as black-boxes, our...
Greta Yorsh, Madanlal Musuvathi
SAT
2005
Springer
123views Hardware» more  SAT 2005»
14 years 1 months ago
Bounded Model Checking with QBF
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
Nachum Dershowitz, Ziyad Hanna, Jacob Katz
ISQED
2002
IEEE
175views Hardware» more  ISQED 2002»
14 years 18 days ago
On the Relation between SAT and BDDs for Equivalence Checking
State-of-the-art verification tools are based on efficient operations on Boolean formulas. Traditional manipulation techniques are based on Binary Decision Diagrams (BDDs) and SAT...
Sherief Reda, Rolf Drechsler, Alex Orailoglu
COST
2009
Springer
133views Multimedia» more  COST 2009»
14 years 2 months ago
Handwritten Signature On-Card Matching Performance Testing
This paper presents equipment and procedures for on-card (in-situ) performance testing of biometric on-card comparison implementations using pre-existing databases of biometric sam...
Olaf Henniger, Sascha Müller
UAI
1996
13 years 9 months ago
A Graph-Theoretic Analysis of Information Value
We derive qualitative relationships about the informationalrelevance of variables in graphical decision models based on a consideration of the topology of the models. Speci cally,...
Kim-Leng Poh, Eric Horvitz