"Principles and Practice of Constraint Programming" - Information and Links:

Principles and Practice of Constraint Programming - Info and Reading Options

24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings

Book's cover
The cover of “Principles and Practice of Constraint Programming” - Open Library.

"Principles and Practice of Constraint Programming" is published by Springer in Aug 23, 2018 - Cham and it has 792 pages.


“Principles and Practice of Constraint Programming” Metadata:

  • Title: ➤  Principles and Practice of Constraint Programming
  • Author:
  • Number of Pages: 792
  • Publisher: Springer
  • Publish Date:
  • Publish Location: Cham

“Principles and Practice of Constraint Programming” Subjects and Themes:

Edition Specifications:

  • Format: paperback

Edition Identifiers:

AI-generated Review of “Principles and Practice of Constraint Programming”:


"Principles and Practice of Constraint Programming" Description:

Open Data:

Intro -- Preface -- Workshops and Tutorials -- Conference Organization -- Abstracts of Invited Talks -- Potential Applications of CP in Industrial Scheduling -- Towards the Holy Grail in Machine Learning -- Constraints at the Heart of Classical Planning -- Contents -- Main Technical Track -- Automatic Discovery and Exploitation of Promising Subproblems for Tabulation -- 1 Introduction -- 2 Identifying Promising Subproblems for Tabulation -- 3 Experimental Evaluation: Baseline -- 4 Experimental Evaluation: New Case Studies -- 5 Conclusions -- References -- Propagating Regular Membership with Dashed Strings -- 1 Introduction -- 2 Preliminaries -- 2.1 Dashed Strings -- 2.2 G-Strings Solver -- 2.3 Automata and Regular Expressions -- 3 Propagating regular on Dashed Strings -- 3.1 Propagation -- 4 Regular Expressions Decomposition -- 5 Evaluation -- 5.1 AppScan and Stranger Benchmarks -- 5.2 Norn Benchmark -- 6 Conclusion -- References -- A Constraint-Based Encoding for Domain-Independent Temporal Planning -- 1 Introduction -- 2 Background -- 2.1 A Distilled Planning Problem -- 2.2 Temporal Planning as Chronicles -- 3 Planning as a Constraint Satisfaction Problem -- 3.1 Building Blocks -- 3.2 Constraints for Plan Consistency -- 3.3 Symmetry Breaking Constraints -- 4 Instantiation in a Domain-Independent Planner -- 4.1 The ANML Language -- 4.2 Solving with SMT -- 4.3 Limitations -- 5 Experiments -- 5.1 Comparison with State of the Art Temporal Planners -- 5.2 Comparison with SMTPlan+ -- 6 Related Work -- 7 Conclusion -- References -- Decremental Consistency Checking of Temporal Constraints: Algorithms for the Point Algebra and the ORD-Horn Class -- 1 Introduction -- 2 Background, Terminology and Notation -- 3 Decremental Consistency Checking -- 3.1 An Algorithm for D-PSAT: Dpasat -- 3.2 An Algorithm for D-OHSAT: Dohsat -- 4 Experimental Results

Read “Principles and Practice of Constraint Programming”:

Read “Principles and Practice of Constraint Programming” by choosing from the options below.

Search for “Principles and Practice of Constraint Programming” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Principles and Practice of Constraint Programming” in Libraries Near You:

Read or borrow “Principles and Practice of Constraint Programming” from your local library.

Buy “Principles and Practice of Constraint Programming” online:

Shop for “Principles and Practice of Constraint Programming” on popular online marketplaces.