1653 search results - page 177 / 331 » Computer science and game theory |
TLCA
2005
Springer
15 years 4 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
GG
2004
Springer
15 years 4 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
GI
2004
Springer
15 years 4 months ago
2004
Springer
: In this paper we describe one of the authors’ experiences working for an IT service provider in an SME environment. The paper starts with an analysis of the factors typical for...
STACS
2001
Springer
15 years 3 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
FOCS
1997
IEEE
15 years 2 months ago
1997
IEEE
The problem of maintaining data that arrives continuously over time is increasingly prevalent in databases and digital libraries. Building on a model for sliding-window indices de...