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

• 2000
• 
  David A. Basin, Seán Matthews:
  Structuring Metatheory on Inductive Definitions. Inf. Comput. 162(1-2): 80-95 (2000)
• 
  Jörg Denzinger, Stephan Schulz:
  Automatic Acquisition of Search Control Knowledge from Multiple Proof Attempts. Inf. Comput. 162(1-2): 59-79 (2000)
• 
  Uwe Egly, Thomas Rath:
  Practically Useful Variants of Definitional Translations to Normal Form. Inf. Comput. 162(1-2): 255-264 (2000)
• 
  Giuseppe De Giacomo, Fabio Massacci:
  Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL. Inf. Comput. 162(1-2): 117-137 (2000)
• 
  Fausto Giunchiglia, Roberto Sebastiani:
  Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m). Inf. Comput. 162(1-2): 158-178 (2000)
• 
  Qing Guo, Paliath Narendran, David A. Wolfram:
  Complexity of Nilpotent Unification and Matching Problems. Inf. Comput. 162(1-2): 3-23 (2000)
• 
  Miki Hermann, Phokion G. Kolaitis:
  Unification Algorithms Cannot Be Combined in Polynomial Time. Inf. Comput. 162(1-2): 24-42 (2000)
• 
  Christoph Kreitz, Stephan Schmitt:
  A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems. Inf. Comput. 162(1-2): 226-254 (2000)
• 
  Saturnino F. Luz-Filho:
  Using Tableaux to Automate the Lambek and Other Categorial Calculi. Inf. Comput. 162(1-2): 206-225 (2000)
• 
  Tai Joon Park, Allen Van Gelder:
  Partitioning Methods for Satisfiability Testing on Large Formulas. Inf. Comput. 162(1-2): 179-184 (2000)
• 
  Olivier Roussel, Philippe Mathieu:
  The Achievement of Knowledge Bases by Cycle Search. Inf. Comput. 162(1-2): 43-58 (2000)
• 
  Gernot Salzer:
  Optimal Axiomatizations of Finitely Valued Logics. Inf. Comput. 162(1-2): 185-205 (2000)
• 
  Heribert Schütz, Tim Geisler:
  Efficient Model Generation through Compilation. Inf. Comput. 162(1-2): 138-157 (2000)
• 
  John K. Slaney:
  Introduction. Inf. Comput. 162(1-2): 1-2 (2000)
• 
  Christoph Walther, Thomas Kolbe:
  On Terminating Lemma Speculations. Inf. Comput. 162(1-2): 96-116 (2000)