The SCEAS System
Navigation Menu

Conferences in DBLP

Logic in Computer Science (LICS) (lics)
1998 (conf/lics/98)

  1. Roger M. Needham
    Logic and Over-Simplification. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:2-3 [Conf]
  2. Martin Grohe
    Fixed-Point Logics on Planar Graphs. [Citation Graph (1, 0)][DBLP]
    LICS, 1998, pp:6-15 [Conf]
  3. Thomas Eiter, Georg Gottlob, Yuri Gurevich
    Existential Second-Order Logic over Strings. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:16-27 [Conf]
  4. Anuj Dawar, Lauri Hella, Anil Seth
    Ordering Finite Variable Types with Generalized Quantifiers. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:28-43 [Conf]
  5. Manfred Jaeger
    Convergence Results for Relational Bayesian Networks. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:44-55 [Conf]
  6. Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz
    The Horn Mu-calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:58-69 [Conf]
  7. E. Allen Emerson, Kedar S. Namjoshi
    On Model Checking for Non-Deterministic Infinite-State Systems. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:70-80 [Conf]
  8. Orna Kupferman, Moshe Y. Vardi
    Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:81-92 [Conf]
  9. George C. Necula, Peter Lee
    Efficient Representation and Validation of Proofs. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:93-104 [Conf]
  10. Martín Abadi, Cédric Fournet, Georges Gonthier
    Secure Implementation of Channel Abstractions. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:105-116 [Conf]
  11. Ofer Arieli, Arnon Avron
    The Logical Role of the Four-Valued Bilattice. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:118-126 [Conf]
  12. Marcelo F. Frias, Roger D. Maddux
    Completeness of a Relational Calculus for Program Schemes. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:127-134 [Conf]
  13. Wolfgang Thomas
    Monadic Logic and Automata: Recent Developments. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:136-138 [Conf]
  14. François Fages, Paul Ruet, Sylvain Soliman
    Phase Semantics and Verification of Concurrent Constraint Programs. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:141-152 [Conf]
  15. Karen L. Bernstein
    A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:153-164 [Conf]
  16. Michele Boreale, Davide Sangiorgi
    Bisimulation in Name-Passing Calculi without Matching. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:165-175 [Conf]
  17. Joachim Parrow, Björn Victor
    The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:176-185 [Conf]
  18. Lars Birkedal, Aurelio Carboni, Giuseppe Rosolini, Dana S. Scott
    Type Theory via Exact Categories. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:188-198 [Conf]
  19. Claudio Hermida, Michael Makkai, John Power
    Higher Dimensional Multigraphs. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:199-206 [Conf]
  20. Peter Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell
    An Axiomatics for Categories of Transition Systems as Coalgebras. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:207-213 [Conf]
  21. Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel
    A Theory of Recursive Domains with Applications to Concurrency. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:214-225 [Conf]
  22. Dirk van Dalen
    L. E. J. Brouwer's Intuitionism: A Revolution in Two Installments. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:228-241 [Conf]
  23. Johan van Benthem
    Process Operations in Extended Dynamic Logics. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:244-250 [Conf]
  24. Andrei Voronkov
    Herbrand's Theorem, Automated Reasoning and Semantics Tableaux. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:252-263 [Conf]
  25. Margus Veanes
    The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:264-275 [Conf]
  26. Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
    Decision Problems in Ordered Rewriting. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:276-286 [Conf]
  27. Paul-André Melliès
    A Stability Theorem in Rewriting Theory. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:287-299 [Conf]
  28. Andrea Asperti
    Light Affine Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:300-308 [Conf]
  29. Ian Mackie
    Linear Logic With Boxes. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:309-320 [Conf]
  30. Maribel Fernández, Ian Mackie
    Coinductive Techniques for Operational Equivalence of Interaction Nets. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:321-332 [Conf]
  31. Samson Abramsky, Kohei Honda, Guy McCusker
    A Fully Abstract Game Semantics for General References. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:334-344 [Conf]
  32. Marcelo P. Fiore, Kohei Honda
    Recursive Types in Games: Axiomatics and Process Representation. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:345-356 [Conf]
  33. Makoto Tatsuta
    Realizability for Constructive Theory of Functions and Classes and its Application to Program Synthesis. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:358-367 [Conf]
  34. Hirofumi Yokouchi
    Completeness of Type Assignment Systems with Intersection, Union, and Type Quantifiers. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:368-379 [Conf]
  35. Ramesh Viswanathan
    Full Abstraction for First-Order Objects with Recursive Types and Subtyping. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:380-391 [Conf]
  36. Moshe Y. Vardi
    Linear vs. Branching Time: A Complexity-Theoretic Perspective. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:394-405 [Conf]
  37. Dusko Pavlovic, Martín Hötzel Escardó
    Calculus in Coinductive Form. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:408-417 [Conf]
  38. Enno Folkerts
    Invertibility in lambda-eta. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:418-429 [Conf]
  39. Martin Müller, Joachim Niehren, Ralf Treinen
    The First-Order Theory of Ordering Constraints over Feature Trees. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:432-443 [Conf]
  40. Jan Johannsen, Chris Pollett
    On Proofs about Threshold Circuits and Counting Hierarchies. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:444-452 [Conf]
  41. Luca de Alfaro
    How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:454-465 [Conf]
  42. Eugene W. Stark, Scott A. Smolka
    Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:466-477 [Conf]
  43. Josee Desharnais, Abbas Edalat, Prakash Panangaden
    A Logical Characterization of Bisimulation for Labeled Markov Processes. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:478-487 [Conf]
  44. John T. Baldwin, Michael Benedikt
    Embedded Finite Models, Stability Theory and the Impact of Order. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:490-500 [Conf]
  45. Leonid Libkin
    On Counting Logics and Local Properties. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:501-512 [Conf]
  46. Phokion G. Kolaitis, Martin Otto
    On the Boundedness Problem for Two-Variable First-Order Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:513-524 [Conf]
  47. Jean-Marie Le Bars
    Fragments of Existential Second-Order Logic without 0-1 Laws. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:525-536 [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