Abstract
One of the main differences between pen-and-paper proofs and computer proofs is in the number of simple facts derived. In automated proof generation, the number of simple facts can be large. We are addressing this problem by preprocessing of the axiomatic system that should enable reduction in the number of simple and redundant facts to some extent. We implemented two types of preprocessing techniques, one concerning symmetric predicates, and another restricting introduction of witnesses during proof search. Both techniques were used within a coherent logic prover ArgoCLP. Evaluations performed on geometrical domain show that use of these techniques makes automated process more efficient and generated proofs often significantly shorter.
This work has been partly supported by the grant 174021 of the Ministry of Science of Serbia and by the SNF SCOPES grant IZ73Z0_127979/1.
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
Avigad, J., Dean, E., Mumma, J.: A formal system for Euclid’s Elements. The Review of Symbolic Logic (2009)
Arai, N.H., Masukawa, R.: How to Find Symmetries Hidden in Combinatorial Problems. In: Proceedings of the Eighth Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (2000)
Bezem, M., Coquand, T.: Automating coherent logic. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 246–260. Springer, Heidelberg (2005)
Cadoli, M., Mancini, T.: Using a Theorem Prover for Reasoning on Constraint Problems. In: Bandini, S., Manzoni, S. (eds.) AI*IA 2005. LNCS (LNAI), vol. 3673, pp. 38–49. Springer, Heidelberg (2005)
Caferra, R., Peltier, N., Puitg, F.: Emphasizing Human Techniques in Automated Geometry Theorem Proving A Practical Realization. In: Richter-Gebert, J., Wang, D. (eds.) ADG 2000. LNCS (LNAI), vol. 2061, pp. 268–305. Springer, Heidelberg (2001)
Chou, S.-C., Gao, X.-S., Zhang, J.-Z.: A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering. Journal of Automated Reasoning (2000)
Gelernter, H.: A Note on Syntatic Symmetry and the Manipulation of Formal Systems by Machine. Information and Control (1959)
Hilbert, D.: Grundlagen der Geometrie, Leipzig (1899)
Mancini, T., Cadoli, M.: Detecting and Breaking Symmetries by Reasoning on Problem Specifications. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, pp. 165–181. Springer, Heidelberg (2005)
Meikle, L., Fleuriot, J.: Automation for Geometry in Isabelle/HOL. In: Proceedings of PAAR, FLOC 2010 (2010)
Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
Stojanović, S., Pavlović, V., Janičić, P.: A Coherent Logic Based Geometry Theorem Prover Capable of Producing Formal and Readable Proofs. In: Schreck, P., Narboux, J., Richter-Gebert, J. (eds.) ADG 2010. LNCS (LNAI), vol. 6877, pp. 201–220. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stojanović, S. (2013). Preprocessing of the Axiomatic System for More Efficient Automated Proving and Shorter Proofs. In: Ida, T., Fleuriot, J. (eds) Automated Deduction in Geometry. ADG 2012. Lecture Notes in Computer Science(), vol 7993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40672-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-40672-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40671-3
Online ISBN: 978-3-642-40672-0
eBook Packages: Computer ScienceComputer Science (R0)