New Trends in Constraints

Joint ERCIM/Compulog Net Workshop Paphos, Cyprus, October 25-27, 1999 Selected Papers

AvKrzysztof R. Apt,Antonis Kakas

Häftad, Engelska, 2000

Del i serien Lecture Notes in Computer Science

560 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the thoroughly refereed post-proceedings of the Joint ERCIM/Compulog-Net Workshop on New Trends in Constraints held in Paphos, Cyprus, Greece in October 1999. The 12 revised full research papers presented together with four surveys by leading researchers were carefully reviewed. The book is divided in topical sections on constraint propagation and manipulation, constraint programming, and rule-based constraint programming.

Produktinformation

Utgivningsdatum:2000-08-23
Mått:155 x 235 x 20 mm
Vikt:540 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:340
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540678854

Utforska kategorier

Artificiell intelligens inom Data och IT
Programspråk inom Data och IT

Innehållsförteckning

Invited Contributions and Surveys.- Interval Constraints: Results and Perspectives.- A Constraint-Based Language for Virtual Agents.- Constraint (Logic) Programming: A Survey on Research and Applications.- OPL Script: Composing and Controlling Models.- Constraint Propagation and Manipulation.- Some Remarks on Boolean Constraint Propagation.- Abstracting Soft Constraints.- Decomposable Constraints.- Generating Propagation Rules for Finite Domains: A Mixed Approach.- Ways of Maintaining Arc Consistency in Search Using the Cartesian Representation.- Constraint Programming.- Combining Constraint Logic Programming Techniques for Solving Linear Problems.- Quantitative Observables and Averages in Probabilistic Constraint Programming.- Dynamic Constraint Models for Planning and Scheduling Problems.- A Finite Domain CLP Solver on Top of Mercury.- Rule-Based Constraint Programming.- Rule Based Programming with Constraints and Strategies.- Proving Termination of Constraint Solver Programs.- Projection in Adaptive Constraint Handling.