Electronic Notes in Discrete Mathematics, Volume 9

Volume 9, June 2001

• Henry A. Kautz, Bart Selman:
  Preface: Volume 9. 1
  Electronic Edition (link) BibTeX
• Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel:
  Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). 2-18
  Electronic Edition (link) BibTeX
• Ilya Shlyakhter:
  Generating effective symmetry-breaking predicates for search problems. 19-35
  Electronic Edition (link) BibTeX
• Simona Cocco, Rémi Monasson:
  Statistical physics analysis of the backtrack resolution of random 3-SAT instances. 36-47
  Electronic Edition (link) BibTeX
• Hans Kleine Büning, Xishun Zhao:
  Satisfiable Formulas Closed Under Replacement. 48-58
  Electronic Edition (link) BibTeX
• Daniel Le Berre:
  Exploiting the real power of unit propagation lookahead. 59-80
  Electronic Edition (link) BibTeX
• Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
  The unsatisfiability threshold revisited. 81-95
  Electronic Edition (link) BibTeX
• Eugene Goldberg:
  Proving unsatisfiability of CNFs locally. 96-114
  Electronic Edition (link) BibTeX
• Allen Van Gelder:
  Combining Preorder and Postorder Resolution in a Satisfiability Solver. 115-128
  Electronic Edition (link) BibTeX
• Laurent Simon, Philippe Chatalic:
  SatEx: A Web-based Framework for SAT Experimentation. 129-149
  Electronic Edition (link) BibTeX
• Andrea Roll:
  Criticality and Parallelism in GSAT. 150-161
  Electronic Edition (link) BibTeX
• Renato Bruni, Antonio Sassano:
  Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae. 162-173
  Electronic Edition (link) BibTeX
• Bernard Jurkowiak, Chu Min Li, Gil Utard:
  Parallelizing Satz Using Dynamic Workload Balancing. 174-189
  Electronic Edition (link) BibTeX
• Inês Lynce, Luís Baptista, João Marques-Silva:
  Stochastic Systematic Search Algorithms for Satisfiability. 190-204
  Electronic Edition (link) BibTeX
• Carsten Sinz, Wolfgang Blochinger, Wolfgang Küchlin:
  PaSAT - Parallel SAT-Checking with Lemma Exchange: Implementation and Applications. 205-216
  Electronic Edition (link) BibTeX
• Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns:
  Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems. 217-230
  Electronic Edition (link) BibTeX
• Oliver Kullmann:
  On the use of autarkies for satisfiability decision. 231-253
  Electronic Edition (link) BibTeX
• Tom Morrisette:
  The Unreasonable Effectiveness of Alternation-Based Satisfiability Algorithms. 254-268
  Electronic Edition (link) BibTeX
• Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek:
  A Satisfiability Formulation of Problems on Level Graphs. 269-277
  Electronic Edition (link) BibTeX
• Breanndán Ó Nualláin, Maarten de Rijke, Johan van Benthem:
  Ensemble-based prediction of SAT search behaviour. 278-289
  Electronic Edition (link) BibTeX
• Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella, Moshe Y. Vardi:
  Towards an Efficient Library for SAT: a Manifesto. 290-310
  Electronic Edition (link) BibTeX
• Sheila Mcllraith, Eyal Amir:
  Theorem Proving with Structured Theories (Preliminary Report)^*. 311-328
  Electronic Edition (link) BibTeX
• Eyal Amir, Sheila Mcllraith:
  Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report). 329-343
  Electronic Edition (link) BibTeX
• Michail G. Lagoudakis, Michael L. Littman:
  Learning to Select Branching Rules in the DPLL Procedure for Satisfiability. 344-359
  Electronic Edition (link) BibTeX
• Donald J. Patterson, Henry A. Kautz:
  Auto-Walksat: A Self-Tuning Implementation of Walksat. 360-368
  Electronic Edition (link) BibTeX
• K. Subramani:
  A polyhedral projection procedure for Q2SAT. 369-375
  Electronic Edition (link) BibTeX
• Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry A. Kautz, Bart Selman, David Maxwell Chickering:
  A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report). 376-391
  Electronic Edition (link) BibTeX
• Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes:
  Extending the Reach of SAT with Many-Valued Logics. 392-407
  Electronic Edition (link) BibTeX