167 search results - page 2 / 34 » Translation as Weighted Deduction |
APAL
2010
13 years 5 months ago
2010
We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed...
CADE
1990
Springer
13 years 9 months ago
1990
Springer
In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today's automated theorem pro...
TREC
2001
13 years 6 months ago
2001
ICDE
2009
IEEE
14 years 4 days ago
2009
IEEE
—Developing powerful paradigms for programming sensor networks is critical to realize the full potential of sensor networks as collaborative data processing engines. In this arti...
RTA
1999
Springer
13 years 9 months ago
1999
Springer
We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simu...