1717 search results - page 240 / 344 » A Computable Spectral Theorem |
152
click to vote
CADE
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
156
click to vote
TABLEAUX
1999
Springer
15 years 9 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
153
click to vote
QCQC
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
198
click to vote
COCO
1997
Springer
15 years 9 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
168
click to vote
ICML
1989
IEEE
15 years 9 months ago
1989
IEEE
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...