Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
ATP and presentation service for Mizar formalizations
Urban J., Rudnicki P., Sutcliffe G. Journal of Automated Reasoning50 (2):229-241,2013.Type:Article
Date Reviewed: Apr 18 2013

Mizar is a formal language used to write mathematical definitions and proofs that are as close as possible to vernacular. One can profit from Mizar by using it as: an integrated library (linked within itself) containing proofs generated through the protocols of Mizar; a proof checker, provided the proof is written according to Mizar syntax; or an assistant using Bayesian search to find suitable axioms or theorems that could serve as proofs.

The authors of this paper describe several aspects of these uses, concentrating mostly on the third, which is often known in computer science as an “authoring environment.” Through examples from graph theory, they show how Mizar can serve as an interactive tutorial or an assistant for constructing a proof, by finding suitable theorems.

The paper also makes some brief comparisons with other proof checkers or proof assistants, including Isabelle [1] (the Sledgehammer part).

Some concerns are expressed over the method for interacting with Mizar, either through Emacs or Hypertext Markup Language (HTML). The latter is prized for the possibility of using Extensible Markup Language (XML) to disambiguate mathematical symbols or definitions used in different areas of mathematics, with possibly different meanings.

Finally, the authors mention several problems to be worked out regarding possible links among the three uses, and with other systems, to make Mizar more efficient, and hence more attractive as a proof-checker, proof-assistant, and proof-publisher.

I recommend this paper to computer scientists working on operating systems, and mathematicians working on mathematical artificial intelligence or provability theory.

Reviewer:  Arturo Ortiz-Tapia Review #: CR141145 (1307-0646)
1) Isabelle. http://www.cl.cam.ac.uk/research/hvg/Isabelle/index.html. University of Cambridge. Accessed 04/17/2013.
Bookmark and Share
  Featured Reviewer  
 
Deduction And Theorem Proving (I.2.3 )
 
 
Systems Programs And Utilities (D.4.9 )
 
Would you recommend this review?
yes
no
Other reviews under "Deduction And Theorem Proving": Date
Noninteractive zero-knowledge
Blum M., De Santis A., Micali S., Persiano G. SIAM Journal on Computing 20(6): 1084-1118, 1991. Type: Article
Jan 1 1993
Cut elimination and automatic proof procedures
Zhang W. Theoretical Computer Science 91(2): 265-284, 1991. Type: Article
Apr 1 1993
A non-reified temporal logic
Bacchus F., Tenenberg J., Koomen J. Artificial Intelligence 52(1): 87-108, 1991. Type: Article
Oct 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy