Skip to main content
SpringerLink
Log in

Solving CSP Including a Universal Quantification

  • Conference paper
Multiparadigm Programming in Mozart/Oz (MOZ 2004)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3389))

Included in the following conference series:

  • 438 Accesses

Abstract

This paper presents a method to solve constraint satisfaction problems including a universally quantified variable with finite domain. Similar problems appear in the field of bounded model checking. The presented method is built on top of the Mozart constraint programming platform. The main principle of the algorithm is to consider only representative values in the domain of the quantified variable. The presented algorithm is similar to a branch and bound search. Significant improvements have been achieved both in memory consumption and execution time compared to a naive approach.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benhamou, F., Goualard, F.: Universally quantified interval constraints. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 67–82. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using sat procedures instead of bdds. In: Proceedings of the 36th ACM/IEEE conference on Design automation, New Orleans, Louisiana, United States, pp. 317–320. ACM Press, New York (1999)

    Chapter  Google Scholar 

  3. Boris, B.: Black-box testing - Techniques for functional testing of software and systems. John Wiley & Sons, Chichester (1995)

    Google Scholar 

  4. Golden, K., Frank, J.: Universal quantification in a constraint-based planner. In: AIPS 2002 (2002)

    Google Scholar 

  5. Van Roy, P., Haridi, S.: Concepts, Techniques, and Models of Computer Programming. MIT Press, Cambridge (2004) ISBN 0-262-22069-5

    Google Scholar 

  6. Schulte, C.: Programming Constraint Services. LNCS (LNAI), vol. 2302. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’Ingéniérie Informatique, UCL, Belgium

    Renaud De Landtsheer

Authors
  1. Renaud De Landtsheer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science and Engineering, Université catholique de Louvain, Place Sainte Barbe, 2, B-1348, Louvain-la-Neuve, Belgium

    Peter Van Roy

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Landtsheer, R. (2005). Solving CSP Including a Universal Quantification. In: Van Roy, P. (eds) Multiparadigm Programming in Mozart/Oz. MOZ 2004. Lecture Notes in Computer Science, vol 3389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31845-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31845-3_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25079-1

  • Online ISBN: 978-3-540-31845-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation