Author:
Aoto Takahito,Stratulat Sorin
Reference33 articles.
1. L. Aceto, Z. Ésik, and A. Ingólfsdóttir. The max-plus algebra of the natural numbers has no finite equational basis. Theoretical Computer Science, 293:169--188, 2003.
2. T. Aoto. Designing a rewriting induction prover with an increased capability of non-orientable equations. In Proc. of 1st SCSS, volume 08-08 of RISC Technical Report, pages 1--15, 2008.
3. T. Aoto. Sound lemma generation for proving inductive validity of equations. In Proc. of 28th FSTTCS, volume 2 of LIPIcs, pages 13--24. Schloss Dagstuhl, 2008.
4. A. Armando, M. Rusinowitch, and S. Stratulat. Incorporating decision procedures in implicit induction. Journal of Symbolic Computation, 34:241--258, 2002.
5. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Conditional Axioms and Associated Inference Rules;Axioms;2024-05-07
2. SPIKE, an automatic theorem prover — revisited;2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2020-09
3. A Constructor-Based Reachability Logic for Rewrite Theories;Fundamenta Informaticae;2020-03-31
4. Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07
5. Variant-based satisfiability in initial algebras;Science of Computer Programming;2018-03