The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Susumu Hayashi, Yohji Akama
    Limit-Computable Mathematics and Its Applications. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:1- [Conf]
  2. Frank Neven
    Automata, Logic, and XML. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:2-26 [Conf]
  3. Damian Niwinski
    µ-Calculus via Games. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:27-43 [Conf]
  4. Max I. Kanovich
    Bijections between Partitions by Two-Directional Rewriting Techniques. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:44-58 [Conf]
  5. Klaus Aehlig, Felix Joachimski
    On Continuous Normalization. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:59-73 [Conf]
  6. Alexey V. Chernov, Dmitrij P. Skvortsov, Elena Z. Skvortsova, Nikolai K. Vereshchagin
    Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:74-88 [Conf]
  7. Douglas S. Bridges, Hajime Ishihara, Peter Schuster
    Compactness and Continuity, Constructively Revisited. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:89-102 [Conf]
  8. Tobias Nipkow
    Hoare Logics for Recursive Procedures and Unbounded Nondeterminism. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:103-119 [Conf]
  9. Yifeng Chen
    A Fixpoint Theory for Non-monotonic Parallelism. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:120-134 [Conf]
  10. Zoltán Ésik, Hans Leiß
    Greibach Normal Form in Algebraically Complete Semirings. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:135-150 [Conf]
  11. Harry G. Mairson, Xavier Rival
    Proofnets and Context Semantics for the Additives. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:151-166 [Conf]
  12. Joshua S. Hodas, Pablo López, Jeffrey Polakow, Lubomira Stoilova, Ernesto Pimentel
    A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:167-182 [Conf]
  13. Didier Galmiche, Daniel Méry, David J. Pym
    Resource Tableaux. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:183-199 [Conf]
  14. Pietro Cenciarelli
    Configuration Theories. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:200-215 [Conf]
  15. M. Andrew Moshier, Achim Jung
    A Logic for Probabilities in Semantics. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:216-231 [Conf]
  16. Paul Blain Levy
    Possible World Semantics for General Storage in Call-By-Value. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:232-246 [Conf]
  17. Guy McCusker
    A Fully Abstract Relational Model of Syntactic Control of Interference. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:247-261 [Conf]
  18. Jerzy Marcinkowski, Tomasz Truderung
    Optimal Complexity Bounds for Positive LTL Games. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:262-275 [Conf]
  19. Antonín Kucera, Jan Strejcek
    The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:276-291 [Conf]
  20. Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger
    Trading Probability for Fairness. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:292-305 [Conf]
  21. Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko
    A Logic of Probability with Decidable Model-Checking. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:306-321 [Conf]
  22. Thierry Cachat, Jacques Duparc, Wolfgang Thomas
    Solving Pushdown Games with a Sigma3 Winning Condition. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:322-336 [Conf]
  23. Stephan Kreutzer
    Partial Fixed-Point Logic on Infinite Structures. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:337-351 [Conf]
  24. Dietmar Berwanger, Erich Grädel, Giacomo Lenzi
    On the Variable Hierarchy of the Modal µ-Calculus. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:352-366 [Conf]
  25. Daniel Leivant
    Implicit Computational Complexity for Higher Type Functionals. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:367-381 [Conf]
  26. Matthias Baaz, Georg Moser
    On Generalizations of Semi-terms of Particularly Simple Form. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:382-396 [Conf]
  27. Régis Barbanchon, Etienne Grandjean
    Local Problems, Planar Local Problems and Linear Time. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:397-411 [Conf]
  28. Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
    Equivalence and Isomorphism for Boolean Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:412-426 [Conf]
  29. Claudia Faggian
    Travelling on Designs. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:427-441 [Conf]
  30. Claudia Faggian, Martin Hyland
    Designs, Disputes and Strategies. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:442-457 [Conf]
  31. Masahito Hasegawa
    Classical Linear Logic of Implications. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:458-472 [Conf]
  32. Jean Goubault-Larrecq
    Higher-Order Positive Set Constraints. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:473-489 [Conf]
  33. Ichiro Ogata
    A Proof Theoretical Account of Continuation Passing Style. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:490-505 [Conf]
  34. Yoshihiko Kakutani
    Duality between Call-by-Name Recursion and Call-by-Value Iteration. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:506-521 [Conf]
  35. Manfred Schmidt-Schauß, Klaus U. Schulz
    Decidability of Bounded Higher-Order Unification. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:522-536 [Conf]
  36. Herman Geuvers, Gueorgui I. Jojgov
    Open Proofs and Open Terms: A Basis for Interactive Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:537-552 [Conf]
  37. Jean Goubault-Larrecq, Slawomir Lasota, David Nowak
    Logical Relations for Monadic Types. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:553-568 [Conf]
  38. Albert Atserias, Maria Luisa Bonet
    On the Automatizability of Resolution and Related Propositional Proof Systems. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:569-583 [Conf]
  39. Hans de Nivelle
    Extraction of Proofs from the Clausal Normal Form Transformation. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:584-598 [Conf]
  40. Arnold Beckmann
    Resolution Refutations and Propositional Proofs with Height-Restrictions. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:599-612 [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