Logo - springer
Slogan - springer

Computer Science - Software Engineering | Principles and Practice of Constraint Programming - CP 2005 - 11th International Conference, CP

Principles and Practice of Constraint Programming - CP 2005

11th International Conference, CP 2005, Sitges Spain, October 1-5, 2005

van Beek, Peter (Ed.)

2005, XX, 887 p. Also available online.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$149.00

(net) price for USA

ISBN 978-3-540-32050-0

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$189.00

(net) price for USA

ISBN 978-3-540-29238-8

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

The 11th International Conference on the Principles and Practice of Constraint Programming (CP 2005) was held in Sitges (Barcelona), Spain, October 1–5, 2005. Information about the conference can be found on the web at http://www.iiia.csic.es/cp2005/.Informationaboutpastconferencesinthe series can be found athttp://www.cs.ualberta.ca/~ai/cp/. The CP conference series is the premier international conference on c- straint programming and is held annually. The conference is concerned with all aspects of computing with constraints, including: algorithms, applications, environments, languages, models and systems. This year, we received 164 submissions. All of the submitted papers received atleastthreereviews,andthepapersandtheirreviewswerethenextensivelyd- cussed during an online Program Committee meeting. As a result, the Program Committee chose 48 (29.3%) papers to be published in full in the proceedings and a further 22 (13.4%)papers to be published as short papers.The full papers werepresentedattheconferencein twoparalleltracksandtheshortpaperswere presented as posters during a lively evening session. Two papers were selected by a subcommittee of the ProgramCommittee—consisting of Chris Beck, Gilles Pesant, and myself—to receive best paper awards. The conference program also includedexcellentinvitedtalksbyH´ ectorGe?ner,IanHorrocks,FrancescaRossi, and Peter J. Stuckey. As a permanent record, the proceedings contain four-page extended abstracts of the invited talks.

Content Level » Research

Keywords » CSP - Erfüllbarkeitsproblem der Aussagenlogik - Planning - constraint checkers - constraint logic programming - constraint programming - constraint satisfaction - constraint solving - constraint-based combinatorics - decision making - learning - logic - programming - programming language - semantics

Related subjects » Artificial Intelligence - Software Engineering - Theoretical Computer Science

Table of contents 

