Volume 9, June 2001
LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), Boston, Massachusetts, USA, 14-15 June 2001
Ilya Shlyakhter:
Generating effective symmetry-breaking predicates for search problems.
19-35
Daniel Le Berre:
Exploiting the real power of unit propagation lookahead.
59-80
Allen Van Gelder:
Combining Preorder and Postorder Resolution in a Satisfiability Solver.
115-128
Andrea Roll:
Criticality and Parallelism in GSAT.
150-161
Renato Bruni,
Antonio Sassano:
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae.
162-173
Oliver Kullmann:
On the use of autarkies for satisfiability decision.
231-253
Tom Morrisette:
The Unreasonable Effectiveness of Alternation-Based Satisfiability Algorithms.
254-268
Eyal Amir,
Sheila Mcllraith:
Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report).
329-343
K. Subramani:
A polyhedral projection procedure for Q2SAT.
369-375
data released under the ODC-BY 1.0 license
