Theorem proving in a mathematical information environment

被引：0
作者：
Yu. V. Kapitonova
A. A. Letichevskii
机构：
来源：
Cybernetics and Systems Analysis | 1998年 / 34卷
关键词：
Theorem Prove; Constraint System; Entailment Relation; Mathematical Text; Artificial Theoretician;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：481 / 488
页数：7
相关论文
共 19 条
  • [1] Anufriev F. V.(1966)A theorem-proving algorithm in group theory Kibernetika 1 23-39
  • [2] Fedyurko V. V.(1972)Constructing a practical formal language for writing mathematical theories Kibernetika 2 19-28
  • [3] Letichevskii A. A.(1992)Conditional rewriting logic as a unified model of concurrency Theor. Comput. Sci. 96 73-155
  • [4] AseFderov Z. M.(1988)Constructive mathematical description of application domains Kibernetika 4 17-25
  • [5] Didukh I.(1993)Computations in APS Theor. Comput. Sci. 119 145-171
  • [6] Glushkov V. M.(1998)A general theory of action languages Kibern. Sist. Anal. 1 16-36
  • [7] Kapitonova Yu. V.(1970)Some problems in automata theory and artificial intelligence Kibernetika 2 3-13
  • [8] Letichevskii A. A.(undefined)undefined undefined undefined undefined-undefined
  • [9] Vershinin K. P.(undefined)undefined undefined undefined undefined-undefined
  • [10] Malevannyi N. P.(undefined)undefined undefined undefined undefined-undefined
12