Abstract is missing.
- Ten Challenges Redux: Recent Progress in Propositional Reasoning and SearchHenry A. Kautz, Bart Selman. 1-18 [doi]
- Automated Mechanism Design: A New Application Area for Search AlgorithmsTuomas Sandholm. 19-36 [doi]
- Languages versus Packages for Constraint Problem SolvingMark Wallace. 37-52 [doi]
- Constraint PatternsToby Walsh. 53-64 [doi]
- Control Abstractions for Local SearchPascal Van Hentenryck, Laurent Michel. 65-80 [doi]
- Improved Algorithms for Counting Solutions in Constraint Satisfaction ProblemsOla Angelsmark, Peter Jonsson. 81-95 [doi]
- Boosting Chaff s Performance by Incorporating CSP HeuristicsCarlos Ansótegui, Jose Larrubia, Felip Manyà. 96-107 [doi]
- Efficient CNF Encoding of Boolean Cardinality ConstraintsOlivier Bailleux, Yacine Boufkhad. 108-122 [doi]
- A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time WindowsRussell Bent, Pascal Van Hentenryck. 123-137 [doi]
- Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree SearchStefano Bistarelli, Philippe Codognet, Kin Chuen Hui, Jimmy Ho-Man Lee. 138-152 [doi]
- HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health CareStéphane Bourdais, Philippe Galinier, Gilles Pesant. 153-167 [doi]
- Constraint-Based Optimization with the Minimax Decision CriterionCraig Boutilier, Relu Patrascu, Pascal Poupart, Dale Schuurmans. 168-182 [doi]
- An Algebraic Approach to Multi-sorted ConstraintsAndrei A. Bulatov, Peter Jeavons. 183-198 [doi]
- Periodic Constraint Satisfaction Problems: Polynomial-Time AlgorithmsHubie Chen. 199-213 [doi]
- Box Constraint Collections for Adhoc ConstraintsChi Kan Cheng, Jimmy Ho-Man Lee, Peter J. Stuckey. 214-228 [doi]
- Propagation Redundancy in Redundant ModellingChiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey. 229-243 [doi]
- Soft Constraints: Complexity and MultimorphismsDavid A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin. 244-258 [doi]
- Constraint Satisfaction Differential ProblemsJorge Cruz, Pedro Barahona. 259-273 [doi]
- A Wealth of SAT Distributions with Planted AssignmentsTassos Dimitriou. 274-287 [doi]
- Redundant Modeling for the QuasiGroup Completion ProblemIván Dotú, Alvaro del Val, Manuel Cebrián. 288-302 [doi]
- Open Constraint OptimizationBoi Faltings, Santiago Macho-Gonzalez. 303-317 [doi]
- Constraints for Breaking More Row and Column SymmetriesAlan M. Frisch, Christopher Jefferson, Ian Miguel. 318-332 [doi]
- Generic SBDD Using Computational Group TheoryIan P. Gent, Warwick Harvey, Tom Kelsey, Steve Linton. 333-347 [doi]
- Using Stochastic Local Search to Solve Quantified Boolean FormulaeIan P. Gent, Holger H. Hoos, Andrew G. D. Rowley, Kevin Smyth. 348-362 [doi]
- Solving Max-SAT as Weighted CSPSimon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex. 363-376 [doi]
- Constraint Reasoning over StringsKeith Golden, Wanlin Pang. 377-391 [doi]
- Tractability by Approximating Constraint LanguagesMartin J. Green, David A. Cohen. 392-406 [doi]
- A Hybrid Constraint Programming and Semidefinite Programming Approach for the Stabe Set ProblemWillem Jan van Hoeve. 407-421 [doi]
- A Constraint-Aided Conceptual Design Environment for Autodesk InventorAlan Holland, Barry O Callaghan, Barry O Sullivan. 422-436 [doi]
- Fast Bound Consistency for the Global Cardinality ConstraintIrit Katriel, Sven Thiel. 437-451 [doi]
- Propagating N-Ary Rigid-Body ConstraintsLudwig Krippahl, Pedro Barahona. 452-465 [doi]
- Solving Still Life with Soft Constraints and Bucket EliminationJavier Larrosa, Enric Morancho. 466-479 [doi]
- Exploiting Multidirectionality in Coarse-Grained Arc Consistency AlgorithmsChristophe Lecoutre, Frédéric Boussemart, Fred Hemery. 480-494 [doi]
- Local-Search Techniques for Propositional Logic Extended with Cardinality ConstraintsLengning Liu, Miroslaw Truszczynski. 495-509 [doi]
- Discrepancy-Based Additive Bounding for the AllDifferent ConstraintAndrea Lodi, Michela Milano, Louis-Martin Rousseau. 510-524 [doi]
- A Synthesis of Constraint Satisfaction and Constraint SolvingMichael J. Maher. 525-539 [doi]
- Maintaining Longest Paths IncrementallyLaurent Michel, Pascal Van Hentenryck. 540-554 [doi]
- Resolution and Constraint SatisfactionDavid G. Mitchell. 555-569 [doi]
- Generating High Quality Schedules for a Spacecraft Memory Downlink ProblemAngelo Oddi, Nicola Policella, Amedeo Cesta, Gabriella Cortellessa. 570-584 [doi]
- Symmetry Breaking Using StabilizersJean-Francois Puget. 585-599 [doi]
- An Efficient Bounds Consistency Algorithm for the Global Cardinality ConstraintClaude-Guy Quimper, Peter van Beek, Alejandro López-Ortiz, Alexander Golynski, Sayyed Bashir Sadjad. 600-614 [doi]
- Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many InequalitiesStefan Ratschan. 615-633 [doi]
- Using Constraint Programming to Solve the Maximum Clique ProblemJean-Charles Régin. 634-648 [doi]
- Greater Efficiency for Conditional Constraint SatisfactionMihaela Sabin, Eugene C. Freuder, Richard J. Wallace. 649-663 [doi]
- Incremental Computation of Resource-Envelopes in Producer-Consumer ModelsT. K. Satish Kumar. 664-678 [doi]
- Approximated Consistency for Knapsack ConstraintsMeinolf Sellmann. 679-693 [doi]
- Cost-Based Filtering for Shorter Path ConstraintsMeinolf Sellmann. 694-708 [doi]
- Bounded Backtracking for the Valued Constraint Satisfaction ProblemsCyril Terrioux, Philippe Jégou. 709-723 [doi]
- Consistency and Propagation with Multiset Constraints: A Formal ViewpointToby Walsh. 724-738 [doi]
- Pruning while Sweeping over Task IntervalsArmin Wolf. 739-753 [doi]
- Improving Backtrack Search for Solving the TCSPLin Xu, Berthe Y. Choueiry. 754-768 [doi]
- Certainty Closure: A Framework for Reliable Constraint Reasoning with UncertaintyNeil Yorke-Smith, Carmen Gervet. 769-783 [doi]
- clp(pdf(y)): Constraints for Probabilistic Reasoning in Logic ProgrammingNicos Angelopoulos. 784-788 [doi]
- To Be or Not to Be ... a Global ConstraintChristian Bessière, Pascal Van Hentenryck. 789-794 [doi]
- Constraint Programming for Modelling and Solving Modal SatisfabilitySebastian Brand, Rosella Gennari, Maarten de Rijke. 795-800 [doi]
- Distributed Forward CheckingIsmel Brito, Pedro Meseguer. 801-806 [doi]
- A New Classs of Binary CSPs for which Arc-Constistency Is a Decision ProcedureDavid A. Cohen. 807-811 [doi]
- Semi-automatic Modeling by Constraint AcquisitionRemi Coletta, Christian Bessière, Barry O Sullivan, Eugene C. Freuder, Sarah O Connell, Joël Quinqueton. 812-816 [doi]
- Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness CostsEmilie Danna, Laurent Perron. 817-821 [doi]
- Using the Breakout Algorithm to Identify Hard and Unsolvable SubproblemsCarlos Eisenberg, Boi Faltings. 822-826 [doi]
- Toy(FD): Sketch of Operational SemanticsAntonio J. Fernández, Maria Teresa Hortalá-González, Fernando Sáenz-Pérez. 827-831 [doi]
- Scheduling in the Face of Uncertain Resource Consumption and UtilityJeremy Frank, Richard Dearden. 832-836 [doi]
- Supertree Construction with Constraint ProgrammingIan P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei. 837-841 [doi]
- (In)Effectiveness of Look-Ahead Techniques in a Modern SAT SolverEnrico Giunchiglia, Marco Maratea, Armando Tacchella. 842-846 [doi]
- Reduce and Assign: A Constraint Logic Programming and Local Search Integration Framework to Solve Combinatorial Search ProblemsNuno Gomes, Zita A. Vale, Carlos Ramos. 847-852 [doi]
- A Canonicity Test for ConfigurationStéphane Grandcolas, Laurent Henocque, Nicolas Prcovic. 853-857 [doi]
- Improved Algorithms for Max-restricted Path ConsistencyFabrizio Grandoni, Giuseppe F. Italiano. 858-862 [doi]
- CP-IP Techniques for the Bid Evaluation in Combinatorial AuctionsAlessio Guerri, Michela Milano. 863-867 [doi]
- A Two-Level Search Strategy for Packing Unequal Circles into a Circle ContainerWen-Qi Huang, Yu Li, Bernard Jurkowiak, Chu Min Li, Ru Chu Xu. 868-872 [doi]
- Unrestricted Nogood Recording in CSP SearchGeorge Katsirelos, Fahiem Bacchus. 873-877 [doi]
- Constraints over OntologiesFrançois Laburthe. 878-882 [doi]
- Using Constraints for Exploring CatalogsFrançois Laburthe, Yves Caseau. 883-888 [doi]
- Intermediate (Learned) ConsistenciesArnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali. 889-893 [doi]
- Semi-independent Partitioning: A Method for Bounding the Solution to COP sDavid Larkin. 894-898 [doi]
- Boosting as a Metaphor for Algorithm DesignKevin Leyton-Brown, Eugene Nudelman, Galen Andrew, Jim McFadden, Yoav Shoham. 899-903 [doi]
- An Efficient Filtering Algorithm for Disjunction of ConstraintsOlivier Lhomme. 904-908 [doi]
- INCOP: An Open Library for INcomplete Combinatorial OPtimizationBertrand Neveu, Gilles Trombettoni. 909-913 [doi]
- A Composition Algorithm for Very Hard Graph 3-Colorability InstancesSeiichi Nishihara, Kazunori Mizuno, Kohsuke Nishihara. 914-919 [doi]
- Efficient Represenation of Discrete Sets for Constraint ProgrammingShuji Ohnishi, Hiroaki Tasaka, Naoyuki Tamura. 920-924 [doi]
- Applying Interchangeability Techniques to the Distributed Breakout AlgorithmAdrian Petcu, Boi Faltings. 925-929 [doi]
- Symmetry Breaking in Graceful GraphsKaren E. Petrie, Barbara M. Smith. 930-934 [doi]
- Tree Local SearchNicolas Prcovic. 935-939 [doi]
- A SAT-Based Approach to Multiple Sequence AlignmentSteven David Prestwich, Desmond G. Higgins, Orla O Sullivan. 940-944 [doi]
- Maintaining Dominance ConsistencyIgor Razgon, Amnon Meisels. 945-949 [doi]
- Terminating Decision Algorithms OptimallyTuomas Sandholm. 950-955 [doi]
- Scene Reconstruction Based on Constraints: Details on the Equation System DecompositionGilles Trombettoni, Marta Wilczkowiak. 956-961 [doi]
- A New Approach to Solving SAT-Encoded Binary CSPsCarlos Ansótegui. 962 [doi]
- FeReRA: A Multi-agent Approach to Constraint SatisfactionMuhammed Basharu. 963 [doi]
- Semantic Decomposition for Solving Distance ConstraintsHeikel Batnini, Michel Rueher. 964-965 [doi]
- Using Constraint Programming and Simulation for Execution Monitoring and On-Line Rescheduling with UncertaintyJulien Bidot. 966 [doi]
- On the Enhancement of the Informed Backtracking AlgorithmJlifi Boutheina, Khaled Ghédira. 967 [doi]
- Extending CLP with MetaheuristicsOle Boysen. 968 [doi]
- Self Configuring Constraint Programming SystemsTom Carchrae. 969 [doi]
- Interactive Tradeoff GenerationMoyra Duggan, Barry O Sullivan, Eugene C. Freuder. 970 [doi]
- Introducing ESRA, a Relational Language for Modelling Combinatorial ProblemsPierre Flener, Justin Pearson, Magnus Ågren. 971 [doi]
- Abstracting Constraints Using ConstraintsJames Gibbons. 972 [doi]
- Sensitivity Analysis in CSPsDiarmuid Glynn. 973 [doi]
- Solution Stability in Constraint Satisfaction ProblemsEmmanuel Hebrard. 974 [doi]
- distn: An Euclidean Distance Global ConstraintMichael Heusch. 975 [doi]
- Algorithmic Mechanism Design and ConstraintsAlan Holland, Barry O Sullivan. 976 [doi]
- Preference Constraints: New Global Soft Constraints Dedicated to Preference Binary RelationsRémy-Robert Joseph, Peter Chan, Michael Hiroux, Georges Weil. 977 [doi]
- Optimising the Representation and Evaluation of Semiring Combination ConstraintsJerome Kelleher, Barry O Sullivan. 978 [doi]
- Symmetry Breaking Ordering ConstraintsZeynep Kiziltan. 979 [doi]
- Observation of Constraint ProgramsLudovic Langevine. 980 [doi]
- Search ProgrammingWojciech Legierski. 981 [doi]
- Exploiting Microstructure in CSPsChavalit Likitvivatanavong. 982 [doi]
- Using Case-Based Reasoning to Write Constraint ProgramsJames Little, Cormac Gebruers, Derek G. Bridge, Eugene C. Freuder. 983 [doi]
- Reformulation Techniques for a Class of Permutation ProblemsToni Mancini. 984 [doi]
- NuSBDS: An Easy to Use Symmetry Breaking SystemIain McDonald. 985 [doi]
- Interactivity in Constraint ProgrammingTomás Müller. 986 [doi]
- Identifying Inconsistent CSPs by RelaxationTomas Eric Nordlander, Ken N. Brown, Derek H. Sleeman. 987 [doi]
- Useful ExplanationsBarry O Callaghan, Eugene C. Freuder, Barry O Sullivan. 988 [doi]
- Teacher and Learner Profiles for Constraint AcquisitionSarah O Connell, Barry O Sullivan, Eugene C. Freuder. 989 [doi]
- Comparison of Symmetry Breaking MethodsKaren E. Petrie. 990 [doi]
- Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SATJordi Planes. 991 [doi]
- Search for Mathematical ObjectsColin Quirke. 992 [doi]
- Explanations for Global ConstraintsGuillaume Rochart. 993 [doi]
- Watching Clauses in Quantified Boolean FormulaeAndrew G. D. Rowley. 994 [doi]
- Distributed Constraint-Based Railway SimulationHans Schlenker. 995 [doi]
- Dynamic Step Size Adjustment in Iterative Deepening SearchDaniel Sheridan. 996 [doi]
- Learning Good Variable OrderingsPaula Sturdy. 997 [doi]
- An Adaptive Controller for Real-Time Resolution of the Vehicle Routing ProblemAnn Tighe, Finlay S. Smith, Gerard Lyons. 998 [doi]
- alpha-Dynamic Controllability of Simple Temporal Problems with Preferences and UncertaintyKristen Brent Venable. 999 [doi]
- Computing Explanations for Global Scheduling ConstraintsPetr Vilím. 1000 [doi]
- Restart Strategies: Analysis and SimulationHuayue Wu, Peter van Beek. 1001 [doi]
- OpenSolver: A Coordination-Enabled Abstract Branch-and-Prune Tree Search EnginePeter Zoeteweij. 1002 [doi]