SAD as a mathematical assistant-how should we go from here to there?

Journal of Applied Logic

Volumn 4, Issue 4, 2006, Pages 560-591

  Lyaletski, Alexander ^a   Paskevich, Andrey ^a,b   Verchinine, Konstantin ^b  

^a TARAS SHEVCHENKO NATIONAL UNIVERSITY OF KYIV   (Ukraine)

^b UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

Automated reasoning; Formalizing mathematics; ForTheL; Proof assistant; SAD

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; FORMAL LOGIC; NATURAL LANGUAGE PROCESSING SYSTEMS; SET THEORY; THEOREM PROVING;

AUTOMATED REASONING; FORMALIZING MATHEMATICS; FORTHEL; PROOF ASSISTANT; SYSTEM FOR AUTOMATED DEDUCTION (SAD);

TEXT PROCESSING;

EID: 33750458639     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2005.10.009     Document Type: Article

References (40)

1. Glushkov V.M. Some problems of automata theory and artificial intelligence. Kibernetika 2 (1970) 3-13 (in Russian)
2. Glushkov V., Vershinin K., et al. On a formal language for description of mathematical texts. Avtomatizatsiya Poiska Dokazatel'stv Teorem v Matematike (1974), Institute of Cybernetics, Kiev 3-36 (in Russian)
3. Vershinin K. Using auxiliary statements in the process of proof search. Semiotika i Informatika 12 (1979) 12-21 (in Russian)
4. The Evidence Algorithm project. http://ea.unicyb.kiev.ua
5. Verchinine K., Degtyarev A., Lyaletski A., and Paskevich A. SAD, a System for Automated Deduction: A current state. In: Kamareddine F. (Ed). Proc. Workshop on 35 Years of Automath (2002), Heriot-Watt University, Edinburgh, Scotland
6. Lyaletski A., Paskevich A., and Verchinine K. Theorem proving and proof verification in the system SAD. In: Asperti A., Bancerek G., and Trybulec A. (Eds). Mathematical Knowledge Management: Third International Conference, MKM 2004. Lecture Notes in Computer Science vol. 3119 (2004), Springer-Verlag, Berlin 236-250
7. Letz R., and Stenz G. Model elimination and connection tableau procedures. In: Robinson A., and Voronkov A. (Eds). Handbook for Automated Reasoning, vol. II (2001), Elsevier Science, Amsterdam 2017-2116
8. Brand D. Proving theorems with the modification method. SIAM J. Comput. 4 (1975) 412-430
9. W. McCune, Otter 3.0 reference manual and guide, Tech. Report ANL-94/6, Argonne National Laboratory, Argonne, USA, 1994
10. Weidenbach C., Brahm U., Hillenbrand T., Keen E., Theobald C., and Topic D. SPASS version 2.0. In: Voronkov A. (Ed). Automated Deduction: 18th International Conference, CADE-18. Lecture Notes in Computer Science vol. 2392 (2002), Springer-Verlag, Berlin 275-279
11. Riazanov A., and Voronkov A. The design and implementation of VAMPIRE. AI Comm. 15 2-3 (2002) 91-110
12. Sutcliffe G., Suttner C.B., and Yemenis T. The TPTP problem library. In: Bundy A. (Ed). Automated Deduction: 12th International Conference, CADE-12. Lecture Notes in Computer Science vol. 814 (1994), Springer-Verlag, Berlin 252-266. http://tptp.org see also
13. Jones S.P. Haskell 98 Language and Libraries (2003), Cambridge University Press, Cambridge
14. Vershinin K., and Paskevich A. ForTheL-the language of formal theories. Internat. J. Inform. Theor. Appl. 7 3 (2000) 120-126
15. Verchinine K., and Paskevich A. ForTheL Reference Manual, unpublished draft. hosted at (2004). http://ea.unicyb.kiev.ua/download/forthel.ps.gz
16. The QED project. http://www.mcs.anl.gov/qed/
17. Fuchs N.E., Schwertel U., and Schwitter R. Attempto Controlled English-not just another logic specification language. In: Flener P. (Ed). Logic-Based Program Synthesis and Transformation: 8th International Workshop, LOPSTR'98. Lecture Notes in Computer Science vol. 1559 (1999), Springer-Verlag, Berlin 1-20
18. Sowa J.F. Common logic controlled English, unpublished draft. hosted at (2004). http://www.jfsowa.com/clce/specs.htm
19. A. Trybulec, H. Blair, Computer assisted reasoning with Mizar, in: Proc. 9th International Joint Conference on Artificial Intelligence, 1985, pp. 26-28
20. Wenzel M. Isar-a generic interpretative approach to readable formal proof documents. Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99. Lecture Notes in Computer Science vol. 1690 (1999), Springer-Verlag, Berlin 167-184
21. In: Nederpelt R.P., Geuvers J.H., and de Vrijer R.C. (Eds). Selected Papers on Automath (1994), North-Holland, Amsterdam
22. Kamareddine F., and Nederpelt R.P. A refinement of de Bruijn's formal language of mathematics. J. Logic Language Inform. 13 3 (2004) 287-340
23. Wiedijk F. The seventeen provers of the world, unpublished draft. hosted at (2004). http://www.cs.ru.nl/~freek/comparison/
24. Curry H., and Feys R. Combinatory Logic, vol. 1 (1958), North-Holland, Amsterdam
25. Rogers H. Theory of Recursive Functions and Effective Computability (1967), McGraw-Hill, New York
26. Lyaletski A., Verchinine K., Degtyarev A., and Paskevich A. System for Automated Deduction (SAD): Linguistic and deductive peculiarities. In: Klopotek M.A., Wierzchon S.T., and Michalewicz M. (Eds). Intelligent Information Systems: IIS'2002 Symposium, Advances in Soft Computing (2002), Physica-Verlag 413-422
27. Gentzen G. Untersuchungen uber das Logische Schliessen. Math. Zeit. 39 (1934) 176-210
28. Nipkow T., Paulson L.C., and Wenzel M. Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science vol. 2283 (2002), Springer-Verlag, Berlin
29. B. Barras, S. Boutin, C. Cornes, J. Courant, J. Filliatre, E. Giménez, H. Herbelin, G. Huet, C. Muñoz, C. Murthy, C. Parent, C. Paulin, A. Saïbi, B. Werner, The Coq proof assistant reference manual-version v6.1, Tech. Rep. 0203, INRIA, 1997
30. 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.H., and Sorge V. Ωmega: Towards a mathematical assistant. In: McCune W. (Ed). Automated Deduction: 14th International Conference, CADE-14. Lecture Notes in Computer Science vol. 1249 (1997), Springer-Verlag, Berlin 252-255
31. Owre S., Rushby J.M., and Shankar N. PVS: A prototype verification system. In: Kapur D. (Ed). Automated Deduction: 11th International Conference, CADE-11. Lecture Notes in Computer Science vol. 607 (1992), Springer-Verlag, Berlin 748-752
32. Gordon M.J.C., and Melham T.F. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic (1993), Cambridge University Press, Cambridge
33. In: Nederpelt R.P., Geuvers J.H., and de Vrijer R.C. (Eds). Selected Papers on Automath. Studies in Logic and the Foundations of Mathematics vol. 133 (1994), North-Holland, Amsterdam
34. Richardson J., Smaill A., and Green I. System description: Proof planning in higher-order logic with lambda-clam. Automated Deduction: 15th International Conference, CADE-15. Lecture Notes in Computer Science vol. 1421 (1998), Springer-Verlag, Berlin 129-133
35. L. Lamport, Types considered harmful, DEC SRC internal note, December 1992
36. Boyer R.S., and Moore J.S. A Computational Logic Handbook. second ed. (1998), Academic Press, New York
37. Kaufmann M., Manolios P., and Moore J.S. Computer-Aided Reasoning: An Approach (2000), Kluwer Academic Publishers, Dordrecht
38. Buchberger B., Jebelean T., Kriftner F., Marin M., Tomuta E., and Vasaru D. A survey of the Theorema project. In: Küchlin W. (Ed). ISSAC'97-Proc. International Symposium on Symbolic and Algebraic Computation, Maui, Hawaii, USA (1997), ACM Press, New York 384-391
39. Dixon L., and Fleuriot J.D. IsaPlanner: A prototype proof planner in Isabelle. In: Baader F. (Ed). Automated Deduction: 19th International Conference, CADE-19. Lecture Notes in Computer Science vol. 2741 (2003), Springer-Verlag, Berlin 279-283
40. Snyder W., and Lynch C. Goal directed strategies for paramodulation. Rewriting Techniques and Applications: 4th International Conference, RTA 1991. Lecture Notes in Computer Science vol. 448 (1991), Springer-Verlag, Berlin 150-161