1410 search results - page 35 / 282 » Proving theorems by reuse |
KBSE
1999
IEEE
14 years 2 months ago
1999
IEEE
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
PPCP
1993
14 years 2 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
JLP
2000
13 years 9 months ago
2000
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We give a novel proof of the existence of Nash equilibria in all finite games without using fixed point theorems or path following arguments. Our approach relies on a new notion i...