MBASE: Representing knowledge and context for the integration of mathematical software systems

被引:21
作者
Kohlhase, M [1 ]
Franke, A
机构
[1] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
[2] Univ Saarland, D-6600 Saarbrucken, Germany
关键词
D O I
10.1006/jsco.2000.0468
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this article we describe the data model of the MBASE system, a web-based, distributed mathematical knowledge base. This system is a mathematical service in MATHWEB that offers a universal repository of formalized mathematics where the formal representation allows semantics-based retrieval of distributed mathematical facts. We classify the data necessary to represent mathematical knowledge and analyze its structure. For the logical formulation of mathematical concepts, we propose a methodology for developing representation formalisms for mathematical knowledge bases. We propose to concretely equip knowledge bases with a hierarchy of logical systems that are linked by logic morphisms. These mappings relativize formulae and proofs and thus support translation of the knowledge to the various formats currently in use in deduction systems. On the other hand they define higher language features from simpler ones and ultimately serve as a means to found the whole knowledge base in axiomatic set theory. The viability of this approach is proven by developing a sorted record-lambda -calculus with dependent sorts and labeled abstraction that is well-suited both for formalizing mathematical practice and supporting efficient inference services. This "mathematical vernacular" is an extension of a sorted lambda -calculus by records, dependent record sorts and selection sorts. (C) 2001 Academic Press.
引用
收藏
页码:365 / 402
页数:38
相关论文
共 46 条
[1]  
ADAMS A, 1999, VSDITLU VERIFIABLE S, P112
[2]  
AITKACI H, 1993, LNCS, V761
[3]  
Andrews P, 1986, An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof
[4]   TPS: A theorem-proving system for classical type theory [J].
Andrews, PB ;
Bishop, M ;
Issar, S ;
Nesmith, D ;
Pfenning, F ;
Xi, HW .
JOURNAL OF AUTOMATED REASONING, 1996, 16 (03) :321-353
[5]  
ARMANDO A, 2001, CALCULEMUS 2000 SYST
[6]  
AUTEXIER S, 2000, LNCS, V1827
[7]  
Ballarin C., 1995, Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, ISSAC '95, P150, DOI 10.1145/220346.220366
[8]   Analytics - An experiment in combining theorem proving and symbolic computation [J].
Bauer, A ;
Clarke, E ;
Zhao, XD .
JOURNAL OF AUTOMATED REASONING, 1998, 21 (03) :295-325
[9]  
Benzmuller C, 1997, LECT NOTES ARTIF INT, V1249, P252
[10]  
BENZMULLER C, 1999, J UNIVERSAL COMPUT S, V5