Basic operators for solving constraints via collaboration of solvers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1930, Issue , 2001, Pages 142-156

  Castro, Carlos ^a   Monfroy, Eric ^b  

^a DEPARTAMENTO DE FÍSICA   (Chile)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONSTRAINT SOLVERS; DESIGNING SCHEME; FINITE DOMAINS; NON-LINEAR CONSTRAINTS; REAL NUMBER; STRATEGY LANGUAGES;

ARTIFICIAL INTELLIGENCE;

EID: 84974708329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44990-6_11     Document Type: Conference Paper

References (21)

1. F. Arbab and E. Monfroy. Heterogeneous distributed cooperative constraint solving using coordination. ACM Applied Computing Review, 6: 4-17, 1999.
2. F. Benhamou, F. Goualard, L. Granvilliers, and J. Puget. Revising Hull and Box Consistency. In Proc. of International Conference on Logic Programming, pages 230-244, Las Cruces, USA, 1999. The MIT Press.
3. F. Benhamou and L. Granvilliers. Combining Local Consistency, Symbolic Rewriting, and Interval Methods. In Proc. of AISMC3, volume 1138 of LNCS, pages 144-159, Steyr, Austria, 1996. Springer-Verlag.
4. H. Beringer and B. DeBacker. Combinatorial Problem Solving in Constraint Logic Programming with Cooperative Solvers. In C. Beierle and L. Plümer, editors, Logic Programming: Formal Methods and Practical Applications, Studies in Computer Science and Artificial Intelligence. North Holland, 1995.
5. A. Bockmayr and T. Kasper. A unifying framework for integer and finite domain constraint programming. Research Report MPI-I-97-2-008, Max Planck Institut für Informatik, Saarbrücken, Germany, Aug. 1997.
6. B. Buchberger. Gröbner Bases: an Algorithmic Method in Polynomial Ideal Theory. In N. K. Bose, editor, Multidimensional Systems Theory, pages 184-232. D. Reidel Publishing Company, Dordrecht - Boston - Lancaster, 1985.
7. C. Castro. Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies. Fundamenta Informaticae, 34(3): 263-293, June 1998.
8. C. Castro. COLETTE, Prototyping CSP Solvers Using a Rule-Based Language. In J. Calmet and J. Plaza, editors, Proc. of The Fourth International Conference on Artificial Intelligence and Symbolic Computation, AISC’98, volume 1476 of LNCS, pages 107-119, Plattsburgh, NY, USA, Sept. 1998. Springer-Verlag.
9. C. Castro and E. Monfroy. A Control Language for Designing Constraint Solvers. In Proc. of Third International Conference Perspective of System Informatics, PSI’99, volume 1755 of LNCS, pages 402-415, Novosibirsk, Russia, 2000. Springer-Verlag.
10. J.-C. Faugere. Résolution des systèmes d’équations algébriques. PhD thesis, Universit é Paris 6, France, 1994.
11. T. Frühwirth. Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of LNCS. Springer-Verlag, 1995.
12. K. Geddes, G. Gonnet, and B. Leong. Maple V: Language reference manual. Springer Verlag, New York, Berlin, Paris, 1991.
13. P. Marti and M. Rueher. A Distribuited Cooperating Constraints Solving System. International Journal of Artificial Intelligence Tools, 4(1-2): 93-113, 1995.
14. M. Meier and J. Schimpf. ECLiPSe User Manual. Technical Report ECRC-93-6, ECRC (European Computer-industry Research Centre), Munich, Germany, 1993.
15. E. Monfroy. Collaboration de solveurs pour la programmation logique `a contraintes. Phd thesis, Université Henri Poincaré - Nancy 1, France, Nov. 1996. Also available in english. On-line at: http://www.cwi.nl/~eric/Private/Publications/index.html.
16. E. Monfroy. An environment for designing/executing constraint solver collaborations. ENTCS (Electronic Notes in Theoretical Computer Science), 16(1), 1998.
17. E. Monfroy. The Constraint Solver Collaboration Language of BALI. In D. Gabbay and M. de Rijke, editors, Frontiers of Combining Systems 2, volume 7 of Studies in Logic and Computation, pages 211-230. Research Studies Press/Wiley, 2000.
18. E. Monfroy, M. Rusinowitch, and R. Schott. Implementing Non-Linear Constraints with Cooperative Solvers. In K. M. George, J. H. Carroll, D. Oppenheim, and J. Hightower, editors, Proc. of ACM Symposium on Applied Computing (SAC’96), Philadelphia, PA, USA, pages 63-72. ACM Press, February 1996.
19. G. Nelson and D. C. Oppen. Simplifications by Cooperating Decision Procedures. ACM Trans. on Programming Languages and Systems, 1(2): 245-257, Oct. 1979.
20. C. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In F. Baader and K. Schulz, editors, Proc. of First Int. Workshop Frontiers of Combining Systems, FroCoS’96, pages 121-139. Kluwer Academic Publishers, 1996.
21. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.