Publisher
Springer International Publishing
Reference27 articles.
1. Aoto, T.: Rewriting induction using termination checkers. In: Proceedings of the JSSST 24th Annual Conference, pp. 1–4. No. 3C-C (2007). http://www.nue.ie.niigata-u.ac.jp/~aoto/research/papers/report/itp.pdf. (in Japanese)
2. Aoto, T., Toyama, Y.: Ground confluence prover based on rewriting induction. In: Kesner, D., Pientka, B. (eds.) Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction. LIPIcs, vol. 52, pp. 33:1–33:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016). https://doi.org/10.4230/LIPIcs.FSCD.2016.33
3. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998). https://doi.org/10.1017/CBO9781139172752
4. Bouhoula, A.: Automated theorem proving by test set induction. J. Symb. Comput. 23(1), 47–77 (1997). https://doi.org/10.1006/jsco.1996.0076
5. Bouhoula, A., Jacquemard, F.: Sufficient completeness verification for conditional and constrained TRS. J. Appl. Log. 10(1), 127–143 (2012). https://doi.org/10.1016/j.jal.2011.09.001