Results 1 - 10
of
15
User Interaction with the Matita Proof Assistant
- Journal of Automated Reasoning, Special
, 2006
"... Abstract. Matita is a new, document-centric, tactic-based interactive theorem prover. This paper focuses on some of the distinctive features of the user interaction with Matita, mostly characterized by the organization of the library as a searchable knowledge base, the emphasis on a high-quality not ..."
Abstract
-
Cited by 29 (13 self)
- Add to MetaCart
Abstract. Matita is a new, document-centric, tactic-based interactive theorem prover. This paper focuses on some of the distinctive features of the user interaction with Matita, mostly characterized by the organization of the library as a searchable knowledge base, the emphasis on a high-quality notational rendering, and the complex interplay between syntax, presentation, and semantics.
A content based mathematical search engine: whelp
- In: Post-proceedings of the Types 2004 International Conference, Vol. 3839 of LNCS
, 2004
"... Abstract. The prototype of a content based search engine for mathematical knowledge supporting a small set of queries requiring matching and/or typing operations is described. The prototype — called Whelp — exploits a metadata approach for indexing the information that looks far more flexible than t ..."
Abstract
-
Cited by 15 (7 self)
- Add to MetaCart
Abstract. The prototype of a content based search engine for mathematical knowledge supporting a small set of queries requiring matching and/or typing operations is described. The prototype — called Whelp — exploits a metadata approach for indexing the information that looks far more flexible than traditional indexing techniques for structured expressions like substitution, discrimination, or context trees. The prototype has been instantiated to the standard library of the Coq proof assistant extended with many user contributions. 1
Integrated Semantic Browsing of the Mizar Mathematical Library for Authoring Mizar Articles
- Proceeding of the Third International Conference on Mathematical Knowledge Management
, 2004
"... articles ..."
Information retrieval and rendering with MML Query
- Proc. of MKM 2006, Lecture Notes in Artificial Intelligence 4108
, 2006
"... Abstract. Mizar, a proof-checking system, is used to build the Mizar Mathematical Library (MML). MML Query is a semantics-based tool for managing the mathematical knowledge in Mizar including searching, browsing and presentation of the evolving MML content. The tool is becoming widely used as an aid ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
Abstract. Mizar, a proof-checking system, is used to build the Mizar Mathematical Library (MML). MML Query is a semantics-based tool for managing the mathematical knowledge in Mizar including searching, browsing and presentation of the evolving MML content. The tool is becoming widely used as an aid for Mizar authors and plays an essential role in the ongoing reorganization of MML. We present new features of MML Query implemented in the third release and describe the possibilities offered by them. 1
Efficient Ambiguous Parsing of Mathematical Formulae
- IN: PROCEEDINGS OF MATHEMATICAL KNOWLEDGE MANAGEMENT 2004, VOL. 3119 OF LNCS
, 2004
"... Mathematical notation has the characteristic of being ambiguous: operators can be overloaded and information that can be deduced is often omitted. Mathematicians are used to this ambiguity and can easily disambiguate a formula making use of the context and of their ability to find the right interp ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
Mathematical notation has the characteristic of being ambiguous: operators can be overloaded and information that can be deduced is often omitted. Mathematicians are used to this ambiguity and can easily disambiguate a formula making use of the context and of their ability to find the right interpretation. Software applications that have to deal with formulae usually avoid these issues by fixing an unambiguous input notation. This solution is annoying for mathematicians because of the resulting tricky syntaxes and becomes a show stopper to the simultaneous adoption of tools characterized by different input languages. In this paper we present an efficient algorithm suitable for ambiguous parsing of mathematical formulae. The only requirement of the algorithm is the existence of a “validity” predicate over abstract syntax trees of incomplete formulae with placeholders. This requirement can be easily fulfilled in the applicative area of interactive proof assistants, and in several other areas of Mathematical Knowledge Management.
Searching Mathematics on the Web: State of the Art and Future Developments
- In: Proceedings of New Developments in Electronic Publishing of Mathematics, p. 9-18, Edited by FIZ
, 2004
"... Abstract. A huge amount of mathematical knowledge is nowadays available on the World Wide Web. Many different solutions and technologies for searching that knowledge have been developed as well. We present the state of the art of searching mathematics on the web, giving some insight on future develo ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract. A huge amount of mathematical knowledge is nowadays available on the World Wide Web. Many different solutions and technologies for searching that knowledge have been developed as well. We present the state of the art of searching mathematics on the web, giving some insight on future developments in this area. 1.
A Foundation for a Mathematical Web Services Query Language: A Survey on Relevant Query Languages and Tools
, 2004
"... In this report, we briefly present a survey on a number of query languages and tools that can serve as a basis for querying mathematical service descriptions. Our ultimate goal is to design and implement a mathematical services query language based on some selected features of these query languages. ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
In this report, we briefly present a survey on a number of query languages and tools that can serve as a basis for querying mathematical service descriptions. Our ultimate goal is to design and implement a mathematical services query language based on some selected features of these query languages.
FoCDoc: The Documentation System of FoC
, 2003
"... FoC is a computer algebra library with a strong emphasis on formal certification of its algorithms. We present in this article our work on the link between the FoC language and OMDoc, an emerging XML standard to represent and share mathematical contents. On the one hand, we focus on the elaborat ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
FoC is a computer algebra library with a strong emphasis on formal certification of its algorithms. We present in this article our work on the link between the FoC language and OMDoc, an emerging XML standard to represent and share mathematical contents. On the one hand, we focus on the elaboration of the documentation system FoCDoc. After an analysis of an OMDoc approach of the documentation we present our own XML implementation (FoCDoc) and how we generate, from a FoC program, documentation files in HTML (MathML), LaTEX and OMDoc. On the other
Automated Reasoning for Mizar: Artificial Intelligence through Knowledge Exchange
"... This paper gives an overview of the existing link between the Mizar project for formalization of mathematics and Automated Reasoning tools (mainly the Automated Theorem Provers (ATPs)). It explains the motivation for this work, gives an overview of the translation method, discusses the projects and ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
This paper gives an overview of the existing link between the Mizar project for formalization of mathematics and Automated Reasoning tools (mainly the Automated Theorem Provers (ATPs)). It explains the motivation for this work, gives an overview of the translation method, discusses the projects and works that are based on it, and possible future projects and directions. 1

