C. Bertolissi, P. Baldan, H. Cirstea, and C. Kirchner, A Rewriting Calculus for Cyclic Higher-order Term Graphs, Proceedings of the 2nd International Workshop on Term Graph Rewriting, 2004.
DOI : 10.1016/j.entcs.2005.01.034
URL : https://hal.archives-ouvertes.fr/inria-00100095

F. Baader and T. Nipkow, Term Rewriting and all That, 1998.

[. Cirstea, G. Faure, and C. Kirchner, A ?-calculus of explicit constraint applications, Proceedings Fifth International Workshop on Rewriting Logic and its Applications, pp.47-63, 2004.

H. Cirstea and C. Kirchner, The rewriting calculus - part II, Logic Journal of IGPL, vol.9, issue.3, pp.427-498, 2001.
DOI : 10.1093/jigpal/9.3.377
URL : https://hal.archives-ouvertes.fr/inria-00100532

H. Cirstea, C. Kirchner, L. Liquori, and B. Wack, Rewrite Strategies in the Rewriting Calculus, Third International Workshop on Reduction Strategies in Rewriting and Programming, 2003.
DOI : 10.1016/S1571-0661(05)82613-1
URL : https://hal.archives-ouvertes.fr/inria-00099586

H. Cirstea, C. Kirchner, M. Moossen, and P. Moreau, Production systems and rete algorithm formalisation, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00099850

]. H. Com91 and . Comon, Disunification: a survey, Computational Logic. Essays in honor of Alan Robinson, chapter 9, pp.322-359, 1991.

H. Dubois-andhéì-ene and . Kirchner, Modelling planning problems with rules and strategies, 1999.

H. Dubois-andhéì-ene and . Kirchner, Rule based programming with constraints and strategies, ERCIM workshop on Constraints, 1999.

H. Dubois-andhéì-ene and . Kirchner, Objects, rules and strategies in ELAN, Proceedings of the second AMAST workshop on Algebraic Methods in Language Processing, 2000.

H. Dubois-andhéì-ene and . Kirchner, Rule Based Programming with Constraints and Strategies, New Trends in Constraints, Papers from the Joint ERCIM/Compulog-Net Workshop, Cyprus, pp.274-297, 1999.

H. Dubois, Systèmes de r` egles de production et calcul de réécriture, 2001.

S. Eker, Associative-commutative matching via bipartite graph matching, The Computer Journal, vol.38, issue.5, pp.381-399, 1995.
DOI : 10.1093/comjnl/38.5.381

I. , I. Lorraine, ]. F. Inria-rocquencourtfh86, G. Fages, and . Huet, Complete sets of unifiers and matchers in equational theories, Theoretical Computer Science, vol.43, issue.1, pp.189-200, 1986.

G. Faure and C. Kirchner, Exceptions in the Rewriting Calculus, Proceedings of the RTA conference, 2002.
DOI : 10.1007/3-540-45610-4_6
URL : https://hal.archives-ouvertes.fr/inria-00101011

F. Fages and R. Lissajoux, Systèmes experts temps-réel: une introduction au langage xrete. Revue Technique Thomson-CSF, pp.23-3633, 1991.

F. Fages and R. Lissajoux, Sémantique opérationnelle et compilation des systèmes de production. Revue d'intelligence artificielle, pp.6-4431, 1992.

C. Forgy, Ops5 user's manual, 1981.

C. Forgy, Rete: A fast algorithm for the many pattern/many object pattern match problem, Artificial Intelligence, vol.19, issue.1, pp.17-37, 1982.
DOI : 10.1016/0004-3702(82)90020-0

T. Frühwirthfr¨frühwirth, Theory and practice of constraint handling rules. Special Issue on Constraint Logic Programming, pp.98-135, 1998.

H. Jean and . Gallier, Logic for Computer Science: Foundations of Automatic Theorem Proving, volume 5 of Computer Science and Technology Series, 1986.

]. Hul79 and . Hullot, Associative-commutative pattern matching, Proceedings 9th International Joint Conference on Artificial Intelligence, 1979.

J. Hullot, Compilation de Formes Canoniques dans les ThéoriesThéories´Théorieséquationelles, Thèse de Doctorat deTroisì eme Cycle, 1980.

E. Donald, P. B. Knuth, and . Bendix, Simple word problems in universal algebras, Computational Problems in Abstract Algebra, pp.263-297, 1970.

[. Klay, E. Domenjoud, and C. Kirchner, Vérification sémantique de spécifications métallurgiques, 1993.

C. Kirchner-andhéì-ene and . Kirchner, Rewriting, solving, proving. A preliminary version of a book available at www, 1999.

C. Kirchner, M. Héì-ene-kirchner, and . Vittek, Implementing computational systems with constraints, Proceedings of the first PPCP workshop, 1994.

K. Héì-ene and P. Moreau, Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associativecommutative theories, Journal of Functional Programming, vol.11, issue.2, pp.207-251, 2001.

T. Laffey and A. Gupta, Real-time knownledge-based systems, 1989.

[. Lopez, The Parallel Production System, 1987.

D. Miranker, D. Brant, B. Lofaso, and D. Gadbois, On the performance of lazy matching in production systems, Knowledge Presentation, pp.685-692, 1990.

D. Miranker, Treat: a new and efficient match algorithm for AI production systems, 1990.

I. , I. Lorraine, ]. G. Inria-rocquencourtps81, M. E. Peterson, and . Stickel, Complete sets of reductions for some equational theories, Journal of the ACM, vol.28, pp.233-264, 1981.

R. [. Rubio and . Nieuwenhuis, A precedence-based total AC-compatible ordering, Proceedings 5th Conference on Rewriting Techniques and Applications, pp.374-388
DOI : 10.1007/3-540-56868-9_28

A. Rubio, A fully syntactic ac-rpo, pp.515-533, 2002.
DOI : 10.1007/3-540-48685-2_11

W. Snyder and J. Schmolze, Rewrite semantics for production rule systems: Theory and applications, Proceedings 13th International Conference on Automated Deduction, pp.508-522, 1996.
DOI : 10.1007/3-540-61511-3_110

]. M. Sti75 and . Stickel, A complete unification algorithm for associative-commutative functions, Proceedings 4th International Joint Conference on Artificial Intelligence, pp.71-76, 1975.

M. Bezem, J. W. Klop, and R. De-vrijer, Term Rewriting Systems, 2002.