| Search and inference in AI planning | p. 1 |
| OWL : a description logic based ontology language | p. 5 |
| Preference reasoning | p. 9 |
| The G12 project : mapping solver independent models to efficient solutions | p. 13 |
| Symmetry definitions for constraint satisfaction problems | p. 17 |
| Dynamic ordering for asynchronous backtracking on DisCSPs | p. 32 |
| Incremental algorithms for local search from existential second-order logic | p. 47 |
| Inter-distance constraint : an extension of the all-different constraint for scheduling equal length jobs | p. 62 |
| Mind the gaps : a new splitting strategy for consistency techniques | p. 77 |
| Graph invariants as necessary conditions for global constraints | p. 92 |
| Allocation and scheduling for MPSoCs via decomposition and no-good generation | p. 107 |
| Sub-optimality approximations | p. 122 |
| A linear-logic semantics for constraint handling rules | p. 137 |
| Distributed stable matching problems | p. 152 |
| Beyond hypertree width : decomposition methods without decompositions | p. 167 |
| Ad-hoc global constraints for life | p. 182 |
| Tractable clones of polynomials over semigroups | p. 196 |
| CP(Graph) : introducing a graph computation domain in constraint programming | p. 211 |
| Interval analysis in scheduling | p. 226 |
| Assumption-based pruning in conditional CSP | p. 241 |
| Conditional symmetry breaking | p. 256 |
| Symmetry and consistency | p. 271 |
| Solving the MOLR and social golfers problems | p. 286 |
| Advances in polytime isomorph elimination for configuration | p. 301 |
| Planning and scheduling to minimize tardiness | p. 314 |
| Search heuristics and heavy-tailed behaviour | p. 328 |
| 2-way vs. d-way branching for CSP | p. 343 |
| Maintaining longest paths in cyclic graphs | p. 358 |
| Applying constraint programming to rigid body protein docking | p. 373 |
| Maximum constraint satisfaction on diamonds | p. 388 |
| Exploiting unit propagation to compute lower bounds in branch and bound max-SAT solvers | p. 403 |
| Generalized conflict learning for hybrid discrete/linear optimization | p. 415 |
| Parallel local search in Comet | p. 430 |
| Generating corrective explanations for interactive constraint satisfaction | p. 445 |
| spREad : a balancing constraint based on statistics | p. 460 |
| Automatic detection of variable and value symmetries | p. 475 |
| Breaking all value symmetries in surjection problems | p. 490 |
| AC-* : a configurable, generic and adaptive arc consistency algorithm | p. 505 |
| Maintaining arc consistency algorithms during the search without additional space cost | p. 520 |
| Weak composition for qualitative spatial and temporal reasoning | p. 534 |
| Boosting distributed constraint satisfaction | p. 549 |
| Depth-first mini-bucket elimination | p. 563 |
| Using SAT in QBF | p. 578 |
| Tree decomposition with function filtering | p. 593 |
| On solving soft temporal constraints using SAT techniques | p. 607 |
| Eplex : harnessing mathematical programming solvers for constraint logic programming | p. 622 |
| Caching search states in permutation problems | p. 637 |
| Repair-based methods for quantified CSPs | p. 652 |
| Handling implication and universal quantification constraints in FLUX | p. 667 |
| Solving simple planning problems with more inference and no search | p. 682 |
| Solving large-scale nonlinear programming problems by constraint partitioning | p. 697 |
| Factor analytic studies of CSP heuristics | p. 712 |
| Lookahead saturation with restriction for SAT | p. 727 |
| Evolving variable-ordering heuristics for constrained optimisation | p. 732 |
| Multi-point constructive search | p. 737 |
| Bounds of graph characteristics | p. 742 |
| Acquiring parameters of implied global constraints | p. 747 |
| Integrating benders decomposition within constraint programming | p. 752 |
| Using boolean constraint propagation for sub-clauses deduction | p. 757 |
| Extending systematic local search for job shop scheduling problems | p. 762 |
| Interactive reconfiguration in power supply restoration | p. 767 |
| Neighbourhood clause weight redistribution in local search for SAT | p. 772 |
| Computing and exploiting tree-decompositions for solving constraint networks | p. 777 |
| Encoding requests to Web service compositions as constraints | p. 782 |
| Test instance generation for MAX 2SAT | p. 787 |
| Consistency for quantified constraint satisfaction problems | p. 792 |
| Alternate modeling in sport scheduling | p. 797 |
| Approximations in distributed optimization | p. 802 |
| Extremal CSPs | p. 807 |
| Beyond finite domains : the all different and global cardinality constraints | p. 812 |
| Views and iterators for generic constraint implementations | p. 817 |
| Approximated consistency for the automatic recording problem | p. 822 |
| Towards an optimal CNF encoding of boolean cardinality constraints | p. 827 |
| Approximate constrained subgraph matching | p. 832 |
| Distributed constraints for large-scale scheduling problems | p. 837 |
| Solving over-constrained problems with SAT | p. 838 |
| A constraint based agent for TAC-SCM | p. 839 |
| Solving the car-sequencing problem as a non-binary CSP | p. 840 |
| Dimensioning an inbound call center using constraint programming | p. 841 |
| Methods to learn abstract scheduling models | p. 842 |
| Automated search for heuristic functions | p. 843 |
| Constraint-based inference : a bridge between constraint processing and probability inference | p. 844 |
| Scheduling social tournaments | p. 845 |
| Domain reduction for the circuit constraint | p. 846 |
| Using constraint programming for solving distance CSP with uncertainty | p. 847 |
| Improved algorithm for finding (a,b)-super solutions | p. 848 |
| Local consistency in weighted CSPs and inference in Max-SAT | p. 849 |
| Modeling constraint programs with software technology standards | p. 850 |
| Solution equivalent subquadrangle reformulations of constraint satisfaction problems | p. 851 |
| Mechanism design for preference aggregation over coalitions | p. 852 |
| LP as a global search heuristic across different constrainedness regions | p. 853 |
| Consistency for partially defined constraints | p. 854 |
| Subnet generation problem : a new network routing problem | p. 855 |
| Partial redundant modeling | p. 856 |
| AND/OR branch-and-bound for solving mixed integer linear programming problems | p. 857 |
| Weak symmetries in problem formulations | p. 858 |
| Towards the systematic generation of channelling constraints | p. 859 |
| AND/OR search spaces and the semantic width of constraint networks | p. 860 |
| Statistical modelling of CSP solving algorithms performance | p. 861 |
| Probabilistic arc consistency | p. 862 |
| GOOSE - a generic object-oriented search environment | p. 863 |
| Randomization for multi-agent constraint optimization | p. 864 |
| Uncertainty in soft constraint problems | p. 865 |
| Speeding up constrained path solvers with a reachability propagator | p. 866 |
| From linear relaxations to global constraint propagation | p. 867 |
| Encoding HTN planning as a dynamic CSP | p. 868 |
| Specialised constraints for stable matching problems | p. 869 |
| Bounds-consistent local search | p. 870 |
| Robust constraint solving using multiple heuristics | p. 871 |
| Scheduling with uncertain start dates | p. 872 |
| The role of redundant clauses in solving satisfiability problems | p. 873 |
| Applying decomposition methods to crossword puzzle problems | p. 874 |
| Asymmetric distributed constraints satisfaction problems | p. 875 |
| Full arc consistency in WCSP and in constraint hierarchies with finite domains | p. 876 |
| CoJava : a unified language for simulation and optimization | p. 877 |
| Programming with TOY(FD) | p. 878 |
| Computing super-schedules | p. 879 |
| Proterv-II : an integrated production planning and scheduling system | p. 880 |
| The comet programming language and system | p. 881 |
| Random stimuli generation for functional hardware verification as a CP application | p. 882 |
| A BDD-based interactive configurator for modular systems | p. 883 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
