Rule-Based Constraint Programming

Fundamenta Informaticae

Volumn 34, Issue 3, 1998, Pages 225-262

  Kirchner, Claude ^a   Ringeissen, Christophe ^a  

^a LORIA   (France)

Author keywords

Computational Systems; Constraint Programming; Constraint Solving; Rewriting Logic; Unification

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; KNOWLEDGE BASED SYSTEMS; PROBLEM SOLVING;

COMPUTATIONAL SYSTEM; CONSTRAINT PROGRAMMING; CONSTRAINT SOLVING; REWRITING LOGIC;

LOGIC PROGRAMMING;

EID: 0032089579     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1998-34302     Document Type: Article

References (53)

1. AC. Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, November 1991.
2. M. Adi and C. Kirchner. AC-unification race: the system solving approach, implementation and benchmarks. Journal of Symbolic Computation, 14(1):51-70, 1992.
3. I. Alouini and C. Kirchner. Toward the concurrent implementation of computational systems. In M. Hanus and M. Rodríguez-Artalejo, editors, Proceedings 5th International Conference on Algebraic and Logic Programming, Aachen (Germany), volume 1139 of Lecture Notes in Computer Science, pages 1-31, Aachen (Germany), September 1996. Springer-Verlag.
4. F. Baader and K. Schulz. On the combination of symbolic constraints, solution domains, and constraint solvers. In Proc. of CP'95, volume 976 of LNCS, pages 380-397, 1995.
5. F. Baader and K. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. Journal of Symbolic Computation, 21(2):211-243, February 1996.
6. P. Borovanský, C. Kirchner, and H. Kirchner. A functional view of rewriting and strategies for a semantics of ELAN. In M. Sato and Y. Toyama, editors, The Third Fuji International Symposium on Functional and Logic Programming, pages 143-167, Kyoto, April 1998. World Scientific.
7. P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. ELAN: A logical framework based on computational systems. In J. Meseguer, editor, Proceedings of the first international workshop on rewriting logic, volume 4 of Electronic Notes in TCS, Asilomar (California), September 1996.
8. P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. ELAN V 3.0 User Manual. Inria Lorraine & Loria, Nancy (France), second edition, January 1998.
9. A. Boudet. Combining unification algorithms. Journal of Symbolic Computation, 16(6):597-626, December 1993.
10. A. Boudet and E. Contejean. "Syntactic" AC-unification. In J.-P. Jouannaud, editor, First International Conference on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 136-151, München, Germany, September 1994. Springer-Verlag.
11. A. Boudet, E. Contejean, and H. Devie. A new AC unification algorithm with a new algorithm for solving diophantine equations. In Proceedings 5th IEEE Symposium on Logic in Computer Science, Philadelphia (Pa., USA), pages 289-299, June 1990.
12. H.-J. Bürckert, A. Herold, D. Kapur, J. Siekmann, M. E. Stickel, M. Tepp, and H. Zhang. Opening the AC-unification race. Journal of Automated Reasoning, 4(1):465-474, 1988.
13. W. Büttner, K. Estenfeld, R. Schmid, H.-A. Schneider, and E. Tiden. Symbolic constraint handling through unification in finite algebras. Applicable Algebra in Engineering, Communication and Computation, 1(2):97-118, 1990.
14. C. Castro. Constraint Manipulation using Rewrite Rules and Strategies. In A. Drewery, G.-J. M. Kruijff, and R. Zuber, editors, Proceedings of the Second ESSLLI Student Session, 9th European Summer School in Logic, Language and Information, ESSLLI'97, pages 45-56, Aix-en-Provence, France, August 1997.
15. M. Clausen and A. Fortenbacher. Efficient solution of linear diophantine equations. In C. Kirchner, editor, Unification, pages 377-392. Academic Press inc., London, 1990.
16. H. Comon, M. Dincbas, J.-P. Jouannaud, and C. Kirchner. A methodological view of constraint solving. Constraints, to appear.
17. J. Corbin and M. Bidoit. A rehabilitation of Robinson's unification algorithm. In R. Pavon, editor, Proceedings of 1983 IFIP Congress, pages 909-914. Elsevier Science Publishers B. V. (North-Holland), 1983.
18. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 6, pages 244-320. Elsevier Science Publishers B. V. (North-Holland), 1990.
19. T. Frühwirth. Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of Lecture Notes in Computer Science. Springer-Verlag, March 1995.
20. J.-M. Hullot. Compilation de Formes Canoniques dans les Théories équationelles. Thèse de Doctorat de Troisième Cycle, Université de Paris Sud, Orsay (France), 1980.
21. J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proceedings of the 14th Annual ACM Symposium on Principles Of Programming Languages, Munich (Germany), pages 111-119, 1987.
22. J. Jaffar and M. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19-20:503-582, 1994.
23. J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257-321. The MIT press, Cambridge (MA, USA), 1991.
24. S. Kepser and K. Schulz. Combination of constraint systems II: Rational amalgamation. In Proc. of CP'96, volume 1118 of LNCS, pages 282-296, 1996.
25. C. Kirchner. Méthodes et outils de conception systématique d'algorithmes d'unification dans les théories équationnelles. Thèse de Doctorat d'Etat, Université Henri Poincaré - Nancy 1, 1985.
26. C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue d'Intelligence Artificielle, 4(3):9-52, 1990. Special issue on Automatic Deduction.
27. C. Kirchner, H. Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The Newport Papers., chapter 8, pages 131-158. The MIT press, 1995.
28. C. Kirchner and F. Klay. Syntactic theories and unification. In Proceedings 5th IEEE Symposium on Logic in Computer Science, Philadelphia (Pa., USA), pages 270-277, June 1990.
29. H. Kirchner and C. Ringeissen. Combining symbolic constraint solvers on algebraic domains. Journal of Symbolic Computation, 18(2):113-155, 1994.
30. A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258-282, 1982.
31. N. Marti-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. Technical report, SRI International, 1993.
32. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.
33. E. Monfroy. Collaboration de solveurs pour la programmation logique à contraintes. PhD thesis, Université Henri Poincaré - Nancy 1, November 1996.
34. P.-E. Moreau. Compiling nondeterministic computations. Technical Report 98-R-005, CRIN, 1998.
35. P.-E. Moreau and H. Kirchner. Compilation techniques for associative-commutative normalisation. In Proceedings of International Workshop on Theory and Practice of Algebraic Specifications ASF+SDF 97, Workshops in Computing, Amsterdam, September 1997. Springer-Verlag.
36. C. G. Nelson and D. C. Oppen. Simplifications by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2), 1979.
37. T. Nipkow. Combining matching algorithms: The regular case. Journal of Symbolic Computation, pages 633-653, 1991.
38. W. Nutt, P. Réty, and G. Smolka. Basic narrowing revisited. In C. Kirchner, editor, Unification, pages 517-540. Academic Press inc., London, 1990.
39. A. Oplobedu, J. Marcovitch, and Y. Tourbier. Charme: Un Langage Industriel de Programmation par Contraintes, Illustré par une Application chez Renault. In 9th International Workshop on Expert Systems and their Applications: General Conference, volume 1, pages 55-70, Avignon, May 1989.
40. C. L. Pape, J.-F. Puget, C. Moreau, and P. Darneau. PMFP: The use of constraint-based programming for predictive personnel management. In A. G. Cohn, editor, Proceedings of the Eleventh European Conference on Artificial Intelligence, pages 8-12, Chichester, August 1994. John Wiley and Sons.
41. J.-F. Puget. Constraint programming. In M. Maher, editor, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, pages 3-6, Cambridge, September 1996. MIT Press.
42. C. Ringeissen. Combinaison de Résolutions de Contraintes. Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, December 1993.
43. C. Ringeissen. Combining decision algorithms for matching in the union of disjoint equational theories. Information and Computation, 126(2):144-160, May 1996.
44. C. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In F. Baader and K. Schulz, editors, Frontiers of Combining Systems, First International Workshop, Munich (Germany), Applied Logic, pages 121-140. Kluwer Academic Publishers, March 1996.
45. V. Saraswat. Concurrent Constraint Programming. MIT Press, Cambridge, London, 1993.
46. M. Schmidt-Schauß. Combination of unification algorithms. Journal of Symbolic Computation, 8(1 & 2):51-100, 1989. Special issue on unification. Part two.
47. th International Joint Conference on Artificial Intelligence, Tbilissi (USSR), pages 71-76, 1975.
48. M. E. Stickel. A unification algorithm for associative-commutative functions. Journal of the ACM, 28:423-434, 1981.
49. C. Tinelli and M. Harandi. Constraint logic programming over unions of constraint theories. In E. C. Freuder, editor, Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming, Cambridge, MA, USA, volume 1118 of Lecture Notes in Computer Science, pages 436-450. Springer-Verlag, August 1996.
50. C. Tinelli and M. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In F. Baader and K. Schulz, editors, Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Munich (Germany), Applied Logic, pages 103-120. Kluwer, March 1996.
51. M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, October 1994.
52. M. Vittek. A compiler for nondeterministic term rewriting systems. In H. Ganzinger, editor, Proceedings 7th Conference on Rewriting Techniques and Applications, New Brunswick (New Jersey, USA), volume 1103 of Lecture Notes in Computer Science, pages 154-168. Springer-Verlag, July 1996.
53. K. Yelick. Unification in combinations of collapse-free regular theories. Journal of Symbolic Computation, 3(1 & 2):153-182, April 1987.