Skip to main content

Industrial Application of External Black-Box Functions in Constraint Programming Solver

  • Conference paper
Perspectives of System Informatics (PSI 2003)

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

  • 419 Accesses

Abstract

We examine the problem of interaction between the interval constraint programming solver and external computation algorithms that are considered by the solver as Black Boxes. Some techniques are used in order to resolve a contradiction between the intervals values of the constraint solver and exact values of Black Boxes. The proposed approach was developed and implemented in CATIA CAD/CAM system.

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. Mackworth, A.: Consistency in Networks of Relations, Artificial Intelligence, vol. 8, pp. 99–118 (1977)

    Google Scholar 

  2. Narin’yani, A.S.: Sub-definiteness and Basic Means of knowledge representation. Computers and Artificial Intelligence. — Bratislava, — N5 (1983)

    Google Scholar 

  3. Marti, P., Rueher, M.: A Distributed Cooperating Constraints Solving System. International Journal on Artificial Intelligence Tools 4(1-2), 93–113 (1995)

    Article  Google Scholar 

  4. Granvillers, L., Monfroy, E., Benhamou, F.: Symbolic-interval cooperation in constraint programming. In: Procs. of ISSAC 2001, ACM Press, New York (2001); Constraint Programming and Artificial Intelligence:

    Google Scholar 

  5. Telerman, V., Ushakov, D.: Subdefinite Models as a Variety of Constraint Programming. In: Proc. of the 8th Internat. Conf. on Tools with Artificial Intelligence, ICTAI 1996, pp. 157–163. IEEE Computer Society, Los Alamitos (1996)

    Chapter  Google Scholar 

  6. Shvetsov, I., Telerman, V., Ushakov, D.: NeMo+: Object-Oriented Constraint Programming Environment Based on Subdefinite Models. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 534–548. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  7. Gurin, L.S., Dymarsky, Y.S., Merkulov, A.D.: Problems and methods of optimal allocation of resources. — Moscow: Sov. radio, p. 463 (1968) (in Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sidorov, V., Telerman, V. (2004). Industrial Application of External Black-Box Functions in Constraint Programming Solver. 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_41

Download citation

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

  • 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