Art

J-GLOBAL ID：200902139267645264   Reference number：95A0262270

Mechanizing Explicit Inductive Equational Reasoning by DTRC.

DTRCによる陽な帰納的方程式推論の機械化

Author (3)： FENG S (Nagoya Univ., Nagoya-shi, JPN) ,  SAKABE T (Nagoya Univ., Nagoya-shi, JPN) ,  INAGAKI Y (Nagoya Univ., Nagoya-shi, JPN)
Material： IEICE Transactions on Information and Systems (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Inf Syst (Inst Electron Inf Commun Eng))
Volume： E78-D  Issue： 2  Page： 113-121  Publication year： Feb. 1995 
JST Material Number： L1371A  ISSN： 0916-8532  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： inductive inference ,...
Semi thesaurus term： structural induction

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=95A0262270&from=J-GLOBAL&jstjournalNo=L1371A") }}

JST classification (1)： Artificial intelligence  (JE08000Z)

Reference (10)：

• FENG, S. Dynamic Term Rewriting Calculus and its Application. IEICE Technical Report. 1991, COMP, 91-147
• FENG, S. Interpretation of Conditional Term Rewriting System by DTRC. Proc. of 9th Conference of Japan Society for Software Science and Technology. 1992, 313-316
• HUET, G. Proofs by Induction in Equational Theories with Constructors. Rapports de Recherch, INRIA. 1980, 28
• HUET, G. Equations and rewrite rules: A survey. Formal Language Theory: Perspectives and Open Problems. 1980, 349-405
• JOUANNAUD, J. P. Proof by induction in equational theories without constructors. Proc. of 1st Symp. on Logic In Computer Science. 1986, 358-366

Terms in the title (3)： 方程式 ,  推論 ,  機械化