• 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 40 matches

• 2003
• 
  Martín Abadi:
  Logic in Access Control. LICS 2003: 228-
• 
  Amal J. Ahmed, Limin Jia, David Walker:
  Reasoning about Hierarchical Storage. LICS 2003: 33-44
• 
  Andrei A. Bulatov:
  Tractable conservative Constraint Satisfaction Problems. LICS 2003: 321-
• 
  Josh Buresh-Oppenheim, Toniann Pitassi:
  The Complexity of Resolution Refinements. LICS 2003: 138-
• 
  Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
  An NP Decision Procedure for Protocol Insecurity with XOR. LICS 2003: 261-270
• 
  Hubert Comon-Lundh, Vitaly Shmatikov:
  Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. LICS 2003: 271-
• 
  Vincent Danos, Josée Desharnais:
  Labelled Markov Processes: Stronger and Faster Approximations. LICS 2003: 341-350
• 
  Nachum Dershowitz, Claude Kirchner:
  Abstract Saturation-Based Inference. LICS 2003: 65-74
• 
  Govert van Drimmelen:
  Satisfiability in Alternating-time Temporal Logic. LICS 2003: 208-217
• 
  E. Allen Emerson, Vineet Kahlon:
  Model Checking Guarded Protocols. LICS 2003: 361-370
• 
  Tomás Feder, Moshe Y. Vardi:
  Homomorphism Closed vs. Existential Positive. LICS 2003: 311-320
• 
  Markus Frick, Martin Grohe, Christoph Koch:
  Query Evaluation on Compressed Trees (Extended Abstract). LICS 2003: 188-
• 
  Harald Ganzinger, Konstantin Korovin:
  New Directions in Instantiation-Based Theorem Proving. LICS 2003: 55-64
• 
  Erich Grädel, Stephan Kreutzer:
  Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions. LICS 2003: 158-
• 
  Yuri Gurevich, Saharon Shelah:
  Spectra of Monadic Second-Order Formulas with One Unary Function. LICS 2003: 291-300
• 
  John Harrison:
  Formal Verification at Intel. LICS 2003: 45-
• 
  Dominic J. D. Hughes, Rob J. van Glabbeek:
  Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract). LICS 2003: 1-10
• 
  Aaron Hunter:
  Spectrum Hierarchies and Subdiagonal Functions. LICS 2003: 281-290
• 
  Petr Jancar:
  Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete. LICS 2003: 218-
• 
  Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan:
  On Automatic Partial Orders. LICS 2003: 168-177
• 
  Alexei Kopylov:
  Dependent Intersection: A New Way of Defining Records in Type Theory. LICS 2003: 86-95
• 
  Konstantin Korovin, Andrei Voronkov:
  Orienting Equalities with the Knuth-Bendix Order. LICS 2003: 75-
• 
  Viktor Kuncak, Martin C. Rinard:
  Structural Subtyping of Non-Recursive Types is Decidable. LICS 2003: 96-107
• 
  Marta Z. Kwiatkowska:
  Model checking for probability and time: from theory to practice . LICS 2003: 351-
• 
  Olivier Laurent, Laurent Regnier:
  About Translations of Classical Logic into Polarized Linear Logic. LICS 2003: 11-20
• 
  Leonid Libkin, Frank Neven:
  Logical Definability and Query Languages over Unranked Trees. LICS 2003: 178-187
• 
  James F. Lynch:
  Convergence Law for Random Graphs with Specified Degree Sequence. LICS 2003: 301-
• 
  P. Madhusudan:
  Model-checking Trace Event Structures. LICS 2003: 371-380
• 
  John McCarthy:
  Advice about logical AI. LICS 2003: 244-
• 
  Dale Miller, Alwen Fernanto Tiu:
  A Proof Theory for Generic Judgments: An extended abstract. LICS 2003: 118-127

skipping 10 more matches