Skip to main content

Constraints with Variables’ Annotations and Constraint Hierarchies

  • Conference paper
  • First Online:
SOFSEM’ 98: Theory and Practice of Informatics (SOFSEM 1998)

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

Abstract

Variables annotations in over-constrained problems enable to express preferences for optimal solution selection using preferences on variables. The basic interpretation of variables’ annotations is presented and correspondence with hierarchical CSP is described. New local comparator for constraint hierarchy is proposed and used for solving constraints with variables’ annotations. The relationships between standard locally-better comparator and the new one are clarified. The potential application areas of variables annotations are also mentioned.

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 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.: Interval Constraint Logic Programming. In: Podelski, A.(nted.): Constraint Programming: Basics and Trends. Lecture Notes in Computer Science, Vol. 910. Springer-Verlag, Berlin Heidelberg New York (1995) 1–21

    Google Scholar 

  2. Borning, A., Anderson, R., Freeman-Benson, B.: Indigo: A Local Propagation Algorithm for Inequality Constraints. Proceedings of the 1996 ACM Symposium on User Interface Software and Technology (1996) 129–136

    Google Scholar 

  3. Borning, A., Anderson, R., Freeman-Benson, B.: The Indigo Algorithm. Tech. Rep. TR-96-05-01, Department of Computer Science and Engineering University of Washington (1996)

    Google Scholar 

  4. Borning, A., Freeman-Benson, B., Wilson, M.: Constraint Hierarchies. Lisp and Symbolic Computation5, No. 3 (1992) 223–270

    Article  Google Scholar 

  5. Freuder, E.C., Mackworth, A.K. (eds.): Constrained-Based Reasoning. MIT Press, (1994). Reprinted from Artificial Intelligence 58, No. 1–3 (1992)

    Google Scholar 

  6. Rudova, H.: Constraints with Variables Annotations. Tech. Rep. FIMU-RS-98-04, Faculty of Informatics Masaryk University, http://www.fi.muni.cz/informatics/reports (1998)

  7. Rudova, H.: Constraints with Variables Annotations. In:Prade, H.: 13th European Conference on Artificial Intelligence, John Wiley & Sons, Ltd 1998) 261–262

    Google Scholar 

  8. Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. MIT Press 1989

    Google Scholar 

  9. Wilson, M., Borning, A.: Hierarchical Constraint Logic Programming. Journal of Logic Programming 16, No. 3,4 (1993) 227–318

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rudova, H. (1998). Constraints with Variables’ Annotations and Constraint Hierarchies. In: Rovan, B. (eds) SOFSEM’ 98: Theory and Practice of Informatics. SOFSEM 1998. Lecture Notes in Computer Science, vol 1521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49477-4_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-49477-4_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49477-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics