• 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

• 2007
• 
  Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sagiv:
  Decidable Fragments of Many-Sorted Logic. LPAR 2007: 17-31
• 
  Pietro Abate, Rajeev Goré, Florian Widmann:
  One-Pass Tableaux for Computation Tree Logic. LPAR 2007: 32-46
• 
  Behzad Akbarpour, Lawrence C. Paulson:
  Extending a Resolution Prover for Inequalities on Elementary Functions. LPAR 2007: 47-61
• 
  Roland Axelsson, Martin Lange:
  Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. LPAR 2007: 62-76
• 
  Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller:
  Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. LPAR 2007: 77-91
• 
  David Baelde, Dale Miller:
  Least and Greatest Fixed Points in Linear Logic. LPAR 2007: 92-106
• 
  Leopoldo E. Bertossi, Loreto Bravo:
  The Semantics of Consistency and Trust in Peer Data Exchange Systems. LPAR 2007: 107-122
• 
  Marc Bezem, Tore Langholm, Michal Walicki:
  Completeness and Decidability in Sequence Logic. LPAR 2007: 123-137
• 
  Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
  HORPO with Computability Closure: A Reconstruction. LPAR 2007: 138-150
• 
  Richard Bonichon, David Delahaye, Damien Doligez:
  Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs. LPAR 2007: 151-165
• 
  Sebastian Brandt:
  Matching in Hybrid Terminologies. LPAR 2007: 166-180
• 
  Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch:
  Verifying Cryptographic Protocols with Subterms Constraints. LPAR 2007: 181-195
• 
  Véronique Cortier, Stéphanie Delaune:
  Deciding Knowledge in Security Protocols for Monoidal Equational Theories. LPAR 2007: 196-210
• 
  Zaynah Dargaye, Xavier Leroy:
  Mechanized Verification of CPS Transformations. LPAR 2007: 211-225
• 
  Francien Dechesne, Mohammad Reza Mousavi, Simona Orzan:
  Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap. LPAR 2007: 226-241
• 
  Stéphanie Delaune, Hai Lin, Christopher Lynch:
  Protocol Verification Via Rigid/Flexible Resolution. LPAR 2007: 242-256
• 
  Stéphane Demri, Alexander Rabinovich:
  The Complexity of Temporal Logic with Until and Since over Ordinals. LPAR 2007: 531-545
• 
  Alessandro Ferrante, Aniello Murano, Mimmo Parente:
  Enriched µ-Calculus Pushdown Module Checking. LPAR 2007: 438-453
• 
  Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
  Preferential Description Logics. LPAR 2007: 257-272
• 
  Philippe de Groote, Sarah Maarek, Ryo Yoshinaka:
  On Two Extensions of Abstract Categorial Grammars. LPAR 2007: 273-287
• 
  Éric Jaeger, Catherine Dubois:
  Why Would You Trust B ? LPAR 2007: 288-302
• 
  Yevgeny Kazakov, Ulrike Sattler, Evgeny Zolin:
  How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited. LPAR 2007: 303-317
• 
  Emanuel Kieronski, Lidia Tendera:
  On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards. LPAR 2007: 318-332
• 
  Adila Krisnadhi, Carsten Lutz:
  Data Complexity in the EL Family of Description Logics. LPAR 2007: 333-347
• 
  Michel Ludwig, Uwe Waldmann:
  An Extension of the Knuth-Bendix Ordering with LPO-Like Properties. LPAR 2007: 348-362
• 
  Roberto Maieli:
  Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic. LPAR 2007: 363-377
• 
  Johann A. Makowsky:
  From Hilbert's Program to a Logic Toolbox. LPAR 2007: 1
• 
  Maarten Mariën, Johan Wittocx, Marc Denecker:
  Integrating Inductive Definitions in SAT. LPAR 2007: 378-392
• 
  Damiano Mazza, Michele Pagani:
  The Separation Theorem for Differential Interaction Nets. LPAR 2007: 393-407
• 
  Maja Milicic:
  Complexity of Planning in Action Formalisms Based on Description Logics. LPAR 2007: 408-422

skipping 10 more matches