The SCEAS System
Navigation Menu

Conferences in DBLP

Conference for Computer Science Logic (CSL) (csl)
2003 (conf/csl/2003)

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