1274 search results - page 104 / 255 » New Proofs for |
CSL
2008
Springer
13 years 12 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 ...
AAAI
2004
13 years 11 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...
SNPD
2004
13 years 11 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 (...
ADCM
2007
13 years 10 months 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...
APAL
2006
13 years 10 months 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...