Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
A survey of the Theorema project
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Evidence algorithm and system for automated deduction: a retrospective view
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
In this paper we continue to develop the approach to automated search for theorem proofe started in Kyiv in 1960-1970s. This approatch presupposes the development of deductive techniques used for the processing of mathematical texts, written in a formal first-order language, close to the natural language used in mathematical papers. We construct two logical caJculi, gS and mS, satisfying the following requirements: the syntacticetl form of the initial problem should be preserved; the proof search should be goal-oriented; preliminary skolemization is not obligatory; equality handling should be sepeurated from the deduction process. The calculus gS is a machine-oriented sequent-type calculus with "large-block" inference rules for first-order classical logic. The calculus mS is a further development of the calculus gS, enriched with formal analogs of the natural proof sesurch techniques such as definition handling and application of auxiliary propositions. The results on soundness and completeness of gS and mS aie given.