Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Constraint Solving and Constraint Logic Programming

CSCLP 2003: Recent Advances in Constraints pp 196–222Cite as

Teaching Constraints through Logic Puzzles

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3010))

Abstract

The paper describes the experiences of teaching a constraint logic programming course at the Budapest University of Technology and Economics. We describe the structure of the course, the material covered, some examples, assignments, and examination tasks. Throughout the paper we show how logic puzzles can be used to illustrate constraint programming techniques.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shortz, W. (ed.): Brain Twisters from the First World Puzzle Championships. Times Books (1993)

    Google Scholar 

  2. Shortz, W., Baxter, N. (eds.): World-Class Puzzles from the World Puzzle Championships. Times Books (2001)

    Google Scholar 

  3. Van Hentenryck, P.: Constraint Satisfation in Logic programming. MIT Press, Cambridge (1989)

    Google Scholar 

  4. Hanák, D., Benkő, T., Hanák, P., Szeredi, P.: Computer aided exercising in Prolog and SML. In: Proceedings of the Workshop on Functional and Declarative Programming in Education, PLI 2002, Pittsburgh PA, USA (2002)

    Google Scholar 

  5. SICS, Swedish Institute of Computer Science: SICStus Prolog Manual, 3.10 (2003)

    Google Scholar 

  6. Colmerauer, A.: An introduction to Prolog III. Communications of the ACM 33, 69–90 (1990)

    Article  Google Scholar 

  7. Smullyan, R.M.: What is the Name of This Book? Prentice Hall, Englewood Cliffs (1978)

    Google Scholar 

  8. Hanák, D., Szeredi, T.: Finite domain constraint debugger. In: SICStus Manual ([5], Chapter 36) (2003)

    Google Scholar 

  9. Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(FD). In: Podelski, A. (ed.) Constraint Programming: Basics and Trends, pp. 293–316. Springer, Heidelberg (1995)

    Google Scholar 

  10. Szeredi, P.: CLP resources (2003), http://www.cs.bme.hu/~szeredi/clp.html

  11. Harvey, W., Schimpf, J.: Eclipse sample code: Domino (2000), http://www-icparc.doc.ic.ac.uk/eclipse/examples/domino.ecl.txt

  12. 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, pp. 389–403. Springer, Heidelberg (1996)

    Google Scholar 

  13. Simpson, S.: Nonogram solver (2003), http://www.comp.lancs.ac.uk/computing/users/ss/nonogram/

  14. Walsh, T.: Teaching by Toby Walsh: Nonogram solver (2000), http://www-users.cs.york.ac.uk/~tw/Teaching/nonogram.html

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Information Theory, Budapest University of Technology and Economics, H-1117, Budapest, Magyar tudósok körútja 2

    Péter Szeredi

  2. Information Systems Ltd., IQSYS, H-1135, Budapest, Csata u. 8

    Péter Szeredi

Authors
  1. Péter Szeredi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Amsterdam, The Netherlands

    Krzysztof R. Apt

  2. Projet Contraintes, INRIA Rocquencourt, BP105, 78153, Domaine de Voluceau, Le Chesnay Cedex, France

    François Fages

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

    Francesca Rossi

  4. Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Magyar tudósok körútja 2, H-1117, Hungary, Budapest

    Péter Szeredi

  5. Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende u. 13-17, 1111, Budapest, Hungary

    Josef Váncza

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Szeredi, P. (2004). Teaching Constraints through Logic Puzzles. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds) Recent Advances in Constraints. CSCLP 2003. Lecture Notes in Computer Science(), vol 3010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24662-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24662-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21834-0

  • Online ISBN: 978-3-540-24662-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation