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

• 2009
• 
  Dimitris Achlioptas:
  Random Satisfiability. Handbook of Satisfiability 2009: 245-270
• 
  Fabrizio Altarelli, Rémi Monasson, Guilhem Semerjian, Francesco Zamponi:
  Connections to Statistical Physics. Handbook of Satisfiability 2009: 569-611
• 
  Clark W. Barrett, Roberto Sebastiani, Sanjit A. Seshia, Cesare Tinelli:
  Satisfiability Modulo Theories. Handbook of Satisfiability 2009: 825-885
• 
  Armin Biere:
  Bounded Model Checking. Handbook of Satisfiability 2009: 457-481
• 
  Hans Kleine Büning, Uwe Bubeck:
  Theory of Quantified Boolean Formulas. Handbook of Satisfiability 2009: 735-760
• 
  Hans Kleine Büning, Oliver Kullmann:
  Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability 2009: 339-401
• 
  Evgeny Dantsin, Edward A. Hirsch:
  Worst-Case Upper Bounds. Handbook of Satisfiability 2009: 403-424
• 
  Adnan Darwiche, Knot Pipatsrisawat:
  Complete Algorithms. Handbook of Satisfiability 2009: 99-130
• 
  Rolf Drechsler, Tommi A. Junttila, Ilkka Niemelä:
  Non-Clausal SAT and ATPG. Handbook of Satisfiability 2009: 655-693
• 
  John Franco, John Martin:
  A History of Satisfiability. Handbook of Satisfiability 2009: 3-74
• 
  Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
  Reasoning with Quantified Boolean Formulas. Handbook of Satisfiability 2009: 761-780
• 
  Carla P. Gomes, Ashish Sabharwal:
  Exploiting Runtime Variation in Complete Solvers. Handbook of Satisfiability 2009: 271-288
• 
  Carla P. Gomes, Ashish Sabharwal, Bart Selman:
  Model Counting. Handbook of Satisfiability 2009: 633-654
• 
  Marijn Heule, Hans van Maaren:
  Look-Ahead Based SAT Solvers. Handbook of Satisfiability 2009: 155-184
• 
  Henry A. Kautz, Ashish Sabharwal, Bart Selman:
  Incomplete Algorithms. Handbook of Satisfiability 2009: 185-203
• 
  Daniel Kroening:
  Software Verification. Handbook of Satisfiability 2009: 505-532
• 
  Oliver Kullmann:
  Fundaments of Branching Heuristics. Handbook of Satisfiability 2009: 205-244
• 
  Chu Min Li, Felip Manyà:
  MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability 2009: 613-631
• 
  Stephen M. Majercik:
  Stochastic Boolean Satisfiability. Handbook of Satisfiability 2009: 887-925
• 
  Steven D. Prestwich:
  CNF Encodings. Handbook of Satisfiability 2009: 75-97
• 
  Jussi Rintanen:
  Planning and SAT. Handbook of Satisfiability 2009: 483-504
• 
  Olivier Roussel, Vasco Manquinho:
  Pseudo-Boolean and Cardinality Constraints. Handbook of Satisfiability 2009: 695-733
• 
  Karem A. Sakallah:
  Symmetry and Satisfiability. Handbook of Satisfiability 2009: 289-338
• 
  Marko Samer, Stefan Szeider:
  Fixed-Parameter Tractability. Handbook of Satisfiability 2009: 425-454
• 
  Roberto Sebastiani, Armando Tacchella:
  SAT Techniques for Modal and Description Logics. Handbook of Satisfiability 2009: 781-824
• 
  João Marques-Silva, Inês Lynce, Sharad Malik:
  Conflict-Driven Clause Learning SAT Solvers. Handbook of Satisfiability 2009: 131-153
• 
  Hantao Zhang:
  Combinatorial Designs by SAT Solvers. Handbook of Satisfiability 2009: 533-568
• 
  Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh:
  Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications 185, IOS Press 2009, ISBN 978-1-58603-929-5 [contents]