Skip to main content
SpringerLink
Log in

On Strategies of the Narrowing Operator Selection in the Constraint Propagation Method

  • Conference paper
Perspectives of System Informatics (PSI 2003)

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

Abstract

This paper presents an approach that allows us to increase efficiency of the constraint propagation method. This approach consists in using a strategy of calls of narrowing operators in the process of computation on the basis of a dynamic system of priorities. Several strategies are described and the results of numerical experiments are discussed.

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., Older, W.: Applying interval arithmetic to real, integer and boolean constraints. Journal of Logic Programming 32(1), 1–24 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Kearfott, R.B.: Some Test of Generalized Bisection. ACM Transactions on Mathematical Software 13(3), 197–220 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Kleymenov, A., Petunin, D., Semenov, A., Vazhev, I.: A Model of Cooperative Solvers for Computational Problems. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2001. LNCS, vol. 2328, pp. 797–802. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Lhomme, O., Gotlieb, A., Rueher, M., Taillibert, P.: Boosting the Interval Narrowing Algorithm. In: Proc. JICSLP 1996, pp. 378–392. MIT Press, Cambridge (1996)

    Google Scholar 

  5. Lhomme, O., Gotlieb, A., Rueher, M.: Dynamic optimization of Interval Narrowing Algorithms. Journal of Logic Programming 37(1-3), 165–183 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Older, W., Vellino, A.: Constraint Arithmetic on real Intervals. In: Benhamou, F., Colmerauer, A. (eds.) Constraint Logic Programming: Selected Research, pp. 175–195. MIT Press, Cambridge (1993)

    Google Scholar 

  7. Semenov, A.: Solving Integer/Real Nonlinear Equations by Constraint Propagation. Technical Report N12, Institute of Mathematical Modelling, The Technical University of Denmark, Lyngby, Denmark, p. 22 (1994)

    Google Scholar 

  8. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, Essex (1993)

    Google Scholar 

  9. Ushakov, D.: Some Formal Aspects of Subdefinite Models. Prepr. / Siberian Division of Russian Acad. Sci. IIS, Novosibirsk 49, 23 (1998)

    Google Scholar 

  10. Wallace, R., Freuder, E.: Ordering heuristics for arc consistency algorithms. In: AI/GI/VI 1992, Vancouver, British Columbia, Canada, pp. 163–169 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.P. Ershov Institute of Informatics Systems, Siberian Division of the Russian Academy of Sciences, Novosibirsk State University,  

    Yuri G. Dolgov

Authors
  1. Yuri G. Dolgov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität München, Germany

    Manfred Broy

  2. A.P. Ershov Institute of Informatics Systems, Siberian Branch of Russian Academy of Sciences, 630090, Novosibirsk, Russia

    Alexandre V. Zamulin

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dolgov, Y.G. (2004). On Strategies of the Narrowing Operator Selection in the Constraint Propagation Method. In: Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2003. Lecture Notes in Computer Science, vol 2890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39866-0_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39866-0_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20813-6

  • Online ISBN: 978-3-540-39866-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation