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

• 2007
• 
  Martin Fränzle, Christian Herde, Tino Teige, Stefan Ratschan, Tobias Schubert:
  Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure. J. Satisf. Boolean Model. Comput. 1(3-4): 209-236 (2007)
• 
  Youssef Hamadi, Lucas Bordeaux:
  Preface to Special Issue on SAT/CP Integration. J. Satisf. Boolean Model. Comput. 1(3-4) (2007)
• 
  Shuvendu K. Lahiri, Krishna K. Mehra:
  Interpolant based Decision Procedure for Quantifier-Free Presburger Arithmetic. J. Satisf. Boolean Model. Comput. 1(3-4): 187-207 (2007)
• 
  Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
  Recording and Minimizing Nogoods from Restarts. J. Satisf. Boolean Model. Comput. 1(3-4): 147-167 (2007)
• 
  Christophe Lecoutre, Lakhdar Sais, Julien Vion:
  Using SAT Encodings to Drive CSP Value Ordering Heuristics. J. Satisf. Boolean Model. Comput. 1(3-4): 169-186 (2007)
• 2006
• 
  Miguel F. Anjos:
  Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems. J. Satisf. Boolean Model. Comput. 1(1): 1-47 (2006)
• 
  Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis:
  Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. J. Satisf. Boolean Model. Comput. 1(1): 61-88 (2006)
• 
  Evgeny Dantsin, Alexander Wolpert:
  A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length. J. Satisf. Boolean Model. Comput. 1(1): 49-60 (2006)
• 
  Konstantin Kutzkov:
  A Note on the Use of Independent Sets for the k-SAT Problem. J. Satisf. Boolean Model. Comput. 1(2): 143-145 (2006)
• 
  Eliezer L. Lozinskii:
  Impurity: Another Phase Transition of SAT. J. Satisf. Boolean Model. Comput. 1(2): 123-141 (2006)
• 
  Daniel Rolf:
  Improved Bound for the PPSZ/Schöning-Algorithm for 3-SAT. J. Satisf. Boolean Model. Comput. 1(2): 111-122 (2006)
• 
  Sean A. Weaver, John V. Franco, John S. Schlipf:
  Extending Existential Quantification in Conjunctions of BDDs. J. Satisf. Boolean Model. Comput. 1(2): 89-110 (2006)