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

• 2007
• 
  Fadi A. Aloul, Nagarajan Kandasamy:
  Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach. SAT 2007: 369-376
• 
  Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
  Mapping CSP into Many-Valued SAT. SAT 2007: 10-15
• 
  Josep Argelich, Felip Manyà:
  Partial Max-SAT Solvers with Clause Learning. SAT 2007: 28-40
• 
  Gilles Audemard, Lakhdar Sais:
  Circuit Based Encoding of CNF Formula. SAT 2007: 16-21
• 
  Uwe Bubeck, Hans Kleine Büning:
  Bounded Universal Expansion for Preprocessing QBF. SAT 2007: 244-257
• 
  Joshua Buresh-Oppenheim, David G. Mitchell:
  Minimum 2CNF Resolution Refutations in Polynomial Time. SAT 2007: 300-313
• 
  Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani:
  A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories. SAT 2007: 334-339
• 
  Martin Davis:
  SAT: Past and Future. SAT 2007: 1-2
• 
  Debapratim De, Abishek Kumarasubramanian, Ramarathnam Venkatesan:
  Inversion Attacks on Secure Hash Functions Using satSolvers. SAT 2007: 377-382
• 
  Nachum Dershowitz, Ziyad Hanna, Alexander Nadel:
  Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver. SAT 2007: 287-293
• 
  Niklas Eén, Alan Mishchenko, Niklas Sörensson:
  Applying Logic Synthesis for Speeding Up SAT. SAT 2007: 272-286
• 
  Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl:
  SAT Solving for Termination Analysis with Polynomial Interpretations. SAT 2007: 340-354
• 
  Allen Van Gelder:
  Verifying Propositional Unsatisfiability: Pitfalls to Avoid. SAT 2007: 328-333
• 
  Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman:
  Short XORs for Model Counting: From Theory to Practice. SAT 2007: 100-106
• 
  Federico Heras, Javier Larrosa, Albert Oliveras:
  MiniMaxSat: A New Weighted Max-SAT Solver. SAT 2007: 41-55
• 
  Alexander Hertel, Philipp Hertel, Alasdair Urquhart:
  Formalizing Dangerous SAT Encodings. SAT 2007: 159-172
• 
  Marijn Heule, Hans van Maaren:
  From Idempotent Generalized Boolean Assignments to Multi-bit Search. SAT 2007: 134-147
• 
  Marijn Heule, Hans van Maaren:
  Effective Incorporation of Double Look-Ahead Procedures. SAT 2007: 258-271
• 
  Toni Jussila, Armin Biere, Carsten Sinz, Daniel Kröning, Christoph M. Wintersteiger:
  A First Step Towards a Unified Proof Checker for QBF. SAT 2007: 201-214
• 
  Arist Kojevnikov:
  Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities. SAT 2007: 70-79
• 
  Oliver Kullmann:
  Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. SAT 2007: 314-327
• 
  Marina Langlois, Robert H. Sloan, György Turán:
  Horn Upper Bounds and Renaming. SAT 2007: 80-93
• 
  Chu Min Li, Wanxia Wei, Harry Zhang:
  Combining Adaptive Noise and Look-Ahead in Local Search for SAT. SAT 2007: 121-133
• 
  Martin Lukasiewycz, Michael Glaß, Christian Haubelt, Jürgen Teich:
  Solving Multi-objective Pseudo-Boolean Problems. SAT 2007: 56-69
• 
  Inês Lynce, João Marques-Silva:
  Breaking Symmetries in SAT Matrix Models. SAT 2007: 22-27
• 
  Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
  On the Boolean Connectivity Problem for Horn Relations. SAT 2007: 187-200
• 
  Panagiotis Manolios, Daron Vroon:
  Efficient Circuit to CNF Conversion. SAT 2007: 4-9
• 
  Juan Antonio Navarro Pérez, Andrei Voronkov:
  Encodings of Problems in Effectively Propositional Logic. SAT 2007: 3
• 
  Knot Pipatsrisawat, Adnan Darwiche:
  A Lightweight Component Caching Scheme for Satisfiability Solvers. SAT 2007: 294-299
• 
  Stefan Porschen, Ewald Speckenmeyer:
  Algorithms for Variable-Weighted 2-SAT and Dual Problems. SAT 2007: 173-186

skipping 7 more matches