WG
2009
Springer
14 years 6 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
WG
2009
Springer
14 years 6 months ago
2009
Springer
LICS
2009
IEEE
14 years 6 months ago
2009
IEEE
We provide in this article two characterisation results, describing exactly which terms verify the dinaturality diagram, in Church-style system F and in Curry-style system F. The ...
LICS
2009
IEEE
14 years 6 months ago
2009
IEEE
LICS
2009
IEEE
14 years 6 months ago
2009
IEEE
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
LICS
2009
IEEE
14 years 6 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
LICS
2009
IEEE
14 years 6 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
LICS
2009
IEEE
14 years 6 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
LICS
2009
IEEE
14 years 6 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
LICS
2009
IEEE
14 years 6 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...