Using “weaker” functions for constraint propagation over real numbers

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Using “weaker” functions for constraint propagation over real numbers

Full text

Pdf (846 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1999 ACM symposium on Applied computing table of contents

San Antonio, Texas, United States

Pages: 553 - 559

Year of Publication: 1999

ISBN:1-58113-086-4

Author

Eric Monfroy

CWI, Kruislaan 413, 1098 SJ Amsterdam, THE NETHERLANDS

Sponsors

SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 6, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/298151.298473 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	G. Alefeld and J. Herzberger. Introduction to rnterual computation. Series in Computer Science and Applied Mathematics. Academic Press, 1983.
	2	Krzysztof R. Apt, From Chaotic Iteration to Constraint Propagation, Proceedings of the 24th International Colloquium on Automata, Languages and Programming, p.36-55, July 07-11, 1997
	3	Krzysztof R. Apt, The essence of constraint propagation, Theoretical Computer Science, v.221 n.1-2, p.179-210, June 28, 1999 [doi>10.1016/S0304-3975(99)00032-8]
	4	F Benhamou, F. Goualard. and L. Granvilliers. Programming with the Declic Language. In Proceedings of the International Workshop on Interval Con&mints, pages 1-13, Port Jefferson, USA, 1997.
	5	F. Benhamou and W. Older. Applying Interval Arithmetic to Real, Integer and Boolean Constraints. Journal of Lo9w Programming, 32(1):1-24, 1997.
	6	K. Geddes, G. Gonnet, and B. Leong. Maple V : Language reference manual. Springer Verlag, New York, Berlin, Paris, 1991.
	7	L. Granvilliers. On the combincation of box-consistency and hull-consistency. In Proceedings of ECA I Workshop on Non Binary Constrarnts, 1998.
	8	L. Granvilliers. A symbolic-numerical branch and prune algorithm for solving non-linear polynomial systerns. Journal of Universal Computer Scrence, 4:125- 146, 1998.
	9	E. Hansen. Global optimization using interval analysis. Number 165 in Series in Pure and Applied Mathematics. Marcel Dekker, New York - Base1 - Hong Kong, 1992.
	10	Eero Hyvönen, Constraint reasoning based on interval arithmetic: the tolerance propagation approach, Artificial Intelligence, v.58 n.1-3, p.71-112, Dec. 1992 [doi>10.1016/0004-3702(92)90005-I]
	11	IEEE. IEEE standard for binary floating-point arithmetic. IEEE Std 7541985, 1985. Reaffirmed 1990.
	12	0. Lhomme. Consistency Techniques for Numeric CSPs. In R. Bajcsy, editor, Proceeding8 of the 13th International Jornt Conference on Artificial Intelligence (ZJCA 1'93), Chambe'ry, fiance. IEEE Computer Society Press. 1993.
	13	0. Lhomme and M. R.ueher. Application des techniques CSP au raisonuement sur les intervalles. RIA. 11(3):283-312, 1997
	14	A. MIackworth. Consistency in networks of relations. Art;ficml Intelligence. 8( 1):99-118. 1977.
	15	E. Monfroy. Collaboration de solveurs pour la programmation logique ci contmintes. PhD Thesis, UniversitC Henri PoincarbNancy I, 1996. (Also available in english. Available on-line http://www.cwi.nl/-eric/Private/Publications/index.html).
	16	R. E. Moore. Interval Analysis. Series in Automatic Computation. Prentice Hall, Englewood Cliffs, N. J., 1966.
	17	D. Sam-Haroud and B. Faltings. Consistency techniques for continuous constraints. Constraints, 1:85- 118, 1996.
	18	V. Telerman , D. Ushakov, Subdefinite Models as a Variety of Constraint Programming, Proceedings of the 8th International Conference on Tools with Artificial Intelligence (ICTAI '96), p.157, November 16-19, 1996
	19	Pascal Van Hentenryck , David McAllester , Deepak Kapur, Solving Polynomial Systems Using a Branch and Prune Approach, SIAM Journal on Numerical Analysis, v.34 n.2, p.797-827, April. 1997 [doi>10.1137/S0036142995281504]
	20	P Van Hentenryck, L. Michel, and Y. Deville. Numer- ICC: a modelrng language for global optimization. The

CITED BY 4

	Krzysztof R. Apt, The role of commutativity in constraint propagation algorithms, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.6, p.1002-1036, Nov. 2000
	Eric Monfroy, A coordination-based chaotic iteration algorithm for constraint propagation, Proceedings of the 2000 ACM symposium on Applied computing, p.262-269, March 2000, Como, Italy
	Eric Monfroy , Jean-Hugues Réty, Chaotic iteration for distributed constraint propagation, Proceedings of the 1999 ACM symposium on Applied computing, p.19-24, February 28-March 02, 1999, San Antonio, Texas, United States
	Christian Schulte , Peter J. Stuckey, Efficient constraint propagation engines, ACM Transactions on Programming Languages and Systems (TOPLAS), v.31 n.1, p.1-43, December 2008