Table of Contents

• Search and Inference in AI PlanningHector Geffner. 1-4 [doi]
• OWL: A Description Logic Based Ontology LanguageIan Horrocks. 5-8 [doi]
• Preference ReasoningFrancesca Rossi. 9-12 [doi]
• The G12 Project: Mapping Solver Independent Models to Efficient SolutionsPeter J. Stuckey, Maria J. García de la Banda, Michael J. Maher, Kim Marriott, John K. Slaney, Zoltan Somogyi, Mark Wallace, Toby Walsh. 13-16 [doi]
• Symmetry Definitions for Constraint Satisfaction ProblemsDavid A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith. 17-31 [doi]
• Dynamic Ordering for Asynchronous Backtracking on DisCSPsRoie Zivan, Amnon Meisels. 32-46 [doi]
• Incremental Algorithms for Local Search from Existential Second-Order LogicMagnus Ågren, Pierre Flener, Justin Pearson. 47-61 [doi]
• Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length JobsKonstantin Artiouchine, Philippe Baptiste. 62-76 [doi]
• Mind the Gaps: A New Splitting Strategy for Consistency TechniquesHeikel Batnini, Claude Michel, Michel Rueher. 77-91 [doi]
• Graph Invariants as Necessary Conditions for Global ConstraintsNicolas Beldiceanu, Mats Carlsson, Jean-Xavier Rampon, Charlotte Truchet. 92-106 [doi]
• Allocation and Scheduling for MPSoCs via Decomposition and No-Good GenerationLuca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano. 107-121 [doi]
• Sub-optimality ApproximationsRussell Bent, Irit Katriel, Pascal Van Hentenryck. 122-136 [doi]
• A Linear-Logic Semantics for Constraint Handling RulesHariolf Betz, Thom W. Frühwirth. 137-151 [doi]
• Distributed Stable Matching ProblemsIsmel Brito, Pedro Meseguer. 152-166 [doi]
• Beyond Hypertree Width: Decomposition Methods Without DecompositionsHubie Chen, Víctor Dalmau. 167-181 [doi]
• Ad-hoc Global Constraints for LifeKenil C. K. Cheng, Roland H. C. Yap. 182-195 [doi]
• Tractable Clones of Polynomials over SemigroupsVíctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien. 196-210 [doi]
• CP(Graph): Introducing a Graph Computation Domain in Constraint ProgrammingGrégoire Dooms, Yves Deville, Pierre Dupont. 211-225 [doi]
• Interval Analysis in SchedulingJérôme Fortin, Pawel Zielinski, Didier Dubois, Hélène Fargier. 226-240 [doi]
• Assumption-Based Pruning in Conditional CSPFelix Geller, Michael Veksler. 241-255 [doi]
• Conditional Symmetry BreakingIan P. Gent, Tom Kelsey, Steve Linton, Iain McDonald, Ian Miguel, Barbara M. Smith. 256-270 [doi]
• Symmetry and ConsistencyIan P. Gent, Tom Kelsey, Steve Linton, Colva M. Roney-Dougal. 271-285 [doi]
• Solving the MOLR and Social Golfers ProblemsWarwick Harvey, Thorsten Winterer. 286-300 [doi]
• Advances in Polytime Isomorph Elimination for ConfigurationLaurent Henocque, Mathias Kleiner, Nicolas Prcovic. 301-313 [doi]
• Planning and Scheduling to Minimize TardinessJohn N. Hooker. 314-327 [doi]
• Search Heuristics and Heavy-Tailed BehaviourTudor Hulubei, Barry O Sullivan. 328-342 [doi]
• 2-Way vs. d-Way Branching for CSPJoey Hwang, David G. Mitchell. 343-357 [doi]
• Maintaining Longest Paths in Cyclic GraphsIrit Katriel, Pascal Van Hentenryck. 358-372 [doi]
• Applying Constraint Programming to Rigid Body Protein DockingLudwig Krippahl, Pedro Barahona. 373-387 [doi]
• Maximum Constraint Satisfaction on DiamondsAndrei A. Krokhin, Benoit Larose. 388-402 [doi]
• Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT SolversChu Min Li, Felip Manyà, Jordi Planes. 403-414 [doi]
• Generalized Conflict Learning for Hybrid Discrete/Linear OptimizationHui Li 0002, Brian Williams. 415-429 [doi]
• Parallel Local Search in CometLaurent Michel, Pascal Van Hentenryck. 430-444 [doi]
• Generating Corrective Explanations for Interactive Constraint SatisfactionBarry O Callaghan, Barry O Sullivan, Eugene C. Freuder. 445-459 [doi]
• SPREAD: A Balancing Constraint Based on StatisticsGilles Pesant, Jean-Charles Régin. 460-474 [doi]
• Automatic Detection of Variable and Value SymmetriesJean-Francois Puget. 475-489 [doi]
• Breaking All Value Symmetries in Surjection ProblemsJean-Francois Puget. 490-504 [doi]
• AC-*: A Configurable, Generic and Adaptive Arc Consistency AlgorithmJean-Charles Régin. 505-519 [doi]
• Maintaining Arc Consistency Algorithms During the Search Without Additional Space CostJean-Charles Régin. 520-533 [doi]
• Weak Composition for Qualitative Spatial and Temporal ReasoningJochen Renz, Gérard Ligozat. 534-548 [doi]
• Boosting Distributed Constraint SatisfactionGeorg Ringwelski, Youssef Hamadi. 549-562 [doi]
• Depth-First Mini-Bucket EliminationEmma Rollon, Javier Larrosa. 563-577 [doi]
• Using SAT in QBFHorst Samulowitz, Fahiem Bacchus. 578-592 [doi]
• Tree Decomposition with Function FilteringMartí Sánchez, Javier Larrosa, Pedro Meseguer. 593-606 [doi]
• On Solving Soft Temporal Constraints Using SAT TechniquesHossein M. Sheini, Bart Peintner, Karem A. Sakallah, Martha E. Pollack. 607-621 [doi]
• Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic ProgrammingKish Shen, Joachim Schimpf. 622-636 [doi]
• Caching Search States in Permutation ProblemsBarbara M. Smith. 637-651 [doi]
• Repair-Based Methods for Quantified CSPsKostas Stergiou. 652-666 [doi]
• Handling Implication and Universal Quantification Constraints in FLUXMichael Thielscher. 667-681 [doi]
• Solving Simple Planning Problems with More Inference and No SearchVincent Vidal, Hector Geffner. 682-696 [doi]
• Solving Large-Scale Nonlinear Programming Problems by Constraint PartitioningBenjamin W. Wah, Yixin Chen. 697-711 [doi]
• Factor Analytic Studies of CSP HeuristicsRichard Wallace. 712-726 [doi]
• Lookahead Saturation with Restriction for SATAnbulagan, John K. Slaney. 727-731 [doi]
• Evolving Variable-Ordering Heuristics for Constrained OptimisationStuart Bain, John Thornton, Abdul Sattar. 732-736 [doi]
• Multi-point Constructive SearchJ. Christopher Beck. 737-741 [doi]
• Bounds of Graph CharacteristicsNicolas Beldiceanu, Thierry Petit, Guillaume Rochart. 742-746 [doi]
• Acquiring Parameters of Implied Global ConstraintsChristian Bessière, Remi Coletta, Thierry Petit. 747-751 [doi]
• Integrating Benders Decomposition Within Constraint ProgrammingHadrien Cambazard, Narendra Jussien. 752-756 [doi]
• Using Boolean Constraint Propagation for Sub-clauses DeductionSylvain Darras, Gilles Dequen, Laure Devendeville, Bertrand Mazure, Richard Ostrowski, Lakhdar Sais. 757-761 [doi]
• Extending Systematic Local Search for Job Shop Scheduling ProblemsBistra N. Dilkina, Lei Duan, William S. Havens. 762-766 [doi]
• Interactive Reconfiguration in Power Supply RestorationTarik Hadzic, Henrik Reif Andersen. 767-771 [doi]
• Neighbourhood Clause Weight Redistribution in Local Search for SATAbdelraouf Ishtaiwi, John Thornton, Abdul Sattar, Duc Nghia Pham. 772-776 [doi]
• Computing and Exploiting Tree-Decompositions for Solving Constraint NetworksPhilippe Jégou, Samba Ndiaye, Cyril Terrioux. 777-781 [doi]
• Encoding Requests to Web Service Compositions as ConstraintsAlexander Lazovik, Marco Aiello, Rosella Gennari. 782-786 [doi]
• Test Instance Generation for MAX 2SATMistuo Motoki. 787-791 [doi]
• Consistency for Quantified Constraint Satisfaction ProblemsPeter Nightingale. 792-796 [doi]
• Alternate Modeling in Sport SchedulingLaurent Perron. 797-801 [doi]
• Approximations in Distributed OptimizationAdrian Petcu, Boi Faltings. 802-806 [doi]
• Extremal CSPsNicolas Prcovic. 807-811 [doi]
• Beyond Finite Domains: The All Different and Global Cardinality ConstraintsClaude-Guy Quimper, Toby Walsh. 812-816 [doi]
• Views and Iterators for Generic Constraint ImplementationsChristian Schulte, Guido Tack. 817-821 [doi]
• Approximated Consistency for the Automatic Recording ProblemMeinolf Sellmann. 822-826 [doi]
• Towards an Optimal CNF Encoding of Boolean Cardinality ConstraintsCarsten Sinz. 827-831 [doi]
• Approximate Constrained Subgraph MatchingStéphane Zampelli, Yves Deville, Pierre Dupont. 832-836 [doi]
• Distributed Constraints for Large-Scale Scheduling ProblemsMontserrat Abril, Miguel A. Salido, Federico Barber. 837 [doi]
• Solving Over-Constrained Problems with SATJosep Argelich, Felip Manyà. 838 [doi]
• A Constraint Based Agent for TAC-SCMDavid A. Burke, Kenneth N. Brown. 839 [doi]
• Solving the Car-Sequencing Problem as a Non-binary CSPMihaela Butaru, Zineb Habbas. 840 [doi]
• Dimensioning an Inbound Call Center Using Constraint ProgrammingCyril Canon, Jean-Charles Billaut, Jean-Louis Bouquard. 841 [doi]
• Methods to Learn Abstract Scheduling ModelsTom Carchrae, J. Christopher Beck, Eugene C. Freuder. 842 [doi]
• Automated Search for Heuristic FunctionsPavel Cejnar, Roman Barták. 843 [doi]
• Constraint-Based Inference: A Bridge Between Constraint Processing and Probability InferenceLe Chang, Alan K. Mackworth. 844 [doi]
• Scheduling Social TournamentsIván Dotú, Alvaro del Val, Pascal Van Hentenryck. 845 [doi]
• Domain Reduction for the Circuit ConstraintLatife Genç Kaya, John N. Hooker. 846 [doi]
• Using Constraint Programming for Solving Distance CSP with UncertaintyCarlos Grandón, Bertrand Neveu. 847 [doi]
• Improved Algorithm for Finding (a, b)-Super SolutionsEmmanuel Hebrard, Toby Walsh. 848 [doi]
• Local Consistency in Weighted CSPs and Inference in Max-SATFederico Heras, Javier Larrosa. 849 [doi]
• Modeling Constraint Programs with Software Technology StandardsMatthias Hoche, Stefan Jähnichen. 850 [doi]
• Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction ProblemsChris Houghton, David A. Cohen. 851 [doi]
• Mechanism Design for Preference Aggregation over CoalitionsEric I. Hsu, Sheila A. McIlraith. 852 [doi]
• LP as a Global Search Heuristic Across Different Constrainedness RegionsLucian Leahu, Carla P. Gomes. 853 [doi]
• Consistency for Partially Defined ConstraintsAndrei Legtchenko, Arnaud Lallouet. 854 [doi]
• Subnet Generation Problem: A New Network Routing ProblemCheuk Fun Bede Leung, Barry Richards, Olli Kamarainen. 855 [doi]
• Partial Redundant ModelingTiziana Ligorio, Susan L. Epstein. 856 [doi]
• AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming ProblemsRadu Marinescu 0002, Rina Dechter. 857 [doi]
• Weak Symmetries in Problem FormulationsRoland Martin, Karsten Weihe. 858 [doi]
• Towards the Systematic Generation of Channelling ConstraintsBernadette Martínez Hernández, Alan M. Frisch. 859 [doi]
• AND/OR Search Spaces and the Semantic Width of Constraint NetworksRobert Mateescu, Rina Dechter. 860 [doi]
• Statistical Modelling of CSP Solving Algorithms PerformanceRamón Béjar, Cèsar Fernández, Carles Mateu. 861 [doi]
• Probabilistic Arc ConsistencyDeepak Mehta, Marc R. C. van Dongen. 862 [doi]
• GOOSE - A Generic Object-Oriented Search EnvironmentHenry Müller, Stefan Jähnichen. 863 [doi]
• Randomization for Multi-agent Constraint OptimizationQuang Nguyen, Boi Faltings. 864 [doi]
• Uncertainty in Soft Constraint ProblemsMaria Silvia Pini, Francesca Rossi. 865 [doi]
• Speeding Up Constrained Path Solvers with a Reachability PropagatorLuis Quesada, Peter Van Roy, Yves Deville. 866 [doi]
• From Linear Relaxations to Global Constraint PropagationClaude-Guy Quimper, Alejandro López-Ortiz. 867 [doi]
• Encoding HTN Planning as a Dynamic CSPPavel Surynek, Roman Barták. 868 [doi]
• Specialised Constraints for Stable Matching ProblemsChris Unsworth, Patrick Prosser. 869 [doi]
• Bounds-Consistent Local SearchStefania Verachi, Steven David Prestwich. 870 [doi]
• Robust Constraint Solving Using Multiple HeuristicsAlfio Vidotto, Kenneth N. Brown, J. Christopher Beck. 871 [doi]
• Scheduling with Uncertain Start DatesChristine Wu, Kenneth N. Brown, J. Christopher Beck. 872 [doi]
• The Role of Redundant Clauses in Solving Satisfiability ProblemsHonglei Zeng, Sheila A. McIlraith. 873 [doi]
• Applying Decomposition Methods to Crossword Puzzle ProblemsYaling Zheng, Berthe Y. Choueiry. 874 [doi]
• Asymmetric Distributed Constraints Satisfaction ProblemsRoie Zivan, Amnon Meisels. 875 [doi]
• Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite DomainsJosef Zlomek, Roman Barták. 876 [doi]
• CoJava: A Unified Language for Simulation and OptimizationAlexander Brodsky, Hadon Nash. 877-877 [doi]
• Programming with TOY(FD)Antonio J. Fernández, Maria Teresa Hortalá-González, Fernando Sáenz-Pérez. 878-878 [doi]
• Computing Super-SchedulesEmmanuel Hebrard, Paul Tyler, Toby Walsh. 879-879 [doi]
• Proterv-II: An Integrated Production Planning and Scheduling SystemAndrás Kovács, Péter Egri, Tamás Kis, József Váncza. 880-880 [doi]
• The Comet Programming Language and SystemLaurent Michel, Pascal Van Hentenryck. 881-881 [doi]
• Random Stimuli Generation for Functional Hardware Verification as a CP ApplicationYehuda Naveh, Roy Emek. 882-882 [doi]
• A BDD-Based Interactive Configurator for Modular SystemsErik Meer. 883-883 [doi]