17. CSL 2003:
Vienna, Austria
Matthias Baaz, Johann A. Makowsky (Eds.):
Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings.
Lecture Notes in Computer Science 2803 Springer 2003, ISBN 3-540-40801-0 
- Parosh Aziz Abdulla, Ahmed Bouajjani, Julien d'Orso:
Deciding Monotonic Games.
1-14
- Bernhard K. Aichernig:
The Commuting V-Diagram.
15-28
- Jean-Marc Andreoli, Laurent Mazaré:
Concurrent Construction of Proof-Nets.
29-42
- Sergei N. Artëmov:
Back to the Future: Explicit Logic for Computer Science (Invited Lecture).
43
- Manuel Bodirsky, Jaroslav Nesetril:
Constraint Satisfaction with Countable Homogeneous Templates.
44-57
- Ferdinand Börner, Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin:
Quantified Constraints: Algorithms and Complexity.
58-70
- Ahmed Bouajjani:
Verification of Infinite State Systems (Tutorial).
71
- Julian C. Bradfield:
Parity of Imperfection of Fixing Independence.
72-85
- Kai Brünnler:
Atomic Cut Elimination for classical Logic.
86-97
- Bruno Buchberger:
Computational Mathematics, Computational Logic, and Symbolic Computation (Invited Lecture).
98-99
- Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger:
Simple Stochastic Parity Games.
100-113
- Yijia Chen, Jörg Flum:
Machine Characterization of the Classes of the W-Hierarchy.
114-127
- Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani, Laurent Vigneron:
Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions.
128-141
- Stefan S. Dantchev, Søren Riis:
On Relativisation and Complexity Gap.
142-154
- René David, Bruno Guillaume:
Strong Normalization of the Typed gammaws-Calculus.
155-168
- Anuj Dawar, David Richerby:
A Fixed-Point Logic with Symmetric Choice.
169-182
- Jacques Duparc:
Positive Games and Persistent Strategies.
183-196
- Thomas Eiter, Kazuhisa Makino:
Generating All Abductive Explanations for Queries on Propositional Horn Theories.
197-211
- Philipp Gerhardy:
Refined Complexity Analysis of Cut Elimination.
212-225
- Martin Grohe, Nicole Schweikardt:
Comparing the Succinctness of Monadic Query Languages over Finite Trees.
226-240
- John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness.
241-254
- Rosalie Iemhoff:
Towards a Proof System for Admissibility.
255-270
- Detlef Kähler, Thomas Wilke:
Program Complexity of Dynamic LTL Model Checking.
271-284
- Max I. Kanovich, Jacqueline Vauzeilles:
Coping Polynomially with Numerous but Identical Elements within Planning Problems.
285-298
- Bakhadyr Khoussainov:
On Algebraic Specifications of Abstract Data Types.
299-313
- Phokion G. Kolaitis, Jonathan Panttaja:
On the Complexity of Existential Pebble Games.
314-329
- Margarita V. Korovina:
Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test.
330-344
- Lars Kristiansen, Paul J. Voda:
The Surprising Power of Restricted Programs and Gödel's Functionals.
345-358
- Lukasz Krzeszczakowski:
Pebble Games on Trees.
359-371
- James Laird:
Bistability: An Extensional Characterization of Sequentiality.
372-383
- Hans Leiß, Michel de Rougemont:
Automata on Lempel-ziv Compressed Strings.
384-396
- Larisa Maksimova, Andrei Voronkov:
Complexity of Some Problems in Modal and Intuitionistic Calculi.
397-412
- George Metcalfe, Nicola Olivetti, Dov M. Gabbay:
Goal-Directed Calculli for Gödel-Dummett Logics.
413-426
- Ron van der Meyden, Manas Patra:
A Logic for Probability in Quantum Systems.
427-440
- Alexandre Miquel:
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory.
441-454
- Georg Moser, Richard Zach:
The Epsilon Calculus (Tutorial).
455
- Bernhard Reus:
Modular Semantics and Logics of Classes.
456-469
- Marko Samer, Helmut Veith:
Validity of CTL Queries Revisited.
470-483
- Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi:
Calculi of Meta-variables.
484-497
- Lutz Schröder:
Henkin Models of the Partial sigma-Calculus.
498-512
- Christian Urban, Andrew M. Pitts, Murdoch Gabbay:
Nominal Unificaiton.
513-527
- Helmut Veith:
Friends or Foes? Communities in Software Verification (Invited Lecture).
528-529
- Kess F. M. Vermeulen:
More Computation Power for a Denotational Semantics for First Order Logic.
530-543
- Nicolai Vorobjov:
Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture).
544
- Nicolai Vorobjov:
Effective Quantifier Elimination over Real Closed Fields (Tutorial).
545
- Tatiana Rybina, Andrei Voronkov:
Fast Infinite-State Model Checking in Integer-Based Systems (Invited Lecture).
546-573
- Igor Walukiewicz:
Winning Strategies and Synthesis of Controllers (Tutorial).
574
- Yu Zhang, David Nowak:
Logical Relations for Dynamic Name Creation.
575-588
Last update Mon May 20 22:41:11 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
