Abstract
We present a method for finding morphisms between formal theories, both within as well as across libraries based on different logical foundations. As they induce new theorems in the target theory for any of the source theory, theory morphisms are high-value elements of a modular formal library. Usually, theory morphisms are manually encoded, but this practice requires authors who are familiar with source and target theories at the same time, which limits the scalability of the manual approach.
To remedy this problem, we have developed a morphism finder algorithm that automates theory morphism discovery. In this paper we present an implementation in the MMT system and show specific use cases. We focus on an application of theory discovery, where a user can check whether a (part of a) formal theory already exists in some library, potentially avoiding duplication of work or suggesting an opportunity for refactoring.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Autexier, S., Müller, N.: Semantics-based change impact analysis for heterogeneous collections of documents. In: Gormish, M., Ingold, R. (eds.) Proceedings of the 10th ACM Symposium on Document Engineering, DocEng 2010, Manchester, United Kingdom, pp. 97–106. ACM (2010). https://doi.org/10.1145/1860559.1860580
Dehaye, P.-O., et al.: Interoperability in the OpenDreamKit project: the math-in-the-middle approach. In: Kohlhase, Michael, Johansson, Moa, Miller, Bruce, de de Moura, Leonardo, Tompa, Frank (eds.) CICM 2016. LNCS (LNAI), vol. 9791, pp. 117–131. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42547-4_9
Farmer, W., Guttman, J., Thayer, F.: IMPS: an interactive mathematical proof system. J. Autom. Reas. 11(2), 213–248 (1993)
Gauthier, T., Kaliszyk, C.: Matching concepts across HOL libraries. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 267–281. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08434-3_20
Graf, P. (ed.): Term Indexing. LNCS, vol. 1053. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-61040-5
Iancu, M., Jucovschi, C., Kohlhase, M., Wiesing, T.: System description: MathHub.info. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 431–434. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08434-3_33
Iancu, M.: Management of change in declarative languages. MA thesis. Jacobs University Bremen (2012)
Kaliszyk, C., Kohlhase, M., Müller, D., Rabe, F.: A standard for aligning mathematical concepts. In: Kohlhase, A., Kohlhase, M., Libbrecht, P., Miller, B., Tompa, F., Naummowicz, A., Neuper, W., Quaresma, P., Suda, M. (eds.) Work in Progress at CICM 2016, pp. 229–244. CEUR-WS.org (2016)
Kohlhase, M., Müller, D., Owre, S., Rabe, F.: Making PVS accessible to generic services by interpretation in a universal format. In: Ayala-Rincón, M., Muñoz, C.A. (eds.) ITP 2017. LNCS, vol. 10499, pp. 319–335. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66107-0_21
Kohlhase, M.: OMDoc An Open Markup Format for Mathematical Documents (Version 1.2). LNAI, vol. 4180. Springer, Heidelberg (2006). https://doi.org/10.1007/11826095
Müller, D., Rabe, F., Kohlhase, M.: Automatically Finding Theory Morphisms for Knowledge Management. http://kwarc.info/kohlhase/submit/viewfinder-report.pdf
Matroid – Wikipedia, The Free Encyclopedia. https://en.wikipedia.org/w/index.php?title=Matroid, Accessed 04 Apr 2018
Normann, I., Kohlhase, M.: Extended formula normalization for \(\varepsilon \)-retrieval and sharing of mathematical knowledge. In: Kauers, M., Kerber, M., Miner, R., Windsteiger, W. (eds.) Calculemus/MKM -2007. LNCS (LNAI), vol. 4573, pp. 356–370. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73086-6_28
Owre, S., Rushby, J.M., Shankar, N.: PVS: a prototype verification system. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 748–752. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55602-8_217
Paulson, L.C. (ed.): Isabelle: A Generic Theorem Prover. LNCS, vol. 828. Springer, Heidelberg (1994). https://doi.org/10.1007/BFb0030541
NASA PVS Library. http://shemesh.larc.nasa.gov/fm/ftp/larc/PVS-library/. Accessed 17 Dec 2014
Rabe, F., Kohlhase, M.: A scalable module system. Inf. Comput. 230(1), 1–54 (2013)
Rupprecht, M., Kohlhase, M., Müller, D.: A flexible, interactive theory-graph viewer. In: Kohlhase, A., Pollanen, M. (eds.) The 12th Workshop on Mathematical User Interfaces, MathUI 2017 (2017). http://kwarc.info/kohlhase/papers/mathui17-tgview.pdf
Acknowledgments
The authors gratefully acknowledge financial support from the OpenDreamKit Horizon 2020 European Research Infrastructures project (#676541) and the DFG-funded project OAF: An Open Archive for Formalizations (KO 2428/13-1).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Müller, D., Kohlhase, M., Rabe, F. (2018). Automatically Finding Theory Morphisms for Knowledge Management. In: Rabe, F., Farmer, W., Passmore, G., Youssef, A. (eds) Intelligent Computer Mathematics. CICM 2018. Lecture Notes in Computer Science(), vol 11006. Springer, Cham. https://doi.org/10.1007/978-3-319-96812-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-96812-4_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96811-7
Online ISBN: 978-3-319-96812-4
eBook Packages: Computer ScienceComputer Science (R0)