• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 43 matches

• 2001
• 
  Serge Abiteboul:
  Semistructured Data: from Practice to Theory. LICS 2001: 379-386
• 
  Micah Adler, Neil Immerman:
  An n! Lower Bound on Formula Size. LICS 2001: 197-206
• 
  Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar:
  From Verification to Control: Dynamic Programs for Omega-Regular Objectives. LICS 2001: 279-290
• 
  Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu:
  Typechecking XML Views of Relational Databases. LICS 2001: 421-430
• 
  Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, Philip J. Scott:
  Normalization by Evaluation for Typed Lambda Calculus with Coproducts. LICS 2001: 303-310
• 
  Rajeev Alur, Salvatore La Torre:
  Deterministic Generators and Games for LTL Fragments. LICS 2001: 291-300
• 
  Andrew W. Appel:
  Foundational Proof-Carrying Code. LICS 2001: 247-256
• 
  André Arnold, Giacomo Lenzi, Jerzy Marcinkowski:
  The Hierarchy inside Closed Monadic Sigma₁ Collapses on the Infinite Binary Tree. LICS 2001: 157-166
• 
  Eugene Asarin, Ahmed Bouajjani:
  Perturbed Turing Machines and Hybrid Systems. LICS 2001: 269-278
• 
  Jeremy Avigad:
  Eliminating Definitions and Skolem Functions in First-Order Logic. LICS 2001: 139-146
• 
  David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien:
  The Crane Beach Conjecture. LICS 2001: 187-196
• 
  Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
  A Model-Theoretic Approach to Regular String Relations. LICS 2001: 431-440
• 
  Frédéric Blanqui:
  Definitions by Rewriting in the Calculus of Constructions. LICS 2001: 9-18
• 
  Ahmed Bouajjani, Anca Muscholl, Tayssir Touili:
  Permutation Rewriting and Algorithmic Verification. LICS 2001: 399-408
• 
  Glenn Bruns, Patrice Godefroid:
  Temporal Logic Query Checking. LICS 2001: 409-417
• 
  Stephen A. Cook, Antonina Kolokolova:
  A Second-Order System for Polytime Reasoning Using Graedel's Theorem. LICS 2001: 177-186
• 
  Satyaki Das, David L. Dill:
  Successive Approximation of Abstract Transition Relations. LICS 2001: 51-58
• 
  Martín Hötzel Escardó, Alex K. Simpson:
  A Universal Characterization of the Closed Euclidean Interval. LICS 2001: 115-125
• 
  Marcelo P. Fiore, Daniele Turi:
  Semantics of Name and Value Passing. LICS 2001: 93-104
• 
  Harald Ganzinger:
  Relating Semantic and Proof-Theoretic Concepts for Polynominal Time Decidability of Uniform Word Problems. LICS 2001: 81-90
• 
  Guillem Godoy, Robert Nieuwenhuis:
  On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups. LICS 2001: 38-47
• 
  Yuri Gurevich:
  Logician in the Land of OS: Abstract State Machines in Microsoft. LICS 2001: 129-136
• 
  Taneli Huuskonen, Tapani Hyttinen:
  On Definability of Order in Logic with Choice. LICS 2001: 167-172
• 
  David Janin, Giacomo Lenzi:
  Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy. LICS 2001: 347-356
• 
  Alan Jeffrey:
  A Symbolic Labelled Transition System for Coinductive Subtyping of F_µ< Types. LICS 2001: 323-333
• 
  Lefteris M. Kirousis, Phokion G. Kolaitis:
  A Dichotomy in the Complexity of Propositional Circumscription. LICS 2001: 71-80
• 
  Dexter Kozen, Jerzy Tiuryn:
  Intuitionistic Linear Logic and Partial Correctness. LICS 2001: 259-268
• 
  Orna Kupferman, Moshe Y. Vardi:
  Synthesizing Distributed Systems. LICS 2001: 389-398
• 
  James Laird:
  A Fully Abstract Game Semantics of Local Exceptions. LICS 2001: 105-114
• 
  Martin Lange, Colin Stirling:
  Focus Games for Satisfiability and Completeness of Temporal Logic. LICS 2001: 357-365

skipping 13 more matches