Abstract
In this paper we introduce a cooperative scheme for solving systems of constraints over the reals. First, we informally show how an appropriate combination of symbolic and numeric solvers makes it possible to solve problems that none of these solvers can tackle alone. Then, we specify a cooperative architecture which allows to use concurrently heterogeneous solvers when handling constraints over the reals. This architecture is based upon agents that communicate via asynchronous message passing. Agent are synchronized when a failure or a success occurs. Disjunctive constraints are handled by backtracking. Operational semantics and terminating conditions of such systems are discussed. Message processing is detailed for both the general case where several non-deterministic solvers are involved in the cooperation, and for more specialized architectures.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Philippe Marti has implemented the prototype and we have had many constructive discussions. Thanks to Patrice Boizumault, Olivier Lhomme, Christine Solnon and Dan Vlasie for their careful reading of the different versions of the paper and for their helpful comments.
Thanks: Philippe Marti has implemented the prototype and we have had many constructive discussions. Thanks to Patrice Boizumault, Olivier Lhomme, Christine Solnon and Dan Vlasie for their careful reading of the different versions of the paper and for their helpful comments.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Gul Agha. Actors: A model of Concurrent Computation in distributed Systems. MIT Press, 1986.
Henri Beringer and Bruno De Backer. Combinatorial problem solving in constraint logic programming with cooperative solvers. In C. Beierle and L. Plumer, editors, Logic Programming: formal methods and practical applications. Elsevier Science Publisher B.V., 1994. to appear.
Frédéric Benhamou, David McAllester, and Pascal Van Hentenryck. Clp(intervals) revisited. Technical Report CS-94-18, Department of Computer Science, Brown University, April 1994.
Bruno Buchberger. Gröbner bases: An algorithmic method in polynomial ideal theory. In N. K. Bose, editor, Multidimensional Systems Theory, pages 184–232. Reidel Publishing Co., 1985.
[CGG+91] B.W. Char, K.O. Geddes, G.H. Gonnet, M.B. Monagan, B.L. Leong, and S.M. Watt al. Maple V Language Reference Manual. Springer-Verlag, New York, ISBN 0-387-97622-1, 1991.
G.E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. LNCS, pages 134–183., 1975.
Alain Colmerauer. An introduction to PROLOG-III. Communications of the ACM, 33(7):69–90, July 1990.
Alain Colmerauer. Résolution naive de contraintes non linéaires. Technical report, Groupe Intelligence Artificielle, Université Aix-Marseille II, March 1992.
F. de Boer, J. Kok, C. Palamidessi, and J. Rutten. Non-monotonic concurrent constraint programming. In Proc. of International Logic Programming Symposium, pages 315–334, 1993.
E.H. Durfee, V.R. Lesser, and D.D. Corkill. Cooperative distributed problem solving. In E.A. Feigenbaum A. Barr, P.R. Cohen, editor, The Handbook of Artificial Intelligence, volume IV, pages 83–147. Addison-Wesley Pub. Co., Reading, MA, 1989.
T. Finin, D. McKay, and R. McEntire. KQML-A Language and Protocol for Knowledge and Information Exchange. Technical Report CS-94-02, Computer Science Department, University of Maryland, UMBC, Baltimore MD 21228, 1994.
K. O. Geddes, S. R. Czapor, and G. Labah. Algorithms for computer algebra. Kluwer Academic Publishers, 1991.
Carl Hewitt. Viewing control structures aspatterns of message passing. Artificial Inteligence, 8, 1977.
Hoon Hong. Non-linear constraints solving over reals numbers in constraint logic programming introducing RISC-CLP. Technical Report 92-08, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, 1992.
Hoon Hong. Risc-clp(real): Logic programming with non-linear constraints over the reals. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Research. MIT Press, 1993.
Hoon Hong. Confluency of cooperative constraint solver. Technical report, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, 1994.
[HSS+92] W. S. Havens, S. Sidebottom, G. Sidebottom, J. Jones, and R. Ovans. Echidna: A constraint logic programming shell. In Proc. Pacific Rim International Conference on Artificial Intelligence, Seuol, Korea, 1992.
Joxan Jaffar and Michael J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 1994.
Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. The CLP(R) language and system. ACM Transactions on Programming Languages and Systems (TOPLAS), 14(3):339–395, July 1992.
Y. Labrou and T. Finin. A semantic approach for KQML-a general purpose communication language for software agents. In Proc of CIKM'94, 1994. to appear.
Olivier Lhomme. Consistency techniques for numeric CSPs. In Proc. IJCAI93, Chambery, (France), pages 232–238, August 1993.
J. H. M. Lee and M. H. van Emden. Adapting CLP(R) to floatingpoint arithmetic. In Fifth Generation Computer Systems, pages 996–1003, Tokyo, Japan, 1992. (also appears as report LP-18 (DCS-183-IR) Univ. of Victoria).
A. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99–118, 1977.
R.E. Moore. Interval Analysis. Prentice Hall, 1966.
Philippe Marti and Michel Rueher. A cooperative scheme for solving constraints over the reals. In Hoon Hong, editor, Proc. of PASCO94: First Parallel Symbolic Computation Symposium, volume 5 of Lecture Notes in Computing, pages 284–293. World Scientific, 1994.
U. Montanari, F. Rossi, and V. Saraswat. CC programs with both in-and non-determinism: A concurrent semantics. In Alan Borning, editor, Proc. of PPCP'94: Second Workshop on Principles and Practice of Constraint Programming, 1994.
Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (TOPLAS), 1(2):245–257, October 1979.
G. Pesant and M. Boyer. QUAD-CLP(R): Adding the power of quadratic constraints. In Alan Borning, editor, PPCP'94: Second Workshop on Principles and Practice of Constraint Programming, Seattle, May 1994.
Michel Rueher. A first exploration of prologIII's capabilities. Software-Practice and Experience, 23:177–200, 1993.
Vijay Anand Saraswat. Concurrent Constraint Programming. MIT Press, 1993.
Vijay A. Saraswat, Kenneth M. Kahn, and Jacob Levy. Janus: A step towards distributed constraint programming. In Proceedings North American Conference on Logic Programming, 1990.
V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundation of concurrent constraint programming. In Proceedings of the 18th ACM Symposium on Principles of Programming Language, pages 333–352, 1991.
E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
D.L. Waltz. Generating semantic descriptions from drawings of scenes with shadows. Tech. rept. ai-tr-271, IT, Cambridge, MA, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rueher, M. (1995). An architecture for cooperating constraint solvers on reals. In: Podelski, A. (eds) Constraint Programming: Basics and Trends. TCS School 1994. Lecture Notes in Computer Science, vol 910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59155-9_13
Download citation
DOI: https://doi.org/10.1007/3-540-59155-9_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59155-9
Online ISBN: 978-3-540-49200-9
eBook Packages: Springer Book Archive