The SCEAS System
Navigation Menu

Conferences in DBLP

Logic in Computer Science (LICS) (lics)
2000 (conf/lics/2000)

  1. Ronald Fagin
    Logic, Complexity, and Games. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:3- [Conf]
  2. Lars Birkedal
    A General Notion of Realizability. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:7-17 [Conf]
  3. Alexandre Miquel
    A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:18-29 [Conf]
  4. Alex K. Simpson, Gordon D. Plotkin
    Complete Axioms for Categorical Fixed-Point Operators. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:30-41 [Conf]
  5. Steven Lindell, Scott Weinstein
    The Role of Decidability in First Order Separations over Classes of Finite Structures. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:45-50 [Conf]
  6. Achim Blumensath, Erich Grädel
    Automatic Structures. [Citation Graph (1, 0)][DBLP]
    LICS, 2000, pp:51-62 [Conf]
  7. Foto N. Afrati, Hans Leiß, Michel de Rougemont
    Definability and Compression. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:63-73 [Conf]
  8. Samuel R. Buss, Bruce M. Kapron
    Resource-Bounded Continuity and Sequentiality for Type-Two Functionals. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:77-83 [Conf]
  9. Klaus Aehlig, Helmut Schwichtenberg
    A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:84-91 [Conf]
  10. Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
    Approximating Labeled Markov Processes. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:95-106 [Conf]
  11. Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
    Precongruence Formats for Decorated Trace Preorders. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:107-118 [Conf]
  12. E. Allen Emerson, John Havlicek, Richard J. Trefler
    Virtual Symmetry Reduction. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:121-131 [Conf]
  13. Parosh Aziz Abdulla, Aletta Nylén
    Better is Better than Well: On Efficient Verification of Infinite-State Systems. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:132-140 [Conf]
  14. Luca de Alfaro, Thomas A. Henzinger
    Concurrent Omega-Regular Games. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:141-154 [Conf]
  15. Kjell Lemström, Lauri Hella
    Approximate Pattern Matching is Expressible in Transitive Closure Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:157-167 [Conf]
  16. Clifford Bergman, Giora Slutzki
    Computational Complexity of Some Problems Involving Congruences on Algebras. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:168-174 [Conf]
  17. Saul Kripke
    From the Church-Turing Thesis to the First-Order Algorithm Theorem. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:177- [Conf]
  18. Bart Selman
    Satisfiability Testing: Recent Developments and Challenge Problems. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:178- [Conf]
  19. Andrzej S. Murawski, C.-H. Luke Ong
    Dominator Trees and Fast Verification of Proof Nets. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:181-191 [Conf]
  20. Juliusz Chroboczek
    Game Semantics and Subtyping. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:192-203 [Conf]
  21. Vincent Danos, Russell Harmer
    Probabilistic Game Semantics. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:204-213 [Conf]
  22. Erich Grädel, Colin Hirsch, Martin Otto
    Back and Forth between Guarded and Modal Logics. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:217-228 [Conf]
  23. Mark Reynolds
    More Past Glories. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:229-240 [Conf]
  24. Ben C. Moszkowski
    A Complete Axiomatization of Interval Temporal Logic with Infinite Time. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:241-252 [Conf]
  25. Hiroshi Nakano
    A Modality for Recursion. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:255-266 [Conf]
  26. Frédéric Prost
    A Static Calculus of Dependencies for the lambda-Cube. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:267-276 [Conf]
  27. Tatiana Rybina, Andrei Voronkov
    A Decision Procedure for Term Algebras with Queues. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:279-290 [Conf]
  28. Konstantin Korovin, Andrei Voronkov
    A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:291-302 [Conf]
  29. Kenneth L. McMillan
    Some Strategies for Proving Theorems with a Model Checker. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:305-306 [Conf]
  30. Jean-Louis Krivine
    The Curry-Howard Correspondence in Set Theory. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:307-308 [Conf]
  31. Alan Jeffrey, Julian Rathke
    A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:311-321 [Conf]
  32. Gian Luca Cattani, Peter Sewell
    Models for Name-Passing Processes: Interleaving and Causal. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:322-332 [Conf]
  33. Nobuko Yoshida, Matthew Hennessy
    Assigning Types to Processes. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:334-345 [Conf]
  34. Martin Grohe, Luc Segoufin
    On First-Order Topological Queries. [Citation Graph (1, 0)][DBLP]
    LICS, 2000, pp:349-360 [Conf]
  35. Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi
    View-Based Query Processing and Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:361-371 [Conf]
  36. Hongwei Xi
    Imperative Programming with Dependent Types. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:375-387 [Conf]
  37. Jens Palsberg, Tian Zhao
    Efficient and Flexible Matching of Recursive Types. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:388-398 [Conf]
  38. Andrei Voronkov
    How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent Calculi. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:401-412 [Conf]
  39. Guillem Godoy, Robert Nieuwenhuis
    Paramodulation with Built-in Abelian Groups. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:413-424 [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