The SCEAS System
Navigation Menu

Conferences in DBLP

Logic in Computer Science (LICS) (lics)
1999 (conf/lics/99)

  1. Harvey Friedman
    Some Decision Problems of Enormous Complexity. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:2-13 [Conf]
  2. Erich Grädel, Eric Rosen
    Two-Variable Descriptions of Regularity. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:14-23 [Conf]
  3. Harald Ganzinger, Christoph Meyer, Margus Veanes
    The Two-Variable Guarded Fragment with Transitive Relations. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:24-34 [Conf]
  4. Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong
    Logics with Aggregate Operators. [Citation Graph (1, 0)][DBLP]
    LICS, 1999, pp:35-44 [Conf]
  5. Erich Grädel, Igor Walukiewicz
    Guarded Fixed Point Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:45-54 [Conf]
  6. Alan Jeffrey, Julian Rathke
    Towards a Theory of Bisimulation for Local Names. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:56-66 [Conf]
  7. Marcelo P. Fiore, Gian Luca Cattani, Glynn Winskel
    Weak Bisimulation and Open Maps. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:67-76 [Conf]
  8. Alex K. Simpson
    Elementary Axioms for Categories of Classes. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:77-85 [Conf]
  9. Anindya Banerjee, Nevin Heintze, Jon G. Riecke
    Region Analysis and the Polymorphic Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:88-97 [Conf]
  10. Serenella Cerrito, Delia Kesner
    Pattern Matching as Cut Elimination. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:98-108 [Conf]
  11. Antonio Bucciarelli, Silvia De Lorenzis, Adolfo Piperno, Ivano Salvo
    Some Computational Properties of Intersection Types. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:109-118 [Conf]
  12. A. J. Kfoury, Santiago M. Pericás-Geertsen
    Type Inference for Recursive Definitions. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:119-129 [Conf]
  13. Joseph Y. Halpern, Nir Friedman
    Plausibility Measures and Default Reasoning: An Overview. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:130-135 [Conf]
  14. Dario Colazzo, Giorgio Ghelli
    Subtyping Recursive Types in Kernel Fun. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:137-146 [Conf]
  15. Sophia Drossopoulou, Susan Eisenbach, David Wragg
    A Fragment Calculus — Towards a Model of Separate Compilation, Linking and Binary Compatibility. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:147-156 [Conf]
  16. Michele Boreale, Rocco De Nicola, Rosario Pugliese
    Proof Techniques for Cryptographic Processes. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:157-166 [Conf]
  17. Dexter Kozen
    On Hoare Logic and Kleene Algebra with Tests. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:167-172 [Conf]
  18. Michael Marz, Alexander Rohr, Thomas Streicher
    Full Abstraction and Universality via Realisability. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:174-182 [Conf]
  19. David J. Pym
    On Bunched Predicate Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:183-192 [Conf]
  20. Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi
    Abstract Syntax and Variable Binding. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:193-202 [Conf]
  21. Martin Hofmann
    Semantical Analysis of Higher-Order Abstract Syntax. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:204-213 [Conf]
  22. Murdoch Gabbay, Andrew M. Pitts
    A New Approach to Abstract Syntax Involving Binders. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:214-224 [Conf]
  23. Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio
    Paramodulation with Non-Monotonic Orderings. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:225-233 [Conf]
  24. Harish Devarajan, Dominic J. D. Hughes, Gordon D. Plotkin, Vaughan R. Pratt
    Full Completeness of the Multiplicative Linear Logic of Chu Spaces. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:234-242 [Conf]
  25. Roberto Bruni, Ugo Montanari
    Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:246-265 [Conf]
  26. Jan Johannsen
    Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:268-274 [Conf]
  27. Albert Atserias, Phokion G. Kolaitis
    First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:275-284 [Conf]
  28. Joachim Niehren, Martin Müller, Jean-Marc Talbot
    Entailment of Atomic Set Constraints is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:285-294 [Conf]
  29. Harald Ganzinger, Hans de Nivelle
    A Superposition Decision Procedure for the Guarded Fragment with Equality. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:295-304 [Conf]
  30. Georg Gottlob, Reinhard Pichler
    Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:306-315 [Conf]
  31. Leonid Libkin
    Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:316-325 [Conf]
  32. Matthias Ruhl
    Counting and Addition Cannot Express Deterministic Transitive Closure. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:326-334 [Conf]
  33. E. Allen Emerson, Richard J. Trefler
    Parametric Quantitative Temporal Reasoning. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:336-343 [Conf]
  34. Augustin Baziramwabo, Pierre McKenzie, Denis Thérien
    Modular Temporal Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:344-351 [Conf]
  35. Javier Esparza, Alain Finkel, Richard Mayr
    On the Verification of Broadcast Protocols. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:352-359 [Conf]
  36. Faron Moller, Alexander Moshe Rabinovich
    On the Expressive Power of CTL. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:360-369 [Conf]
  37. Lawrence C. Paulson
    Proving Security Protocols Correct. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:370-383 [Conf]
  38. Joseph Y. Halpern, Richard A. Shore
    Reasoning about Common Knowledge with Infinitely Many Agents. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:384-393 [Conf]
  39. Mark W. Hopkins, Dexter Kozen
    Parikh's Theorem in Commutative Kleene Algebra. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:394-401 [Conf]
  40. Jean-Pierre Jouannaud, Albert Rubio
    The Higher-Order Recursive Path Ordering. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:402-411 [Conf]
  41. Thorsten Altenkirch
    Extensional Equality in Intensional Type Theory. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:412-420 [Conf]
  42. Russell Harmer, Guy McCusker
    A Fully Abstract Game Semantics for Finite Nondeterminism. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:422-430 [Conf]
  43. Samson Abramsky, Paul-André Melliès
    Concurrent Games and Full Completeness. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:431-442 [Conf]
  44. Pasquale Malacaria, Chris Hankin
    Non-Deterministic Games and Program Analysis: An Application to Security. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:443-452 [Conf]
  45. Stefano Guerrini
    Correctness of Multiplicative Proof Nets Is Linear. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:454-463 [Conf]
  46. Martin Hofmann
    Linear Types and Non-Size-Increasing Polynomial Time Computation. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:464-473 [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