Results 1  10
of
23
User Interaction with the Matita Proof Assistant
 Journal of Automated Reasoning, Special
, 2006
"... Abstract. Matita is a new, documentcentric, tacticbased 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 highquality not ..."
Abstract

Cited by 51 (15 self)
 Add to MetaCart
(Show Context)
Abstract. Matita is a new, documentcentric, tacticbased 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 highquality notational rendering, and the complex interplay between syntax, presentation, and semantics.
A content based mathematical search engine: whelp
 In: Postproceedings 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 20 (9 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
 Mathematical Knowledge Management, MKM’06, number 4108 in LNAI
, 2006
"... ..."
(Show Context)
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 6 (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.
Spurious disambiguation errors and how to get rid of them
 Journal of mathematics in computer science
, 2008
"... Abstract. The disambiguation approach to the input of formulae enables users of mathematical assistants to type correct formulae in a terse syntax close to the usual ambiguous mathematical notation. When it comes to incorrect formulae however, far too many typing errors are generated; among them we ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
Abstract. The disambiguation approach to the input of formulae enables users of mathematical assistants to type correct formulae in a terse syntax close to the usual ambiguous mathematical notation. When it comes to incorrect formulae however, far too many typing errors are generated; among them we want to present only errors related to the formula interpretation meant by the user, hiding errors related to other interpretations. We study disambiguation errors and how to classify them into the spurious and genuine error classes. To this end we give a general presentation of the classes of disambiguation algorithms and efficient disambiguation algorithms. We also quantitatively assess the quality of the presented error classification criteria benchmarking them in the setting of a formal development of constructive algebra.
Searching Mathematics on the Web: State of the Art and Future Developments
 In: Proceedings of New Developments in Electronic Publishing of Mathematics, p. 918, 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 3 (0 self)
 Add to MetaCart
(Show Context)
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.
Spurious Disambiguation Error Detection
"... Abstract. The disambiguation approach to the input of formulae enables the user to type correct formulae in a terse syntax close to the usual ambiguous mathematical notation. When it comes to incorrect formulae we want to present only errors related to the interpretation meant by the user, hiding er ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. The disambiguation approach to the input of formulae enables the user to type correct formulae in a terse syntax close to the usual ambiguous mathematical notation. When it comes to incorrect formulae we want to present only errors related to the interpretation meant by the user, hiding errors related to other interpretations (spurious errors). We propose a heuristic to recognize spurious errors, which has been integrated with the disambiguation algorithm of [6]. 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
(Show Context)
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.
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
(Show Context)
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