Reading PAGE
Peer Evaluation activity
| Trusted by | 2 |
| Views | 6 |
Total impact ?
Send a 
Claudio has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
This was brought to you by:
Followblock this user Claudio Sacerdoti Coen Trusted member
Lecturer
Dipartimento Di Scienze dell'Informazione, Universita' di Bologna
Formal Mathematics on the Web
Oh la la
Your session has expired but don’t worry, your message
has been saved.Please log in and we’ll bring you back
to this page. You’ll just need to click “Send”.
Your evaluation is of great value to our authors and readers. Many thanks for your time.
Your mailing list is currently empty.
It will build up as you send messages
and links to your peers.
Enter the e-mail addresses of your recipients in the box below. Note: Peer Evaluation will NOT store these email addresses log in
Your message has been sent.
Description
Title : Formal Mathematics on the Web
Area : Computer Science
Language : English
Url : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.23.1760&rep=rep1&type=pdf
Doi : 10.1.1.23.1760
Abstract : The World Wide Web is already now the main repository and vehicle for mathematical knowledge, and its relevance is likely to be exponentiated by emerging publishing technologies like MathML. However, almost all mathematical documents available on the Web are marked up only for presentation: they are machine readable, but not machine-understandable. This step is precisely the goal of the so called Semantic Web (see [6]): establishing a layer of machine understandable data will allow automated agents, sophisticated search engines and interoperable services, will enable higher degree of automation and more intelligent applications. For instance, in the case of mathematics, a semantic (or content) desription, with respect to a merely presentational one, opens the possibility to o er major and innovative services like -- Preservation of the real informative content in a highly structur...
Subject : unspecifiedArea : Computer Science
Language : English
| Affiliations : |
Doi : 10.1.1.23.1760
Leave a comment
This contribution has not been reviewed yet. review?
You may receive the Trusted member label after :
• Reviewing 10 uploads, whatever the media type.
• Being trusted by 10 peers.
• If you are blocked by 10 peers the "Trust label" will be suspended from your page. We encourage you to contact the administrator to contest the suspension.
Please select an affiliation to sign your evaluation:
Please select an affiliation:
Claudio's Peer Evaluation activity
| Trusted by | 2 |
- FPeer Evaluation, Publisher, Peer Evaluation.
- FPierre Lescanne, Professor, LIP, ENS de Lyon, LYON, France.
| Views | 6 |
- 11 Declarative Representation of Proof Terms
- 1A constructive proof of the soundness of the encoding of random access machines in a linda calculus with ordered semantics
- 1Brokers and Web-services for automatic deduction: a case study
- 1Calculus of (co)Inductive Constructions: Part I
- 1Crafting a Proof Assistant
- 1Formal Mathematics on the Web
Claudio has...
| Trusted | 0 |
| Reviewed | 0 |
| Emailed | 0 |
| Shared/re-used | 0 |
| Discussed | 0 |
| Invited | 0 |
| Collected | 0 |
Full Text request
Your request will be sent.
Please enter your email address to be notified
when this article becomes available
Your email