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

• 2012
• 
  Peter Baumgartner, Björn Pelzer, Cesare Tinelli:
  Model Evolution with equality - Revised and implemented. J. Symb. Comput. 47(9): 1011-1045 (2012)
• 
  Christian Mahesh Hansen, Roger Antonsen, Martin Giese, Arild Waaler:
  Incremental variable splitting. J. Symb. Comput. 47(9): 1046-1065 (2012)
• 
  Nicolas Peltier, Viorica Sofronie-Stokkermans:
  First-order theorem proving: Foreword. J. Symb. Comput. 47(9): 1009-1010 (2012)
• 
  Silvio Ranise:
  On the verification of security-aware E-services. J. Symb. Comput. 47(9): 1066-1088 (2012)
• 
  Christoph Wernhard:
  Projection and scope-determined circumscription. J. Symb. Comput. 47(9): 1089-1108 (2012)
• 
  Claus-Peter Wirth:
  lim+, δ⁺, and Non-Permutability of β-Steps. J. Symb. Comput. 47(9): 1109-1135 (2012)
• 2010
• 
  Nicolas Peltier, Viorica Sofronie-Stokkermans:
  Proceedings of the 7th International Workshop on First-Order Theorem Proving, FTP 2009, Oslo, Norway, July 6-7, 2009. CEUR Workshop Proceedings 556, CEUR-WS.org 2010 [contents]
• 2009
• 
  Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Alberto Griggio, Roberto Sebastiani:
  Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis. Ann. Math. Artif. Intell. 55(1-2): 63-99 (2009)
• 
  Arnaud Fietzke, Christoph Weidenbach:
  Labelled splitting. Ann. Math. Artif. Intell. 55(1-2): 3-34 (2009)
• 
  Yeting Ge, Clark W. Barrett, Cesare Tinelli:
  Solving quantified verification conditions using satisfiability modulo theories. Ann. Math. Artif. Intell. 55(1-2): 101-122 (2009)
• 
  Peter Höfner, Georg Struth, Geoff Sutcliffe:
  Automated verification of refinement laws. Ann. Math. Artif. Intell. 55(1-2): 35-62 (2009)
• 
  Fabrice Nahon, Claude Kirchner, Hélène Kirchner, Paul Brauner:
  Inductive proof search modulo. Ann. Math. Artif. Intell. 55(1-2): 123-154 (2009)
• 
  Silvio Ranise, Ullrich Hustadt:
  Preface. Ann. Math. Artif. Intell. 55(1-2): 1-2 (2009)
• 
  Renate A. Schmidt:
  A new methodology for developing deduction methods. Ann. Math. Artif. Intell. 55(1-2): 155-187 (2009)
• 
  Peter Baumgartner, John K. Slaney:
  Constraint Modelling: A Challenge for First Order Automated Reasoning. FTP 2009
• 
  Lilia Georgieva, Patrick Maier:
  Inductive Reasoning for Shape Invariants. FTP 2009
• 
  Silvio Ghilardi:
  Model-Checking of Array-Based Systems: from Foundations to Implementation. FTP 2009
• 
  Koji Iwanuma, Hidetomo Nabeshima, Katsumi Inoue:
  Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation. FTP 2009
• 
  Peter Jeavons:
  Presenting Constraints. FTP 2009
• 
  Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa:
  Minimal Model Generation with Respect to an Atom Set. FTP 2009
• 
  Manuel Lamotte-Schubert, Christoph Weidenbach:
  Analysis of Authorizations in SAP R/3. FTP 2009
• 
  Michel Ludwig, Ullrich Hustadt:
  Redundancy Elimination in Monodic Temporal Reasoning. FTP 2009
• 
  Nicolas Peltier, Viorica Sofronie-Stokkermans:
  Preface. FTP 2009
• 
  Silvio Ranise:
  Towards the Verification of Security-Aware Transaction E-services. FTP 2009
• 
  Christoph Wernhard:
  Literal Projection and Circumscription. FTP 2009
• 
  Hao Xu:
  Static Types As Search Heuristics. FTP 2009
• 
  Susumu Yamasaki:
  A Fixed Point Representation of References. FTP 2009
• 2004
• 
  Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong:
  Reachability Analysis over Term Rewriting Systems. J. Autom. Reason. 33(3-4): 341-383 (2004)
• 
  Silvio Ghilardi:
  Model-Theoretic Methods in Combined Constraint Satisfiability. J. Autom. Reason. 33(3-4): 221-249 (2004)
• 
  Deepak Kapur, Laurent Vigneron:
  Preface. J. Autom. Reason. 33(3-4): 219-220 (2004)

skipping 61 more matches