The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
The virtual world is comprised of data items related to each other in a variety of contexts. Often such relations can be represented as graphs that evolve over time. Examples incl...
Olga Goussevskaia, Michael Kuhn 0002, Roger Watten...
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...