Skip to main content
SpringerLink
Log in
Book cover

Principles and Practice of Constraint Programming

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

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. John Hooker

    1. Carnegie Mellon University, Pittsburgh, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11008)

Part of the book sub series: Programming and Software Engineering (LNPSE)

Included in the following conference series:

Conference proceedings info: CP 2018.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (49 papers)

  1. Front Matter

    Pages I-XXVII
    Download chapter PDF

  2. Main Technical Track

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Automatic Discovery and Exploitation of Promising Subproblems for Tabulation

      • Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon
      Pages 3-12

    3. Propagating Regular Membership with Dashed Strings

      • Roberto Amadini, Graeme Gange, Peter J. Stuckey
      Pages 13-29

    4. A Constraint-Based Encoding for Domain-Independent Temporal Planning

      • Arthur Bit-Monnot
      Pages 30-46

    5. Decremental Consistency Checking of Temporal Constraints: Algorithms for the Point Algebra and the ORD-Horn Class

      • Massimo Bono, Alfonso Emilio Gerevini
      Pages 47-63

    6. Domain Reduction for Valued Constraints by Generalising Methods from CSP

      • Martin C. Cooper, Wafa Jguirim, David A. Cohen
      Pages 64-80

    7. Solver-Independent Large Neighbourhood Search

      • Jip J. Dekker, Maria Garcia de la Banda, Andreas Schutt, Peter J. Stuckey, Guido Tack
      Pages 81-98

    8. Solution-Based Phase Saving for CP: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers

      • Emir Demirović, Geoffrey Chu, Peter J. Stuckey
      Pages 99-108

    9. An SMT Approach to Fractional Hypertree Width

      • Johannes K. Fichte, Markus Hecher, Neha Lodha, Stefan Szeider
      Pages 109-127

    10. On the Non-degeneracy of Unsatisfiability Proof Graphs Produced by SAT Solvers

      • Rohan Fossé, Laurent Simon
      Pages 128-143

    11. Sequential Precede Chain for Value Symmetry Elimination

      • Graeme Gange, Peter J. Stuckey
      Pages 144-159

    12. An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks

      • Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Michael Sioutis
      Pages 160-178

    13. Clause Learning and New Bounds for Graph Coloring

      • Emmanuel Hebrard, George Katsirelos
      Pages 179-194

    14. Portfolio-Based Algorithm Selection for Circuit QBFs

      • Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
      Pages 195-209

    15. Making Compact-Table Compact

      • Linnea Ingmar, Christian Schulte
      Pages 210-218

    16. Approximation Strategies for Incomplete MaxSAT

      • Saurabh Joshi, Prateek Kumar, Ruben Martins, Sukrut Rao
      Pages 219-228

    17. A Novel Graph-Based Heuristic Approach for Solving Sport Scheduling Problem

      • Meriem Khelifa, Dalila Boughaci, Esma Aïmeur
      Pages 229-241

    18. Augmenting Stream Constraint Programming with Eventuality Conditions

      • Jasper C. H. Lee, Jimmy H. M. Lee, Allen Z. Zhong
      Pages 242-258

    19. A Complete Tolerant Algebraic Side-Channel Attack for AES with CP

      • Fanghui Liu, Waldemar Cruz, Laurent Michel
      Pages 259-275
Back to top

Other volumes

  1. Principles and Practice of Constraint Programming

Keywords

About this book

This book constitutes the proceedings of the 24th International Conference on Principles and Practice of Constraint Programming, CP 2018, held in Lille, France, in August 2018.The 41 full and 9 short papers presented in this volume were carefully reviewed and selected from 114 submissions. They deal with all aspects of computing with constraints including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, scheduling, configuration, and planning. The papers were organized according to the following topics/tracks: main technical track; applications track; CP and data science; CP and music; CP and operations research; CP, optimization and power system management; multiagent and parallel CP; and testing and verification.

Editors and Affiliations

  • Carnegie Mellon University, Pittsburgh, USA

    John Hooker

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation