Riassunto
Thisis theconferencerecordfortheFifthInternationalConferenceonPrinciples and Practice of Constraint Programming (CP’99), held in Alexandria, Virginia, USA, on October 11–14, 1999. The series of CP conferences deal with original papers on most aspects of constraint programming. After a few annual wo- shops, CP’95 took place in Cassis, France, CP’96 in Cambridge, USA, CP’97 in Schloss Hagenberg, Austria, and CP’98 in Pisa, Italy. Thisyearatotalof97papersweresubmitted,and30wereacceptedasregular papers.In addition,therewerethreeinvitedpapers,byKrzysztofApt, Christian Bessi` erre and Benjamin Wah, and eight poster papers, included to showcase yet more interesting directions. The posters appear as short papers in this volume. In the conference, there was an invited tutorial, and following the conference, there were ?ve workshops. All papers were reviewed by an excellent program committeeandtheir designatedreferees.Detailedemaildiscussionsprecededthe actual programcommittee meeting, which was held near the conference location in mid-July, 1999. The CP conferences have had two major directions: constraint satisfaction problems and programming with constraints. This year, the submission/acce- ancebreakdownwassubjectivelyestimatedat56/19and33/8,respectively,with the remaining ratio of 8/3 for application papers. The regional distribution of (?rst) authors for all submissions was 21 for France, 15 for Germany, 12 for USA, 7 for UK, 6 for Japan, 5 for Spain, 4 for Australia and Singapore, 3 each for Italy, Portugal, Sweden, and Switzerland, 2 for Canada and Belgium, and ?nally, one each for Greece, Finland, Hong Kong,Indonesia, Ireland, Korea,and the Netherlands.
Contenuti
Invited Papers.- The Rough Guide to Constraint Propagation.- Non-binary Constraints.- The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization.- Regular Papers.- Operational Equivalence of CHR Programs and Constraints.- Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains.- Excluding Symmetries in Constraint-Based Search.- On Forward Checking for Non-binary Constraint Satisfaction.- Enforcing Arc Consistency on Global Constraints by Solving Subproblems on the Fly.- Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP.- Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time.- A Meta-Heuristic Factory for Vehicle Routing Problems.- Closure Functions and Width 1 Problems.- An Overview of HAL.- Cost-Based Domain Filtering.- Resource Allocation in Networks Using Abstraction and Constraint Satisfaction Techniques.- Optimal Distributed Arc-Consistency.- The Goldilocks Problem.- Multistep Filtering Operators for Ordinary Differential Equations.- A Framework for Constraint Programming Based Column Generation.- Improving a Heuristic Repair Method for Large-Scale School Timetabling Problems.- Applying Constraint Programming to Protein Structure Determination.- Partition-Based Lower Bound for Max-CSP.- Constraint Diagram Reasoning.- Automatic Generation of Music Programs.- Search Procedures and Parallelism in Constraint Programming.- Ensuring a Relevant Visiting Order of the Leaf Nodes during a Tree Search.- Tight Cooperation and Its Application in Piecewise Linear Optimization.- Arc Consistency for Global Cardinality Constraints with Costs.- The Brélaz Heuristic and Optimal Static Orderings.- A Fixpoint Definition of Dynamic Constraint Satisfaction.- Solving Satisfiability Problems on FPGAs Using Experimental Unit Propagation.- On the Behavior and Application of Constraint Weighting.- Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization.- Poster Papers.- On SAT01 Problem.- An Interval Constraint Approach to Handle Parametric Ordinary Differential Equations for Decision Support.- CSPlib: A Benchmark Library for Constraints.- Validated Constraint Compilation.- Automated Theorem Proving with Disjunctive Constraints.- Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms.- Intelligent Domain Splitting for CSPs with Ordered Domains.- Frequency Assignment for Cellular Mobile Systems Using Constraint Satisfaction Techniques.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
