Sciweavers

Share
CSL
2008
Springer
10 years 5 days ago
The Ackermann Award 2008
Johann A. Makowsky, Damian Niwinski
CSL
2008
Springer
10 years 5 days ago
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
Ian Hodkinson, Angelo Montanari, Guido Sciavicco
CSL
2008
Springer
10 years 5 days ago
Quantitative Game Semantics for Linear Logic
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
Ugo Dal Lago, Olivier Laurent
CSL
2008
Springer
10 years 5 days ago
The Descriptive Complexity of Parity Games
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
Anuj Dawar, Erich Grädel
CSL
2008
Springer
10 years 5 days ago
Extensional Uniformity for Boolean Circuits
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
Pierre McKenzie, Michael Thomas, Heribert Vollmer
CSL
2008
Springer
10 years 5 days ago
Superposition for Fixed Domains
Matthias Horbach, Christoph Weidenbach
CSL
2008
Springer
10 years 5 days ago
The Computability Path Ordering: The End of a Quest
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
Frédéric Blanqui, Jean-Pierre Jouann...
CSL
2008
Springer
10 years 5 days ago
Model Transformations in Decidability Proofs for Monadic Theories
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (g...
Wolfgang Thomas
CSL
2008
Springer
10 years 5 days ago
On Isomorphisms of Intersection Types
The study of type isomorphisms for different -calculi started over twenty years ago, and a very wide body of knowledge has been established, both in terms of results and in terms o...
Mariangiola Dezani-Ciancaglini, Roberto Di Cosmo, ...
books