61 search results - page 9 / 13 » On Resolution Proofs for Combinational Equivalence |
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
Kleene algebra with tests (KAT) is an equational system for program veriļ¬cation that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
TLCA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
114
click to vote
EJC
2008
14 years 11 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
110
click to vote
JAIR
2007
14 years 11 months ago
2007
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ļ¬...
PR
2008
14 years 11 months ago
2008
In this paper, we investigate the possibility of using heart sound as a biometric for human identification. The most significant contribution of using heart sound as a biometric is...