Implementing non-linear constraints with cooperative solvers

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Implementing non-linear constraints with cooperative solvers

Full text

Pdf (956 KB)

Source

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

Philadelphia, Pennsylvania, United States

Pages: 63 - 72

Year of Publication: 1996

ISBN:0-89791-820-7

Authors

Eric Monfroy	CRIN-CNRS & INRIA-Lorraine, BP 239, 54506 Vandœœuvre-lès-Nancy Cedex, France
Michaël Rusinowitch	CRIN-CNRS & INRIA-Lorraine, BP 239, 54506 Vandœœuvre-lès-Nancy Cedex, France
René Schott	CRIN-CNRS & INRIA-Lorraine, BP 239, 54506 Vandœœuvre-lès-Nancy Cedex, France

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 10, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/331119.331147 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	A. Aiba, K. 8akai, Y. Sato, D. J. Hawley, and H. Hasegawa. Constraint Logic Programm/n$ Language CAL. In Proceedings of the lntern4tional Qon.ierenc~ on Fifth Generation' Computer S~ziem, (FGC$'88), Tokyo (Ja?an), pages 263- 276. ICOT Research Center, December 1988.
	2	F. Benhamou , D. McAllester , P. van Hentenryck, CLP(intervals) revisited, Proceedings of the 1994 International Symposium on Logic programming, p.124-138, November 1994, Symposia, Melbourne
	3	H. Beringer and B. De B~cker. Combinatorial problem solving in constraint logic programming with cooperative solvers. In Logic programming: formal m~tkoda and practical applications. Elsevier Science Publisher B.V., 1995.
	4	B. Buchberger. Gr6bner Bases: an Algorithmic Method in Polynomial Ideal Theory. In' N. K. Bose Ed., editor, Multidimensional System, theory, pages 184-232. D. Reidel Pub- !ishing CompanY, Dordrecht - Boston- Lancaster, 1985.
	5	S.-C. Chou, Mechanical geometry theorem proving, Kluwer Academic Publishers, Norwell, MA, 1987
	6	George E. Collins, Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages, p.134-183, May 20-23, 1975
	7	3-C. Faugere. Rtsolution dee ~,tSrne~ d'~quationz ~1- g~briquez. PhD thesis, Universit6 Paris 6, 1994.
	8	T. Fr~wirth. Constraint handlh~ rules. In A. Podelski, editor, Coneir4inl Progr4mmin9: B4eice end Trend,, volume 910 of Lecture Note~ in Oomputer Science. $pringer-Verlag, 1995.
	9	Thom W. Frühwirth , Alexander Herold , Volker Küchenhoff , Thierry Le Provost , Pierre Lim , Eric Monfroy , Mark Wallace, Contraint Logic Programming - An Informal Introduction, Proceedings of the Second International Logic Programming Summer School on Logic Programming in Action, p.3-35, September 07-11, 1992
	10	Xiaoshan Gao, Transcendental functions and mechanical theorem proving in elementary geometries, Journal of Automated Reasoning, v.6 n.4, p.403-417, Dec. 1990
	11	Keith O. Geddes, Gaston H. Conner, and Benton L. Leong. Maple V: Language re. ferencc manual Springer Verlag, New York, Berlin, Paris, 1991.
	12	Alessandro Giovini , Teo Mora , Gianfranco Niesi , Lorenzo Robbiano , Carlo Traverso, “One sugar cube, please” or selection strategies in the Buchberger algorithm, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.49-54, July 15-17, 1991, Bonn, West Germany [doi>10.1145/120694.120701]
	13	Hoon Hong, Non-linear Real Constraints in Constraint Logic Programming, Proceedings of the Third International Conference on Algebraic and Logic Programming, p.201-212, September 02-04, 1992
	14	J. Jaffar , J.-L. Lassez, Constraint logic programming, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.111-119, January 21-23, 1987, Munich, West Germany [doi>10.1145/41625.41635]
	15	T. Khedro and M.R. Genesereth. Modeling multiagent cooperation as distributed constraint satisfaction problem solving. In A. Cokn, editor, Proc. of ECAI'9~: 11th European Conference on Artificial Intelligence, pages 249-253, 1994.
	16	Hélène Kirchner , Christophe Ringeissen, Combining symbolic constraint solvers on algebraic domains, Journal of Symbolic Computation, v.18 n.2, p.113-155, Aug. 1994 [doi>10.1006/jsco.1994.1040]
	17	Jean-Claude Latombe, Robot Motion Planning, Kluwer Academic Publishers, Norwell, MA, 1991
	18	S Maddila , C K Yap, Moving a polygon around the corner in a corridor, Proceedings of the second annual symposium on Computational geometry, p.187-192, June 02-04, 1986, Yorktown Heights, New York, United States [doi>10.1145/10515.10536]
	19	P. Mufti and M. Rueher. A cooperative scheme for solving constraints over the reals. In Hoon Hong, editor, Proc. of PASCO 94: First Parallel Symbolic Computation Symposium, volume 5, pages 284-293. World Scientific, 1994.
	20	M. Meier and J. & al Schimpf. ECLiPSe User Manual. Technical report ECRC-93-6, ECRC, Munich (Germany), 1993.
	21	Eric Monfroy, Gröbner Bases: Strategies and Applications, Proceedings of the International Conference on Artificial Intelligence and Symbolic Mathematical Computation, p.133-151, August 03-06, 1992
	22	E. Monfroy. Non Linear Constraints: a Language and a Solver. Report 93, ECRC, Munich (Germany), FEV 1993.
	23	Greg Nelson , Derek C. Oppen, Simplification by Cooperating Decision Procedures, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.2, p.245-257, Oct. 1979 [doi>10.1145/357073.357079]
	24	OMG. The Common Object Request Broker: Architecture and Specification. Technical Report OMG Document Number 91.12.1, Revision 1.1, OMG, December 1991.
	25	0. Perrin and N. Boudjlida. A Formal Framework and a Procedural Approach for Data Interchange. In IEEE Computer Society Press, editor, Proceeding8 of the 3rd International Conference on System Integration, S~o Paulo, Brazil, August 1994.
	26	Gilles Pesant , Michael Boyer, QUAD-CLP(R): Adding the Power of Quadratic Constraints, Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, p.95-108, May 02-04, 1994
	27	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	28	Michel Rueher, An Architecture for Cooperating Constraint Solvers on Reals, Selected Papers from Constraint Programming: Basics and Trends, p.231-250, May 16-20, 1994
	29	Pascal Van Hentenryck, Constraint satisfaction in logic programming, MIT Press, Cambridge, MA, 1989

CITED BY 3

	Farhad Arbab , Eric Monfroy, Using coordination for cooperative constraint solving, Proceedings of the 1998 ACM symposium on Applied Computing, p.139-148, February 27-March 01, 1998, Atlanta, Georgia, United States
	Farhad Arbab , Eric Monfroy, Coordination of heterogeneous distributed cooperative constraint solving, ACM SIGAPP Applied Computing Review, v.6 n.2, p.4-17, Sept. 1998
	Laurent Granvilliers , Eric Monfroy , Frédéric Benhamou, Symbolic-interval cooperation in constraint programming, Proceedings of the 2001 international symposium on Symbolic and algebraic computation, p.150-166, July 2001, London, Ontario, Canada