Invited Papers.- Search and Inference in AI Planning.- OWL: A Description Logic Based Ontology Language.- Preference Reasoning.- The G12 Project: Mapping Solver Independent Models to Efficient Solutions.- Best Papers.- Symmetry Definitions for Constraint Satisfaction Problems.- Dynamic Ordering for Asynchronous Backtracking on DisCSPs.- Full Papers.- Incremental Algorithms for Local Search from Existential Second-Order Logic.- Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs.- Mind the Gaps: A New Splitting Strategy for Consistency Techniques.- Graph Invariants as Necessary Conditions for Global Constraints.- Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation.- Sub-optimality Approximations.- A Linear-Logic Semantics for Constraint Handling Rules.- Distributed Stable Matching Problems.- Beyond Hypertree Width: Decomposition Methods Without Decompositions.- Ad-hoc Global Constraints for Life.- Tractable Clones of Polynomials over Semigroups.- CP(Graph): Introducing a Graph Computation Domain in Constraint Programming.- Interval Analysis in Scheduling.- Assumption-Based Pruning in Conditional CSP.- Conditional Symmetry Breaking.- Symmetry and Consistency.- Solving the MOLR and Social Golfers Problems.- Advances in Polytime Isomorph Elimination for Configuration.- Planning and Scheduling to Minimize Tardiness.- Search Heuristics and Heavy-Tailed Behaviour.- 2 -Way vs.d -Way Branching for CSP.- Maintaining Longest Paths in Cyclic Graphs.- Applying Constraint Programming to Rigid Body Protein Docking.- Maximum Constraint Satisfaction on Diamonds.- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.- Generalized Conflict Learning for Hybrid Discrete/Linear Optimization.- Parallel Local Search in Comet.- Generating Corrective Explanations for Interactive Constraint Satisfaction.- SPREAD: A Balancing Constraint Based on Statistics.- Automatic Detection of Variable and Value Symmetries.- Breaking All Value Symmetries in Surjection Problems.- AC-*: A Configurable, Generic and Adaptive Arc Consistency Algorithm.- Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost.- Weak Composition for Qualitative Spatial and Temporal Reasoning.- Boosting Distributed Constraint Satisfaction.- Depth-First Mini-Bucket Elimination.- Using SAT in QBF.- Tree Decomposition with Function Filtering.- On Solving Soft Temporal Constraints Using SAT Techniques.- Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming.- Caching Search States in Permutation Problems.- Repair-Based Methods for Quantified CSPs.- Handling Implication and Universal Quantification Constraints in FLUX.- Solving Simple Planning Problems with More Inference and No Search.- Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning.- Factor Analytic Studies of CSP Heuristics.- Short Papers.- Lookahead Saturation with Restriction for SAT.- Evolving Variable-Ordering Heuristics for Constrained Optimisation.- Multi-point Constructive Search.- Bounds of Graph Characteristics.- Acquiring Parameters of Implied Global Constraints.- Integrating Benders Decomposition Within Constraint Programming.- Using Boolean Constraint Propagation for Sub-clauses Deduction.- Extending Systematic Local Search for Job Shop Scheduling Problems.- Interactive Reconfiguration in Power Supply Restoration.- Neighbourhood Clause Weight Redistribution in Local Search for SAT.- Computing and Exploiting Tree-Decompositions for Solving Constraint Networks.- Encoding Requests to Web Service Compositions as Constraints.- Test Instance Generation for MAX 2SAT.- Consistency for Quantified Constraint Satisfaction Problems.- Alternate Modeling in Sport Scheduling.- Approximations in Distributed Optimization.- Extremal CSPs.- Beyond Finite Domains: The All Different and Global Cardinality Constraints.- Views and Iterators for Generic Constraint Implementations.- Approximated Consistency for the Automatic Recording Problem.- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints.- Approximate Constrained Subgraph Matching.- Doctoral Papers.- Distributed Constraints for Large-Scale Scheduling Problems.- Solving Over-Constrained Problems with SAT.- A Constraint Based Agent for TAC–SCM.- Solving the Car-Sequencing Problem as a Non-binary CSP.- Dimensioning an Inbound Call Center Using Constraint Programming.- Methods to Learn Abstract Scheduling Models.- Automated Search for Heuristic Functions.- Constraint-Based Inference: A Bridge Between Constraint Processing and Probability Inference.- Scheduling Social Tournaments.- Domain Reduction for the Circuit Constraint.- Using Constraint Programming for Solving Distance CSP with Uncertainty.- Improved Algorithm for Finding (a,b)-Super Solutions.- Local Consistency in Weighted CSPs and Inference in Max-SAT.- Modeling Constraint Programs with Software Technology Standards.- Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems.- Mechanism Design for Preference Aggregation over Coalitions.- LP as a Global Search Heuristic Across Different Constrainedness Regions.- Consistency for Partially Defined Constraints.- Subnet Generation Problem: A New Network Routing Problem.- Partial Redundant Modeling.- AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems.- Weak Symmetries in Problem Formulations.- Towards the Systematic Generation of Channelling Constraints.- AND/OR Search Spaces and the Semantic Width of Constraint Networks.- Statistical Modelling of CSP Solving Algorithms Performance.- Probabilistic Arc Consistency.- GOOSE – A Generic Object-Oriented Search Environment.- Randomization for Multi-agent Constraint Optimization.- Uncertainty in Soft Constraint Problems.- Speeding Up Constrained Path Solvers with a Reachability Propagator.- From Linear Relaxations to Global Constraint Propagation.- Encoding HTN Planning as a Dynamic CSP.- Specialised Constraints for Stable Matching Problems.- Bounds-Consistent Local Search.- Robust Constraint Solving Using Multiple Heuristics.- Scheduling with Uncertain Start Dates.- The Role of Redundant Clauses in Solving Satisfiability Problems.- Applying Decomposition Methods to Crossword Puzzle Problems.- Asymmetric Distributed Constraints Satisfaction Problems.- Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains.- System Demonstrations.- CoJava: A Unified Language for Simulation and Optimization.- Programming with .- Computing Super-Schedules.- Proterv-II: An Integrated Production Planning and Scheduling System.- The Comet Programming Language and System.- Random Stimuli Generation for Functional Hardware Verification as a CP Application.- A BDD-Based Interactive Configurator for Modular Systems.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Software Engineering / Programming and Operating Systems.