This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
F. Baader and T. Nipkow 1998. Term Rewriting and All That. Cambridge University Press, New York.
H. Betz and T. Frühwirth 2005. A Linear-Logic Semantics for Constraint Handling Rules. In Principles and Practice of Constraint Programming, 11th International Conference, CP 2005, P. van Beek , Ed. Lecture Notes in Computer Science, vol. 3709. Springer-Verlag, Sitges, Spain, 137–151.
T. Frühwirth 2000. Proving termination of constraint solver programs. In Selected Papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Constraints, K. R. Apt , A. C. Kakas , E. Monfroy and F. Rossi , Eds. Lecture Notes in Computer Science, vol. 1865. Springer-Verlag, 298–317.
T. Frühwirth 2009. Constraint Handling Rules. Cambridge University Press.
H.-J. Kreowski and G. Valiente 2000. Redundancy and subsumption in high-level replacement systems. In TAGT'98: Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations, H. G. Ehrig , G. Engels , H.-J. Kreowski and G. Rozenberg , Eds. Lecture Notes in Computer Science, vol. 1765. Springer-Verlag, 215–227.
D. Plump 1995. On Termination of graph rewriting. In Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Proceedings, M. Nagl , Ed. Lecture Notes in Computer Science, vol. 1017. Aachen, Germany, 88–100.