174 search results - page 9 / 35 » Monotonicity in Calculational Proofs |
CSL
2004
Springer
14 years 23 days ago
2004
Springer
Interpretation of Proofs: Classical Propositional Calculus Martin Hyland DPMMS, Centre for Mathematical Sciences, University of Cambridge, England Representative abstract interpret...
TOC
2010
13 years 2 months ago
2010
: We give a simple proof of the OSSS inequality (O'Donnell, Saks, Schramm, Servedio, FOCS 2005). The inequality states that for any decision tree T calculating a Boolean funct...
GOSLER
1995
13 years 11 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
ETFA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— This article presents some results about schedulability analysis of tasks with offsets also known as transactions, in the particular case of monotonic transactions. The...
VLDB
2004
ACM
14 years 21 days ago
2004
ACM
We study the fundamental limitations of relational algebra (RA) and SQL in supporting sequence and stream queries, and present effective query language and data model enrichments ...