11397 search results - page 57 / 2280 » A Relational Abstraction for Functions |
TPHOL
2003
IEEE
14 years 3 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
ECIR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Traditional retrieval models assume that query terms are independent and rank documents primarily based on various term weighting strategies including TF-IDF and document...
SCP
1998
13 years 9 months ago
1998
Interpretation Using Typed Decision Graphs Laurent Mauborgne LIENS, ´Ecole Normale Sup´erieure, 45 rue d’Ulm, 75230 Paris cedex 05, France Abstract. This article presents a way...
TODS
2002
13 years 9 months ago
2002
g for Dependencies at Multiple Abstraction Levels Toon Calders Raymond T. Ng Jef Wijsen The notion of roll-up dependency (RUD) extends functional dependencies with generalization ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We address in this paper the following two closely related problems: