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

• 1987
• 
  Leo Bachmair, Nachum Dershowitz:
  Completion for Rewriting Modulo a Congruence. RTA 1987: 192-203
• 
  Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
  Term Rewriting Systems with Priorities. RTA 1987: 83-94
• 
  M. Benois:
  Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction. RTA 1987: 121-132
• 
  Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß:
  On Equational Theories, Unification and Decidability. RTA 1987: 204-215
• 
  Christine Choppy, Stéphane Kaplan, Michèle Soria:
  Algorithmic Complexity of Term Rewriting Systems. RTA 1987: 256-273
• 
  Max Dauchet, Francesco De Comité:
  A Gap Between Linear and Non Linear Term-Rewriting Systems (1). RTA 1987: 95-104
• 
  Annie Despland, Monique Mazaud, Raymond Rakotozafy:
  Code Generator Generation Based on Template-Driven Target Term Rewriting. RTA 1987: 105-120
• 
  Jean H. Gallier, Wayne Snyder:
  A General Complete E-Unification Procedure. RTA 1987: 216-227
• 
  Richard Göbel:
  Ground Confluence. RTA 1987: 156-167
• 
  Stéphane Kaplan:
  A Compiler for Conditional Term Rewriting Systems. RTA 1987: 25-41
• 
  Hélène Kirchner:
  Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes. RTA 1987: 180-191
• 
  Klaus Madlener, Friedrich Otto:
  Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems. RTA 1987: 133-144
• 
  Ursula Martin:
  How to Choose Weights in the Knuth Bendix Ordering. RTA 1987: 42-53
• 
  Michael J. O'Donnell:
  Term-Rewriting Implementation of Equational Logic Programming. RTA 1987: 1-12
• 
  Friedrich Otto:
  Some Results about Confluence on a Given Congruence Class. RTA 1987: 145-155
• 
  Peter Padawitz:
  Strategy-Controlled Reduction and Narrowing. RTA 1987: 242-255
• 
  Paul Walton Purdom Jr.:
  Detecting Looping Simplifications. RTA 1987: 54-61
• 
  Zhenyu Qian:
  Structured Contextual Rewriting. RTA 1987: 168-179
• 
  R. Ramesh, I. V. Ramakrishnan:
  Optimal Speedups for Parallel Pattern Matching in Trees. RTA 1987: 274-285
• 
  Pierre Réty:
  Improving Basic Narrowing Techniques. RTA 1987: 228-241
• 
  Éric Sopena:
  Combinatorial Hypermap Rewriting. RTA 1987: 62-73
• 
  Craig C. Squier, Friedrich Otto:
  Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems. RTA 1987: 74-82
• 
  Robert Strandh:
  Optimizing Equational Programs. RTA 1987: 13-24
• 
  Pierre Lescanne:
  Rewriting Techniques and Applications, 2nd International Conference, RTA-87, Bordeaux, France, May 25-27, 1987, Proceedings. Lecture Notes in Computer Science 256, Springer 1987, ISBN 3-540-17220-3 [contents]