Table of Contents

• Reduced Cost-Based Ranking for Generating Promising SubproblemsMichela Milano, Willem Jan van Hoeve. 1-16 [doi]
• Integrating Constraint and Integer Programming for the Orthogonal Latin Squares ProblemGautam Appa, Ioannis Mourtos, Dimitris Magos. 17-32 [doi]
• On Optimal Correction of Inconsistent Linear ConstraintsPaula Amaral, Pedro Barahona. 33-46 [doi]
• Temporal Planning through Mixed Integer Programming: A Preliminary ReportYannis Dimopoulos, Alfonso Gerevini. 47-62 [doi]
• A New Multi-resource cumulatives Constraint with Negative HeightsNicolas Beldiceanu, Mats Carlsson. 63-79 [doi]
• On the Sum Constraint: Relaxation and ApplicationsTallys H. Yunes. 80-92 [doi]
• Global Constraints for Lexicographic OrderingsAlan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh. 93-108 [doi]
• A Global Filtering Algorithm for Handling Systems of Quadratic Equations and InequationsYahia Lebbah, Michel Rueher, Claude Michel. 109-123 [doi]
• Amplification of Search Performance through Randomization of HeuristicsVincent A. Cicirello, Stephen F. Smith. 124-138 [doi]
• Computing the Envelope for Stepwise-Constant Resource AllocationsNicola Muscettola. 139-154 [doi]
• Local Probing Applied to SchedulingOlli Kamarainen, Hani El Sakkout. 155-171 [doi]
• A Hybrid Approach for SATDjamal Habet, Chu Min Li, Laure Devendeville, Michel Vasquez. 172-184 [doi]
• Recovering and Exploiting Structural Knowledge from CNF FormulasRichard Ostrowski, Éric Grégoire, Bertrand Mazure, Lakhdar Sais. 185-199 [doi]
• Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula EvaluationLintao Zhang, Sharad Malik. 200-215 [doi]
• Accelerating Random WalksWei Wei, Bart Selman. 216-232 [doi]
• Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SATFrank Hutter, Dave A. D. Tompkins, Holger H. Hoos. 233-248 [doi]
• Learning and Solving Soft Temporal Constraints: An Experimental StudyFrancesca Rossi, Alessandro Sperduti, Kristen Brent Venable, Lina Khatib, Paul H. Morris, Robert A. Morris. 249-263 [doi]
• Opportunistic Specialization in Russian Doll SearchPedro Meseguer, Martí Sánchez, Gérard Verfaillie. 264-279 [doi]
• Range-Based Algorithm for Max-CSPThierry Petit, Jean-Charles Régin, Christian Bessière. 280-294 [doi]
• Resolution Complexity of Random ConstraintsDavid G. Mitchell. 295-309 [doi]
• Constraint Satisfaction, Bounded Treewidth, and Finite-Variable LogicsVíctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi. 310-326 [doi]
• Determining the Number of Solutions to Binary CSP InstancesOla Angelsmark, Peter Jonsson, Svante Linusson, Johan Thapper. 327-340 [doi]
• Consistency Checking for Qualitative Spatial Reasoning with Cardinal DirectionsSpiros Skiadopoulos, Manolis Koubarakis. 341-355 [doi]
• Open Constraint SatisfactionBoi Faltings, Santiago Macho-Gonzalez. 356-370 [doi]
• Beyond NP: Arc-Consistency for Quantified ConstraintsLucas Bordeaux, Eric Monfroy. 371-386 [doi]
• Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private InformationMakoto Yokoo, Koutarou Suzuki, Katsutoshi Hirayama. 387-401 [doi]
• A Dual Graph Translation of a Problem in Life Barbara M. Smith. 402-414 [doi]
• Groups and Constraints: Symmetry Breaking during SearchIan P. Gent, Warwick Harvey, Tom Kelsey. 415-430 [doi]
• Partial Symmetry BreakingIain McDonald, Barbara M. Smith. 431-445 [doi]
• Symmetry Breaking RevisitedJean-Francois Puget. 446-461 [doi]
• Breaking Row and Column Symmetries in Matrix ModelsPierre Flener, Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Justin Pearson, Toby Walsh. 462-476 [doi]
• Solving the Kirkman s Schoolgirl Problem in a Few SecondsNicolas Barnier, Pascal Brisset. 477-491 [doi]
• Inferring Constraint Types in Constraint ProgrammingDavid Lesaint. 492-507 [doi]
• Model-Based Programming: Controlling Embedded Systems by Reasoning About Hidden StateBrian C. Williams, Michel D. Ingham. 508-524 [doi]
• The Adaptive Constraint EngineSusan L. Epstein, Eugene C. Freuder, Richard J. Wallace, Anton Morozov, Bruce Samuels. 525-542 [doi]
• Indexical-Based Solver LearningThi-Bich-Hanh Dao, Arnaud Lallouet, Andrei Legtchenko, Lionel Martin. 541-555 [doi]
• Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial AuctionsKevin Leyton-Brown, Eugene Nudelman, Yoav Shoham. 556-572 [doi]
• Restart Policies with Dependence among Runs: A Dynamic Programming ApproachYongshao Ruan, Eric Horvitz, Henry A. Kautz. 573-586 [doi]
• Visopt ShopFloor: On the Edge of Planning and SchedulingRoman Barták. 587-602 [doi]
• Constraint Programming Contribution to Benders Decomposition: A Case StudyThierry Benoist, Etienne Gaudin, Benoît Rottembourg. 603-617 [doi]
• Modeling Camera Control with Constrained HypertubesMarc Christie, Eric Languénou, Laurent Granvilliers. 618-632 [doi]
• Robust and Parallel Solving of a Network Design ProblemClaude Le Pape, Laurent Perron, Jean-Charles Régin, Paul Shaw. 633-648 [doi]
• Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with ConstraintsMuriel Lauvergne, Philippe David, Patrice Boizumault. 649-663 [doi]
• Communication and Computation in Distributed CSP AlgorithmsCèsar Fernández, Ramón Béjar, Bhaskar Krishnamachari, Carla P. Gomes. 664-679 [doi]
• Continuous First-Order Constraint Satisfactionwith Equality and Disequality ConstraintsStefan Ratschan. 680-685 [doi]
• A Relaxation of the Cumulative ConstraintJohn N. Hooker, Hong Yan. 686-690 [doi]
• Improving GSAT Using 2SATPeter J. Stuckey, Lei Zheng. 691-695 [doi]
• A Relational Constraint Solver for Model-Based EngineeringJakob Mauss, Frank Seelisch, Mugur M. Tatar. 696-701 [doi]
• Conflict-Based Repair Techniques for Solving Dynamic Scheduling ProblemsAbdallah Elkhyari, Christelle Guéret, Narendra Jussien. 702-707 [doi]
• Scaling Properties of Pure Random Walk on Random 3-SATAndrew J. Parkes. 708-713 [doi]
• Criticality and Parallelism in Structured SAT InstancesAndrea Roli. 714-719 [doi]
• Characterizing SAT Problems with the Row Convexity PropertyHachemi Bennaceur, Chu Min Li. 720-725 [doi]
• Interchangeability in Soft CSPsStefano Bistarelli, Boi Faltings, Nicoleta Neagu. 726-731 [doi]
• On Constraint Problems with Incompleteor Erroneous DataNeil Yorke-Smith, Carmen Gervet. 732-737 [doi]
• Heuristic Constraint PropagationMeinolf Sellmann, Warwick Harvey. 738-743 [doi]
• An Arc-Consistency Algorithm for the Minimum Weight All Different ConstraintMeinolf Sellmann. 744-749 [doi]
• Algebraic Properties of CSP Model OperatorsYat Chiu Law, Jimmy Ho-Man Lee. 750-754 [doi]
• AC-3::d:: an Efficient Arc-Consistency Algorithm with a Low Space-ComplexityMarc R. C. van Dongen. 755-760 [doi]
• Integrating Search Objects in Asynchronous Constraint SolvingGeorg Ringwelski. 761 [doi]
• Distributed Constraint-Based Railway SimulationHans Schlenker. 762 [doi]
• Symmetry Breaking in Peaceably Coexisting Armies of QueensKaren E. Petrie. 763 [doi]
• Batch Processing with Sequence Dependent Setup TimesPetr Vilím. 764 [doi]
• Interactive Heuristic Search AlgorithmTomás Müller. 765 [doi]
• On Constraint Problems with Incomplete or Erroneous DataNeil Yorke-Smith. 766 [doi]
• Design of a New Metaheuristic for MAXSAT ProblemsAndrea Roli. 767 [doi]
• Disjunctive and Continuous Constraint Satisfaction ProblemsMiguel A. Salido, Federico Barber. 768 [doi]
• Tuning Randomization in Backtrack Search SAT AlgorithmsInês Lynce, João P. Marques Silva. 769 [doi]
• Constraint Solving in Test-Data GenerationYuan Zhan. 770-771 [doi]
• Improving Cost Calculations for Global Constraints in Local SearchMarkus Bohlin. 772 [doi]
• A Modeling Framework for ConstraintsGerrit Renker. 773-774 [doi]
• A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree DesignLinda van Norden, Hans van Maaren. 775-776 [doi]
• A Concurrent Constraint Programming Approach for Trajectory Determination of Autonomous VehiclesLuis Quesada, Peter Van Roy. 777 [doi]
• Using Constraint Propagation to Accelerate Column Generation in Aircraft SchedulingMattias Grönkvist. 778 [doi]
• Solving and Learning Soft Temporal Constraints; Ceteris Paribus Statements Represented as Soft Constraints ProblemsKristen B. Venable. 779 [doi]
• A Partially Solved Form for Heterogeneous Constraints in Disjunctive Normal FormFrank Seelisch. 780 [doi]
• Models of Injection ProblemsBrahim Hnich, Toby Walsh. 781 [doi]
• Partial Symmetry BreakingIain McDonald. 782 [doi]
• Automatic Generation of Implied Clauses for SATLyndon Drake, Alan M. Frisch, Toby Walsh. 783 [doi]
• Bridging the Gap between SAT and CSPCarlos Ansótegui, Felip Manyà. 784-785 [doi]
• Reducing Symmetry in Matrix ModelsZeynep Kiziltan. 786 [doi]
• Studying Interchangeability in Constraint Satisfaction ProblemsNicoleta Neagu. 787-788 [doi]
• Constraint Modeling in the Context of Academic Task AssignmentRobert Glaubius, Berthe Y. Choueiry. 789 [doi]
• Design Tradeoffs for Autonomous Trading AgentsIoannis A. Vetsikas. 790-792 [doi]