• Armando A, Bonacina M, Ranise S and Schulz S. (2009). New results on rewrite-based satisfiability procedures. ACM Transactions on Computational Logic. 10:1. (1-51). Online publication date: 1-Jan-2009.

    https://doi.org/10.1145/1459010.1459014

  • Snyder W. (1989). Efficient ground completion. Rewriting Techniques and Applications. 10.1007/3-540-51081-8_123. (419-433).

    http://link.springer.com/10.1007/3-540-51081-8_123

  • Hoffmann C and O'Donnell M. (1982). Pattern Matching in Trees. Journal of the ACM. 29:1. (68-95). Online publication date: 1-Jan-1982.

    https://doi.org/10.1145/322290.322295

  • Pratt V. Program logic without binding is decidable. Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (159-163).

    https://doi.org/10.1145/567532.567550

  • Samet H and Marcus L. (1980). Purging in an equality data base. Information Processing Letters. 10.1016/S0020-0190(80)90081-2. 10:2. (89-95). Online publication date: 1-Mar-1980.

    http://linkinghub.elsevier.com/retrieve/pii/S0020019080900812

  • Pratt V. (1979). Axioms or algorithms. Mathematical Foundations of Computer Science 1979. 10.1007/3-540-09526-8_12. (160-169).

    http://link.springer.com/10.1007/3-540-09526-8_12