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

• 2005
• 
  Wolfgang Ahrendt, Andreas Roth, Ralf Sasse:
  Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics. LPAR 2005: 412-426
• 
  Vladimir Aleksic, Anatoli Degtyarev:
  Regular Derivations in Basic Superposition-Based Calculi. LPAR 2005: 292-306
• 
  Christian Anger, Martin Gebser, Thomas Linke, André Neumann, Torsten Schaub:
  The nomore++ Approach to Answer Set Solving. LPAR 2005: 95-109
• 
  Matthias Baaz, Rosalie Iemhoff:
  On Interpolation in Existence Logics. LPAR 2005: 697-711
• 
  Thomas Ball, Shuvendu K. Lahiri, Madanlal Musuvathi:
  Zap: Automated Theorem Proving for Software Analysis. LPAR 2005: 2-22
• 
  David A. Basin, Sebastian Mödersheim, Luca Viganò:
  Algebraic Intruder Deductions. LPAR 2005: 549-564
• 
  Bernhard Beckert, Kerry Trentelman:
  Second-Order Principles in Specification Languages for Object-Oriented Programs. LPAR 2005: 154-168
• 
  Marc Bezem, Thierry Coquand:
  Automating Coherent Logic. LPAR 2005: 246-260
• 
  Magnus Björk:
  A First Order Extension of Stålmarck's Method. LPAR 2005: 276-291
• 
  Laura Bozzelli, Aniello Murano, Adriano Peron:
  Pushdown Module Checking. LPAR 2005: 504-518
• 
  Amine Chaieb, Tobias Nipkow:
  Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic. LPAR 2005: 367-380
• 
  Henning Christiansen, Davide Martinenghi:
  Incremental Integrity Checking: Limitations and Possibilities. LPAR 2005: 712-727
• 
  Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis:
  Inference from Controversial Arguments. LPAR 2005: 606-620
• 
  Mehdi Dastani, Guido Governatori, Antonino Rotolo, Leendert W. N. van der Torre:
  Programming Cognitive Agents in Defeasible Logic. LPAR 2005: 621-636
• 
  Matthias Daum, Stefan Maus, Norbert Schirmer, Mohamed Nassim Seghir:
  Integration of a Software Model Checker into Isabelle. LPAR 2005: 381-395
• 
  Nachum Dershowitz:
  The Four Sons of Penrose. LPAR 2005: 125-138
• 
  Jürgen Dix, Wolfgang Faber, V. S. Subrahmanian:
  The Relationship Between Reasoning About Privacy and Default Logics. LPAR 2005: 637-650
• 
  Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec:
  Strong Normalization of the Dual Classical Sequent Calculus. LPAR 2005: 169-183
• 
  Jianjun Duan, Joe Hurd, Guodong Li, Scott Owens, Konrad Slind, Junxing Zhang:
  Functional Correctness Proofs of Encryption Algorithms. LPAR 2005: 519-533
• 
  Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio:
  Recursive Path Orderings Can Also Be Incremental. LPAR 2005: 230-245
• 
  Andrea Ferrara, Guoqiang Pan, Moshe Y. Vardi:
  Treewidth in Verification: Local vs. Global. LPAR 2005: 489-503
• 
  Carsten Fritz:
  Concepts of Automata Construction from LTL. LPAR 2005: 728-742
• 
  Didier Galmiche, Daniel Méry:
  Characterizing Provability in . LPAR 2005: 459-473
• 
  Allen Van Gelder:
  Independently Checkable Proofs from Decision Procedures: Issues and Progress. LPAR 2005: 1
• 
  Allen Van Gelder:
  Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning. LPAR 2005: 580-594
• 
  Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
  Analytic Tableaux for KLM Preferential and Cumulative Logics. LPAR 2005: 666-681
• 
  Matthias M. Hölzl, John N. Crossley:
  Disjunctive Constraint Lambda Calculi. LPAR 2005: 64-78
• 
  Jeroen Ketema, Jakob Grue Simonsen:
  On Confluence of Infinitary Combinatory Reduction Systems. LPAR 2005: 199-214
• 
  Temur Kutsia, Mircea Marin:
  Matching with Regular Constraints. LPAR 2005: 215-229
• 
  Dominique Larchey-Wendling:
  Bounding Resource Consumption with Gödel-Dummett Logics. LPAR 2005: 682-696

skipping 21 more matches