Conferences in DBLP
Ronald Fagin Logic, Complexity, and Games. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:3- [Conf ] Lars Birkedal A General Notion of Realizability. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:7-17 [Conf ] Alexandre Miquel A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:18-29 [Conf ] Alex K. Simpson , Gordon D. Plotkin Complete Axioms for Categorical Fixed-Point Operators. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:30-41 [Conf ] 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 ] Achim Blumensath , Erich Grädel Automatic Structures. [Citation Graph (1, 0)][DBLP ] LICS, 2000, pp:51-62 [Conf ] Foto N. Afrati , Hans Leiß , Michel de Rougemont Definability and Compression. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:63-73 [Conf ] 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 ] 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 ] Josee Desharnais , Vineet Gupta , Radha Jagadeesan , Prakash Panangaden Approximating Labeled Markov Processes. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:95-106 [Conf ] 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 ] E. Allen Emerson , John Havlicek , Richard J. Trefler Virtual Symmetry Reduction. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:121-131 [Conf ] 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 ] Luca de Alfaro , Thomas A. Henzinger Concurrent Omega-Regular Games. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:141-154 [Conf ] 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 ] Clifford Bergman , Giora Slutzki Computational Complexity of Some Problems Involving Congruences on Algebras. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:168-174 [Conf ] Saul Kripke From the Church-Turing Thesis to the First-Order Algorithm Theorem. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:177- [Conf ] Bart Selman Satisfiability Testing: Recent Developments and Challenge Problems. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:178- [Conf ] 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 ] Juliusz Chroboczek Game Semantics and Subtyping. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:192-203 [Conf ] Vincent Danos , Russell Harmer Probabilistic Game Semantics. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:204-213 [Conf ] 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 ] Mark Reynolds More Past Glories. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:229-240 [Conf ] Ben C. Moszkowski A Complete Axiomatization of Interval Temporal Logic with Infinite Time. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:241-252 [Conf ] Hiroshi Nakano A Modality for Recursion. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:255-266 [Conf ] Frédéric Prost A Static Calculus of Dependencies for the lambda-Cube. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:267-276 [Conf ] Tatiana Rybina , Andrei Voronkov A Decision Procedure for Term Algebras with Queues. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:279-290 [Conf ] 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 ] Kenneth L. McMillan Some Strategies for Proving Theorems with a Model Checker. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:305-306 [Conf ] Jean-Louis Krivine The Curry-Howard Correspondence in Set Theory. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:307-308 [Conf ] 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 ] Gian Luca Cattani , Peter Sewell Models for Name-Passing Processes: Interleaving and Causal. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:322-332 [Conf ] Nobuko Yoshida , Matthew Hennessy Assigning Types to Processes. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:334-345 [Conf ] Martin Grohe , Luc Segoufin On First-Order Topological Queries. [Citation Graph (1, 0)][DBLP ] LICS, 2000, pp:349-360 [Conf ] 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 ] Hongwei Xi Imperative Programming with Dependent Types. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:375-387 [Conf ] Jens Palsberg , Tian Zhao Efficient and Flexible Matching of Recursive Types. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:388-398 [Conf ] 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 ] Guillem Godoy , Robert Nieuwenhuis Paramodulation with Built-in Abelian Groups. [Citation Graph (0, 0)][DBLP ] LICS, 2000, pp:413-424 [Conf ]