Decision procedures for proving inductive theorems without induction

T Aoto, S Stratulat - Proceedings of the 16th International Symposium on …, 2014 - dl.acm.org
Automated inductive reasoning for term rewriting has been extensively studied in the
literature. Classes of equations and term rewriting systems (TRSs) with decidable inductive …
被引用次数：11 相关文章
[PDF] niigata-u.ac.jp

[PDF][PDF] Decision Procedures for Proving Inductive Theorems without Induction

T Aoto, S Stratulat - 2014 - nue.ie.niigata-u.ac.jp
Automated inductive reasoning for term rewriting has been extensively studied in the
literature. Classes of equations and term rewriting systems (TRSs) with decidable inductive …

Decision Procedures for Proving Inductive Theorems without Induction

T Aoto, S Stratulat - … Symposium on Principles and Practice of …, 2014 - inria.hal.science
Automated inductive reasoning for term rewriting has been extensively studied in the
literature. Classes of equations and term rewriting systems (TRSs) with decidable inductive …
[PDF] archive.org

[PDF][PDF] Decision Procedures for Proving Inductive Theorems without Induction

T Aoto, S Stratulat - 2014 - scholar.archive.org
Automated inductive reasoning for term rewriting has been extensively studied in the
literature. Classes of equations and term rewriting systems (TRSs) with decidable inductive …

Decision Procedures for Proving Inductive Theorems without Induction

T Aoto, S Stratulat - 16th International Symposium on Principles and …, 2014 - hal.science
Automated inductive reasoning for term rewriting has been extensively studied in the
literature. Classes of equations and term rewriting systems (TRSs) with decidable inductive …
[PDF] hal.science

[PDF][PDF] Decision Procedures for Proving Inductive Theorems without Induction

T Aoto, S Stratulat - 2014 - hal.science
Automated inductive reasoning for term rewriting has been extensively studied in the
literature. Classes of equations and term rewriting systems (TRSs) with decidable inductive …