1. T. Aoto. Soundness of rewriting induction based on an abstract principle. IPSJ Transactions on Programming 49(SIG 1 (PRO 35)):28--38 2008. T. Aoto. Soundness of rewriting induction based on an abstract principle. IPSJ Transactions on Programming 49(SIG 1 (PRO 35)):28--38 2008.
2. Termination of term rewriting using dependency pairs
3. Automated Theorem Proving by Test Set Induction
4. A.
Bouhoula
and
F.
Jacquemard
.
Automated induction with constrained tree automata. In A. Armando P. Baumgartner and G. Dowek editors Proceedings of the 4th International Joint Conference on Automated Reasoning volume
5195
of
Lecture Notes in Computer Science pages
539
--
554
.
Springer 2008
. 10.1007/978-3-540-71070-7_44 A. Bouhoula and F. Jacquemard. Automated induction with constrained tree automata. In A. Armando P. Baumgartner and G. Dowek editors Proceedings of the 4th International Joint Conference on Automated Reasoning volume 5195 of Lecture Notes in Computer Science pages 539--554. Springer 2008. 10.1007/978-3-540-71070-7_44