Skip to main content

A Partially Solved Form for Heterogeneous Constraints in Disjunctive Normal Form

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming - CP 2002 (CP 2002)

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

  • 955 Accesses

Abstract

In order to support constraint solving for challenging engineering applications, as e.g. accomplished by the Relational Constraint Solver (see [MST]), we need to implement join and project operators (see e.g. [AHV] or [M]) for heterogeneous constraints. The heterogeneity is due to finite domain and real-valued variables, linear and non-linear arithmetic constraints, (dis-)equations and inequalities.

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

Access this chapter

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

Institutional subscriptions

References

  1. J. Mauss, F. Seelisch, M. Tatar: A Relational Constraint Solver for Model-based Engineering, Principles and Practice of Constraint Programming-CP2002, Conference Proceedings, 2002

    Google Scholar 

  2. S. Abiteboul, R. Hull, V. Vianu: Foundations of Databases, Addison-Wesley, 1995, ISBN 0-201-53771-0.

    Google Scholar 

  3. D. Maier: The theory of relational databases, Computer Science Press, Rockville, MD, 1986.

    Google Scholar 

  4. P. Van Hentenryck and T. Graf: Standard Forms for Rational Linear Arithmetics in Constraint Logic Programming, Annals of Mathematics and Artificial Intelligence, 5(2–4), 1992.

    Google Scholar 

  5. J.-L. Imbert: Solved Forms for Linear Constraints in CLP Languages, Proceedings of the Sixth International Conference on Artificial Intelligence, AIMSA’94, pp. 77–90, World Scientific, Sofia, Bulgaria, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seelisch, F. (2002). A Partially Solved Form for Heterogeneous Constraints in Disjunctive Normal Form. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_75

Download citation

  • DOI: https://doi.org/10.1007/3-540-46135-3_75

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44120-5

  • Online ISBN: 978-3-540-46135-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics