1564 search results - page 19 / 313 » Extensions to the Estimation Calculus |
DBPL
1993
Springer
15 years 3 months ago
1993
Springer
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...
100
click to vote
FUZZIEEE
2007
IEEE
15 years 6 months ago
2007
IEEE
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
TACS
1991
Springer
15 years 3 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
101
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed i...
CAV
2010
Springer
15 years 3 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...