A Query Language for a Metadata Framework about Mathematical Resources

Guidi, Ferruccio; Schena, Irene

doi:10.1007/3-540-36469-2_9

Cited by 21 publications

(19 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A priority signature uses the functional notation with priority levels in place of the constructor and each argument. Priority levels are here named after their most representative operator, and are ordered in the usual way (e.g., 'times' represents higher priority than 'plus') 3 . For example, the priority sig-nature of math:Minus, plus(plus,times), says that substraction has the same priority level as addition, and is left associative.…”

Section: Labelling Of Expressions In Rdf Toolsmentioning

confidence: 99%

“…When looking for integrals in x whose body contains x 2 , a textual search would have false positives such as 2x dx = x 2 + c (x 2 is not in the scope of ), and would have false negatives such as y 2 − y dy (y instead of x). On the contrary, the approaches based on a structured query language [1,3,6,13] correctly account for nested structures and bound variables by reasoning directly on the structure of expressions, and by using wild cards as place-holders for variables and sub-expressions. MathWebSearch [6] defines an XML query language that extends MathML.…”

Section: Query Languagesmentioning

confidence: 99%

“…For example, it should be possible to describe a theorem by its author, its discovery date, its informal description as a text, and its formal description as a mathematical expression, all in RDF. An expected advantage of the formal representation of expressions is the ability to search those expressions by their content, which is a problem that has been studied in mathematical search [3,6,16,12,1]. For example, we may wish to retrieve all expressions that are an integral in some variable x and whose body contains x 2 as a sub-expression.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An RDF Design Pattern for the Structural Representation and Querying of Expressions

Ferré

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Expressions, such as mathematical formulae, logical axioms, or structured queries, account for a large part of human knowledge. It is therefore desirable to allow for their representation and querying with Semantic Web technologies. We propose an RDF design pattern that fulfills three objectives. The first objective is the structural representation of expressions in standard RDF, so that expressive structural search is made possible. We propose simple Turtle and SPARQL abbreviations for the concise notation of such RDF expressions. The second objective is the automated generation of expression labels that are close to usual notations. The third objective is the compatibility with existing practice and legacy data in the Semantic Web (e.g., SPIN, OWL/RDF). We show the benefits for RDF tools to support this design pattern with the extension of SEWELIS, a tool for guided exploration and edition, and its application to mathematical search.

show abstract

Section: Labelling Of Expressions In Rdf Toolsmentioning

confidence: 99%

Section: Query Languagesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An RDF Design Pattern for the Structural Representation and Querying of Expressions

Ferré

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Finding mathematical results: Based on the semantics and the structure of the formalized mathematics, it should be possible to find results easier. Querying based on the (meaningful) structure is already possible (implemented in the Helm system, see [23]), but more semantical querying would be welcome. This requires adding more meta-data.…”

Section: Why C-corn?mentioning

confidence: 99%

C-CoRN, the Constructive Coq Repository at Nijmegen

Cruz-Filipe

Geuvers

Wiedijk

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present C-CoRN, the Constructive Coq Repository at Nijmegen. It consists of a mathematical library of constructive algebra and analysis formalized in the theorem prover Coq. We explain the structure and the contents of the library and we discuss the motivation and some (possible) applications of such a library. The development of C-CoRN is part of a larger goal to design a computer system where 'a mathematician can do mathematics', which covers the activities of defining, computing and proving. An important proviso for such a system to be useful and attractive is the availability of a large structured library of mathematical results that people can consult and build on. C-CoRN wants to provide such a library, but it can also be seen as a case study in developing such a library of formalized mathematics and deriving its requirements. As the actual development of a library is very much a technical activity, the work on C-CoRN is tightly bound to the proof assistant Coq.

show abstract

“…The second is formal-math search, such as the search systems developed and researched by Guidi et al [4,5], MoWGLI of the Helm project [12], and MIZAR [2]. Formal-math search systems are highly specialized and usually intended for advanced mathematicians, and are thus outside the scope of the paper.…”

Section: Introductionmentioning

confidence: 99%

Advances in math search

Youssef

2007

Proc Appl Math and Mech

View full text Add to dashboard Cite

As digital libraries of mathematical and scientific contents become available, it is essential to have math‐aware search systems. The search systems must understand math symbols and structures, and allow users to enter queries that involve not only text keywords but also mathematical expressions and fragments of expressions. In addition, the search results must be presented in a way that enables the user to find the desired information rapidly. This short paper gives a quick overview of the state of the art of math search, and focuses on the math search system that the author has developed for the Digital Library of Mathematical Functions (DLMF) project of the National Institute of Standards and Technology. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

show abstract

A Query Language for a Metadata Framework about Mathematical Resources

Cited by 21 publications

References 1 publication

An RDF Design Pattern for the Structural Representation and Querying of Expressions

An RDF Design Pattern for the Structural Representation and Querying of Expressions

C-CoRN, the Constructive Coq Repository at Nijmegen

Advances in math search

Contact Info

Product

Resources

About