Abstract
The Referee system (aka AetnaNova), accessible on the Web, ingests bodies of text which it either certifies as constituting a valid sequence of definitions and theorems, or rejects as defective.
The functionality of this proof verifier and the key issues for its effective use are illustrated, in particular by a case-study referring to bisimulations, and through excerpts from a large-scale script which leads from the built-in rudiments of set theory to the formal foundations of mathematical analysis. (The latter scenario, although incomplete as yet, already comprises over 1000 verified proofs, definitions, and ‘theories’.)
The paper also discusses enhancements to Referee which are in progress: a new inference mechanism, named proof-by-structure, whose addition should make proofs lighter and more readable; an interface to external provers; and an automatic proof optimizer (currently being tested), aimed at speeding up proof verification.
Research partially funded by INTAS project Algebraic and deduction methods in non-classical logic and their applications to Computer Science.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aiello, L., Weyhrauch, R.W.: Using meta-theoretic reasoning to do algebra. In: [2] pp. 1–13
Bibel, W., Kowalski, R. (eds.): Proceedings of the 5th conference on Automated Deduction. LNCS, vol. 87. Springer, Heidelberg (1980)
Bridges, D.S.: Foundations of Real and Abstract Analysis. Graduate Texts in Mathematics, vol. 174. Springer, Heidelberg (1997)
Cantone, D.: A fast saturation strategy for set-theoretic tableaux. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS (LNAI), vol. 1227, pp. 122–137. Springer, Heidelberg (1997)
Cantone, D., Zarba, C.G.: A new fast tableau-based decision procedure for an unquantified fragment of set theory. In: Caferra, R., Salzer, G. (eds.) Proc. of the International Workshop on First-Order Theorem Proving (FTP 1998). LNCS (LNAI), vol. 1761, pp. 126–136. Springer, Heidelberg (2000)
Cantone, D., Omodeo, E.G., Policriti, A.: The automation of syllogistic II. Optimization and complexity issues. J. Automated Reasoning 6(2), 173–187 (1990)
Cantone, D., Omodeo, E.G., Policriti, A.: Set Theory for Computing. From Decision Procedures to Declarative Programming with Sets. Monographs in Computer Science. Springer, New York (2001)
Cantone, D., Formisano, A., Omodeo, E.G., Schwartz, J.T.: Various commonly occurring decidable extensions of multi-level syllogistic. In: Ranise, S., Tinelli, C. (eds.) Pragmatics of Decision Procedures in Automated Reasoning 2003, PDPAR 2003 (CADE 19), Miami, USA (July 29, 2003)
Cantone, D., Omodeo, E.G., Schwartz, J.T., Ursino, P.: Notes from the logbook of a proof-checker’s project. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 182–207. Springer, Heidelberg (2004)
Dovier, A., Piazza, C., Policriti, A.: An Efficient Algorithm for Computing Bisimulation Equivalence. Theoretical Computer Science 311(1-3), 221–256 (2004)
Ferro, A., Omodeo, E.G., Schwartz, J.T.: Decision procedures for some fragments of set theory. In: [2] pp. 88–96
Ferro, A., Omodeo, E.G., Schwartz, J.T.: Decision procedures for elementary sublanguages of set theory I. Multi-level syllogistic and some extensions. Comm. Pure Applied Math. 33(5), 599–608 (1980)
Fitting, M.C.: First-Order Logic and Automated Theorem Proving. In: Graduate Texts in Computer Science, 2nd edn. Springer, Berlin (1996) (1st edn., 1990)
Gentilini, R., Piazza, C., Policriti, A.: From Bisimulation to Simulation. Coarsest Partition Problems. Journal of Automated Reasoning 31(1), 73–103 (2003)
Keller, J.-P., Paige, R.: Program derivation with verified transformations - A case study. Comm. Pure Appl. Math. 48(9-10), 1053–1113 (1995); Special issue in honor of Schwartz, J.T.
Lloyd, J.W.: Foundation of Logic Programming, 2nd edn. Springer, Heidelberg (1987)
McCune, W.W.: Otter 2.0 User Guide. Technical Report ANL-90/9, Argonne National Laboratory, Argonne, Illinois (1990)
Omodeo, E.G., Schwartz, J.T.: A ‘Theory’ mechanism for a proof-verifier based on first-order set theory. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 214–230. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Omodeo, E.G., Cantone, D., Policriti, A., Schwartz, J.T. (2006). A Computerized Referee. In: Stock, O., Schaerf, M. (eds) Reasoning, Action and Interaction in AI Theories and Systems. Lecture Notes in Computer Science(), vol 4155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11829263_7
Download citation
DOI: https://doi.org/10.1007/11829263_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37901-0
Online ISBN: 978-3-540-37902-7
eBook Packages: Computer ScienceComputer Science (R0)