112 search results - page 22 / 23 » On properties of theories which preclude the existence of un... |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
AGTIVE
2003
Springer
14 years 22 days ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
FOSSACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
EUROCAST
2005
Springer
14 years 1 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
JLP
2006
13 years 7 months ago
2006
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatype...