1615 search results - page 110 / 323 » Computer science and decision theory |
103
Voted
TLCA
2005
Springer
15 years 6 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 ...
110
Voted
GG
2004
Springer
15 years 6 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 6 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...
FOCS
1997
IEEE
15 years 4 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...
RTA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...