Constraints, Volume 14

Volume 14, Number 1, March 2009

• Enrico Giunchglia, Kostas Stergiou:
  Introduction to the special issue on quantified CSPs and QBF. 1-2
  
• Manuel Bodirsky, Hubie Chen:
  Relatively quantified constraint satisfaction. 3-15
  
• David Stynes, Kenneth N. Brown:
  Value ordering for quantified CSPs. 16-37
  
• Uwe Egly, Martina Seidl, Stefan Woltran:
  A solver for QBFs in negation normal form. 38-79
  
• Luca Pulina, Armando Tacchella:
  A self-adaptive multi-engine solver for quantified Boolean formulas. 80-116
  
• Alexandre Goldsztejn, Claude Michel, Michel Rueher:
  Efficient handling of universally quantified inequalities. 117-135
  

Volume 14, Number 2, June 2009

• S. Armagan Tarim, Brahim Hnich, Roberto Rossi, Steven David Prestwich:
  Cost-Based Filtering Techniques for Stochastic Inventory Control Under Service Level Constraints. 137-176
  
• Roie Zivan, Moshe Zazone, Amnon Meisels:
  Min-domain retroactive ordering for Asynchronous Backtracking. 177-198
  
• Ismel Brito, Amnon Meisels, Pedro Meseguer, Roie Zivan:
  Distributed constraint satisfaction with partially known constraints. 199-234
  
• Thibaut Feydy, Peter J. Stuckey:
  Propagating systems of dense linear integer constraints. 235-253
  
• Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara:
  Compiling finite linear CSP into SAT. 254-272
  
• Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau, Ashish Sabharwal:
  New filtering algorithms for combinations of among constraints. 273-292
  

Volume 14, Number 3, September 2009

• Christian Bessiere:
  Introduction to the special issue on the thirteenth international conference on principles and practice of constraint programming (CP 2007). 293
  
• Grégoire Dooms, Pascal Van Hentenryck, Laurent Michel:
  Model-driven visualizations of constraint-based local search. 294-324
  
• Matti Järvisalo, Tommi A. Junttila:
  Limitations of restricted branching in clause learning. 325-356
  
• Olga Ohrimenko, Peter J. Stuckey, Michael Codish:
  Propagation via lazy clause generation. 357-391
  
• Alessandro Zanarini, Gilles Pesant:
  Solution counting algorithms for constraint-centered search heuristics. 392-413
  

Volume 14, Number 4, December 2009

• Mark H. Liffiton, Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva, Karem A. Sakallah:
  A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. 415-442
  
• Christopher Mears, Maria Garcia de la Banda, Marc Wallace:
  On implementing symmetry detection. 443-477
  
• Ashish Sabharwal:
  SymChaff: exploiting symmetry in a structure-aware satisfiability solver. 478-505
  
• Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck, Magnus Ågren:
  Dynamic structural symmetry breaking for constraint satisfaction problems. 506-538
  
• Peter Nightingale:
  Non-binary quantified CSP: algorithms and modelling. 539-581