1274 search results - page 104 / 255 » New Proofs for |
92
Voted
CSL
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
98
Voted
AAAI
2004
15 years 2 months ago
2004
The concept of consistency has pervaded studies of the constraint satisfaction problem. We introduce two concepts, which are inspired by consistency, for the more general framewor...
101
Voted
SNPD
2004
15 years 2 months ago
2004
A typical problem formal verification faces is the size of the model of a system being verified. Even for a small system, the state space of the model tends to grow exponentially (...
102
Voted
ADCM
2007
15 years 26 days ago
2007
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical diļ¬erentiation. Under an a priori and an a posteriori choice r...
94
Voted
APAL
2006
15 years 24 days ago
2006
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author's thesis of a model with no 2-Aronszajn trees, and also th...