31 search results - page 6 / 7 » The Boundary Between Decidability and Undecidability for Tra... |
ECAI
1998
Springer
14 years 4 days ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
SEMWEB
2005
Springer
14 years 2 months ago
2005
Springer
A common practice in conceptual modeling is to separate the conceptual from the data model. Although very intuitive, this approach is inadequate for many complex domains, in which...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
ICFP
2012
ACM
11 years 11 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...