Henry Kautz
Proceedings of the Fourth Workshop on Theory and Applications of Satisfiability Testing
SAT, 2001.

@proceedings{SAT-2001,
	address       = "Boston, USA",
	editor        = "Henry Kautz",
	journal       = "{Electronic Notes in Discrete Mathematics}",
	title         = "{Proceedings of the Fourth Workshop on Theory and Applications of Satisfiability Testing}",
	volume        = 9,
	year          = 2001,
}

Contents (28 items)

18 ×#satisfiability
6 ×#problem
4 ×#named
2 ×#algorithm
2 ×#effectiveness
2 ×#implementation
2 ×#parallel
2 ×#probability
2 ×#proving
2 ×#using

SAT-2001-KautzS #named

Preface: Volume 9 (HAK, BS), p. 1.

SAT-2001-KautzRAGSS #problem #satisfiability

Balance and Filtering in Structured Satisfiable Problems (HAK, YR, DA, CPG, BS, MES), pp. 2–18.

SAT-2001-Shlyakhter #effectiveness #generative #problem #symmetry

Generating effective symmetry-breaking predicates for search problems (IS), pp. 19–35.

SAT-2001-CoccoM #analysis #backtracking #physics #random #satisfiability #statistics

Statistical physics analysis of the backtrack resolution of random 3-SAT instances (SC, RM), pp. 36–47.

SAT-2001-BuningZ #satisfiability

Satisfiable Formulas Closed Under Replacement (HKB, XZ), pp. 48–58.

SAT-2001-Berre #lookahead #power of

Exploiting the real power of unit propagation lookahead (DLB), pp. 59–80.

SAT-2001-KaporisKSVZ #revisited #satisfiability

The unsatisfiability threshold revisited (ACK, LMK, YCS, MV, MZ), pp. 81–95.

SAT-2001-Goldberg #proving #satisfiability

Proving unsatisfiability of CNFs locally (EG), pp. 96–114.

SAT-2001-Gelder #satisfiability

Combining Preorder and Postorder Resolution in a Satisfiability Solver (AVG), pp. 115–128.

SAT-2001-SimonC #framework #named #satisfiability

SatEx: A Web-based Framework for SAT Experimentation (LS, PC), pp. 129–149.

SAT-2001-Roll #parallel

Criticality and Parallelism in GSAT (AR), pp. 150–161.

SAT-2001-BruniS #maintenance #satisfiability

Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae (RB, AS), pp. 162–173.

SAT-2001-JurkowiakLU #using

Parallelizing Satz Using Dynamic Workload Balancing (BJ, CML, GU), pp. 174–189.

SAT-2001-LynceBM #algorithm #probability #satisfiability

Stochastic Systematic Search Algorithms for Satisfiability (IL, LB, JMS), pp. 190–204.

SAT-2001-SinzBK #implementation #named #parallel

PaSAT — Parallel SAT-Checking with Lemma Exchange: Implementation and Applications (CS, WB, WK), pp. 205–216.

SAT-2001-HuntMS #complexity #constraints #probability #problem #quantifier

Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems (HBHI, MVM, RES), pp. 217–230.

SAT-2001-Kullmann #on the #satisfiability #using

On the use of autarkies for satisfiability decision (OK), pp. 231–253.

SAT-2001-Morrisette #algorithm #effectiveness #satisfiability

The Unreasonable Effectiveness of Alternation-Based Satisfiability Algorithms (TM), pp. 254–268.

SAT-2001-RanderathSBHKMSC #graph #problem #satisfiability

A Satisfiability Formulation of Problems on Level Graphs (BR, ES, EB, PLH, AK, KM, BS, OC), pp. 269–277.

SAT-2001-NuallainRB #behaviour #predict #satisfiability

Ensemble-based prediction of SAT search behaviour (BÓN, MdR, JvB), pp. 278–289.

SAT-2001-GiunchigliaNTV #library #performance #satisfiability #towards

Towards an Efficient Library for SAT: a Manifesto (EG, MN, AT, MYV), pp. 290–310.

SAT-2001-McllraithA #proving #theorem proving

Theorem Proving with Structured Theories (Preliminary Report)* (SM, EA), pp. 311–328.

SAT-2001-AmirM #composition #problem #satisfiability #using

Solving Satisfiability using Decomposition and the Most Constrained Subproblem (EA, SM), pp. 329–343.

SAT-2001-LagoudakisL #branch #learning #satisfiability

Learning to Select Branching Rules in the DPLL Procedure for Satisfiability (MGL, MLL), pp. 344–359.

SAT-2001-PattersonK #implementation #named #self

Auto-Walksat: A Self-Tuning Implementation of Walksat (DJP, HAK), pp. 360–368.

SAT-2001-Subramani #satisfiability

A polyhedral projection procedure for Q2SAT (KS), pp. 369–375.

SAT-2001-HorvitzRGKSC #approach #problem

A Bayesian Approach to Tackling Hard Computational Problems (EH, YR, CPG, HAK, BS, DMC), pp. 376–391.

SAT-2001-BejarCFMG #logic #satisfiability

Extending the Reach of SAT with Many-Valued Logics (RB, AC, CF, FM, CPG), pp. 392–407.