Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2003: Principles and Practice of Constraint Programming – CP 2003 pp 1000Cite as

Computing Explanations for Global Scheduling Constraints

  • Conference paper

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

Abstract

Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Besides providing some sort of answer to the user, explanations can be used for debugging, solving dynamic problems and in advanced search algorithms. Explanations work pretty well with simple constraints. However, in order to use explanations together with a global constraint, its filtering algorithm (i.e. propagation) has to be enhanced to be explanation-aware. In my work I focus on such a technique for classical scheduling filtering algorithms like edge-finding and not-first/not-last.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as 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

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Baptiste, P., Le Pape, C.: Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling. In: proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group (1996)

    Google Scholar 

  2. Jussien, N.: e-constraints: explanation-based Constraint Programming. In: CP01 Workshop on User-Interaction in Constraint Satisfaction (2001)

    Google Scholar 

  3. Guéret, C., Jussien, N., Prins, C.: Using intelligent backtracking to improve branch and bound methods: an application to Open-Shop problems. European Journal of Operational Research (2000)

    Google Scholar 

  4. Martin, P., Shmoys, D.B.: A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol. 1084. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Malostranské náměstí 2/25, Praha 1, Czech Republic

    Petr Vilím

Authors
  1. Petr Vilím
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Matematica Pura ed Applicata, Università di Padova, Via Trieste 63, 35121, Padova, Italy

    Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vilím, P. (2003). Computing Explanations for Global Scheduling Constraints. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_124

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45193-8_124

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20202-8

  • Online ISBN: 978-3-540-45193-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation