233 search results - page 30 / 47 » Applications of Polytypism in Theorem Proving |
VMCAI
2004
Springer
15 years 5 months ago
2004
Springer
The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based...
106
click to vote
DGCI
2003
Springer
15 years 5 months ago
2003
Springer
In order to make image analysis methods more reliable it is important to analyse to what extend shape information is preserved during image digitization. Most existing approaches t...
109
click to vote
TABLEAUX
1999
Springer
15 years 4 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...
QCQC
1998
Springer
15 years 3 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...
ICML
1989
IEEE
15 years 3 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...