31 search results - page 4 / 7 » Strategy Parallelism in Automated Theorem Proving |
TPHOL
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
ALP
1990
Springer
15 years 1 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
81
Voted
BIRTHDAY
2006
Springer
15 years 1 months ago
2006
Springer
Sometimes it is pragmatically useful to prove a theorem by contradiction rather than finding a direct proof. Some reductio ad absurdum arguments have made mathematical history and ...
CAV
2008
Springer
14 years 11 months ago
2008
Springer
The growing design-productivity gap has made designers shift toward using high-level languages like C, C++ and Java to do system-level design. High-Level Synthesis (HLS) is the pro...
AAAI
1993
14 years 10 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...