Conference
Mathematical Knowledge Management
About: Mathematical Knowledge Management is an academic conference. The conference publishes majorly in the area(s): Mathematical proof & Proof assistant. Over the lifetime, 117 publications have been published by the conference receiving 1782 citations.
Topics: Mathematical proof, Proof assistant, Automated theorem proving, Mathematical knowledge management, Proof theory
Papers
16 Feb 2003
TL;DR: This work compares fifteen systems for the formalizations of mathematics with the computer based on the size of their library, the strength of their logic and their level of automation.
Abstract: We compare fifteen systems for the formalizations of mathematics with the computer. We present several tables that list various properties of these programs. The three main dimensions on which we compare these systems are: the size of their library, the strength of their logic and their level of automation.
67 citations
16 Feb 2003
TL;DR: Issues concerning information retrieval, i.e., searching, browsing and presentation of MML contents are described and a web-based tool providing such functionalities is being implemented by G. Bancerek.
Abstract: Mizar, a proof-checking system, is used to build the Mizar Mathematical Library (MML) This is a long term project aiming at building a comprehensive library of mathematical knowledge We describe issues concerning information retrieval, ie, searching, browsing and presentation of MML contents A web-based tool providing such functionalities is being implemented by G Bancerek We hope that our observations are helpful when solving similar problems for other repositories of formalized mathematics
59 citations
11 Aug 2006
TL;DR: This paper will present the short-term goals and state of the art of math-aware fine-grain search, and discuss what needs to be done to fulfill those roles, emphasizing two key components: similarity search and math metadata.
Abstract: Math-aware fine-grain search is expected to be widely available. A key question is what roles it can play in mathematics. It will be argued that, besides finding information, math search can help advance and manage mathematical knowledge. This paper will present the short-term goals and state of the art of math-aware fine-grain search. Afterwards, it will focus on how math search can help advance and manage mathematical knowledge, and discuss what needs to be done to fulfill those roles, emphasizing two key components. The first is similarity search, and how it applies to (1) discovering and drawing upon connections between different fields, and (2) proof development. The second is math metadata, which math search will surely encourage and benefit from, and which will be pivotal to mathematical knowledge management.
45 citations
Proceedings Article•
1 Jan 2001TL;DR: The leitmotiv is the extensive use of XML technology, and the exploitation of information in the “Web way”, that is without a central authority, with few basic rules, in a scalable, adaptable, and extensible manner.
Abstract: The paper describes the general philosophy and the main architectural and technological solutions adopted in the HELM Project for the management of large repositories of mathematical knowledge. The leitmotiv is the extensive use of XML technology, and the exploitation of information in the “Web way”, that is without a central authority, with few basic rules, in a scalable, adaptable, and extensible manner.
44 citations
15 Jul 2005
TL;DR: A parameterized proof data structure for the management of proofs is described, which supports and bridges the gap between abstract level proof explanation and low-level proof verification.
Abstract: A practically useful mathematical assistant system requires the sophisticated combination of interaction and automation. Central in such a system is the proof data structure, which has to maintain the current proof state and which has to allow the flexible interplay of various components including the human user. We describe a parameterized proof data structure for the management of proofs, which includes our experience with the development of two proof assistants. It supports and bridges the gap between abstract level proof explanation and low-level proof verification. The proof data structure enables, in particular, the flexible handling of lemmas, the maintenance of different proof alternatives, and the representation of different granularities of proof attempts.
36 citations
Performance Metrics
| Year | Papers |
|---|---|
| 2012 | 1 |
| 2010 | 1 |
| 2009 | 6 |
| 2007 | 6 |
| 2006 | 24 |
| 2005 | 26 |