×

Presenting inequations in mathematical proofs. (English) Zbl 0933.68124

Summary: Logical systems, such as deductive planning approaches and formal methods in software verification, increasingly make use of machine generated proofs, and the size of these is growing continuously. Their presentation, however, is often inadequate in large portions, because the internal proof structures differ significantly from presentation styles adequate for humans. Addressing improvements in a specific and frequently occurring aspect of proof presentation, this paper describes an approach to building chains of inequations and presenting them in a compact notation format. The methods used comprise restructuring techniques, the omission of redundant information motivated by the addressee’s inferential capabilities, and the skillful use of a compact notation format. Our approach constitutes an important contribution to presenting mathematical proofs in a natural and human-oriented way.

MSC:

68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
03B35 Mechanization of proofs and logical operations
Full Text: DOI

References:

[1] Benzmüller, C.; Cheikhrouhou, L.; Fehrer, D.; Fiedler, A.; Huang, X.; Kerber, M.; Kohlhase, M.; Konrad, K.; Meier, A.; Melis, E.; Schaarschmidt, W.; Siekmann, J.; Sorge, V., ΩMEGA: Towards a Mathematical Assistant, (McCune, W., Automated Deduction — CADE-14, Proceedings of the 14th International Conference on Automated Deduction. Automated Deduction — CADE-14, Proceedings of the 14th International Conference on Automated Deduction, No. 1249 in Lecture Notes in Artificial Intelligence (July 1997), Springer), 252-255, Townsville, North Queensland, Australia · Zbl 1430.68393
[2] Denzinger, J.; Schulz, S., Analysis and representation of equational proofs generated by a distributed completion based proof system, (SEKI Report SR-94-05 (1994), Fachbereich Informatik, Universität Kaiserslautern: Fachbereich Informatik, Universität Kaiserslautern Berlin)
[3] Fehrer, D.; Horacek, H., Exploiting the addressee’s inferential capabilities in presenting mathematical proofs, (Pollack, M. E., IJCAI-97, Fifteenth International Joint Conference on Artificial Intelligence, Nagoya, Japan, vol. 2 (August 1997), Morgan Kaufmann), 959-964
[4] Gentzen, G., Untersuchungen über das logische Schlieβen I. Mathematische Zeitschrift, ((1935)), 39
[5] Horacek, H., A model for adapting explanations to the user’s likely inferences, User Modeling and User-Adapted Interaction, 7, 1-55 (1997)
[6] Horacek, H., Generating Inference-Rich Discourse Through Revisions of RST-Trees, (AAAI-98/IAAI-98 Fifteenth National Conference on Artificial Intelligence and Tenth Conference on Innovative Applications of Artificial Intelligence (July 1998), AAAI Press/MIT Press: AAAI Press/MIT Press Los Altos, CA), 814-820
[7] Huang, X., Proverb: A system explaining machine-found proofs, (Ram, A.; Eiselt, K., Proceedings of 16th Annual Conference of the Cognitive Science Society. Proceedings of 16th Annual Conference of the Cognitive Science Society, Atlanta, USA (1994), Lawrence Erlbaum), 427-432
[8] Huang, X., Reconstructing proofs at the assertion level, (Bundy, A., Automated Deduction — CADE-12, Proceedings of the 12th International Conference on Automated Deduction. Automated Deduction — CADE-12, Proceedings of the 12th International Conference on Automated Deduction, Nancy, France, Berlin. Automated Deduction — CADE-12, Proceedings of the 12th International Conference on Automated Deduction. Automated Deduction — CADE-12, Proceedings of the 12th International Conference on Automated Deduction, Nancy, France, Berlin, No. 814 in Lecture Notes in Artificial Intelligence (1994), Springer: Springer London), 788-792
[9] Huang, X., Human oriented proof presentation: a reconstructive approach, No. 112 in DISKI. Infix (1996)
[10] Huang, X., Translating machine-generated resolution proofs into ND-proofs at the assertion level, (Foo, N.; Goebel, R., Proceedings of PRICAI-96. Proceedings of PRICAI-96, LNAI, 1114 (1996), Springer: Springer Berlin), 399-410
[11] Huang, X.; Fiedler, A., Paraphrasing and aggregating argumentative texts using text structure, (Proceedings of the 8th International Natural Language Generation Workshop (1996))
[12] Huang, X.; Fiedler, A., Presenting machine-found proofs, (Proceedings of the 13th CADE (1996)) · Zbl 1412.68235
[13] Huang, X.; Kerber, M.; Kohlhase, M.; Melis, E.; Nesmith, D.; Richts, J.; Siekmann, J., Ω-MKRP, a proof development environment, (Bundy, A., Automated Deduction — CADE-12, Proceedings of the 12th International Conference on Automated Deduction. Automated Deduction — CADE-12, Proceedings of the 12th International Conference on Automated Deduction, Nancy, France, Berlin. Automated Deduction — CADE-12, Proceedings of the 12th International Conference on Automated Deduction. Automated Deduction — CADE-12, Proceedings of the 12th International Conference on Automated Deduction, Nancy, France, Berlin, No. 814 in Lecture Notes in Artificial Intelligence (1994), Springer: Springer Berlin), 788-792
[14] X. Huang, A. Meier, Natural deduction proofs can be as short as resolution proofs, SEKI report, to appear.; X. Huang, A. Meier, Natural deduction proofs can be as short as resolution proofs, SEKI report, to appear.
[15] Lingenfelder, C., Transformation and Structuring of Computer Generated proofs, (SEKI Report SR-90-26 (1990), Fachbereich Informatik, Universität Kaiserslautern: Fachbereich Informatik, Universität Kaiserslautern Berlin) · Zbl 0708.68069
[16] Lingenfelder, C.; Präcklein, A., Presentation of proofs in an equational calculus, (SEKI Report SR-90-15 (1990), Fachbereich Informatik, Universität Kaiserslautern)
[17] Lüneburg, H., Vorlesungen über Analysis (1981), BI Wissenschaftsverlag · Zbl 0482.26001
[18] McCune, W., (Otter 3.0 reference manual and guide, Tech. Rep. ANL-94/6 (1994), Argonne National Laboratory)
[19] Pierce, W., Toward mechanical methods for streamlining proofs, (Stickel, M. E., Proceedings of the 10th International Conference on Automated Deduction. Proceedings of the 10th International Conference on Automated Deduction, No. 449 in Lecture Notes in Artificial Intelligence (July 1990), Springer), 351-365 · Zbl 1509.68317
[20] Robinson, G.; Wos, L., Paramodulation and theorem proving in first order theories with equality, (Machine Intelligence, vol. 4 (1969), Elsevier: Elsevier Berlin), 135-150 · Zbl 0219.68047
[21] Robinson, J. A., Automated deduction with hyper-resolution, Int. J. of Comp. Math., 1, 227-234 (1965) · Zbl 0158.26003
[22] Shostak, R. E., Refutation graphs, Artificial Intelligence, 7, 51-64 (1976) · Zbl 0328.68080
[23] Thüring, M.; Wender, K., Über kausale Inferenzen beim Lesen, Sprache und Kognition, 2, 76-86 (1985)
[24] Zukerman, I.; McConachy, R., Generating concise discourse that adresses a user’s inferences, (Proceedings of IJCAI-93. Proceedings of IJCAI-93, Chambery, France (1993)), 1202-1207
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.