Automatic Generation of Proof Search Strategies for Second-Order Logic
- 312 Downloads
P2 is introduced: an algorithm for the automatic generation of proof search strategies from sets of examples of proofs. The proof search strategies are generated as sets of assertions (called methods) about the use of inference rules found in the examples. Sets of methods are prioritized and they can be compiled into clauses of a logic program. Proofs obtained for difficult problems in classical second-order logic are used as evidence of the adequacy of the methodology.
KeywordsModal Logic Inference Rule Free Variable Automatic Generation Sequent Calculus
Unable to display preview. Download preview PDF.
- 1.Peter B. Andrews, Dale A. Miller, Eve L. Cohen, and Frank Pfenning, Automating higher-order logic, In Bledsoe and Loveland , pp. 169–192.Google Scholar
- 4.W.W. Bledsoe and D.W. Loveland (eds.), Automated theorem proving: After 25 years, American Mathematical Society, Providence-Rhode Island, 1984.Google Scholar
- 8.Stephen Cole Kleene, Permutability of inferences in Gentzen’s calculi LK and LJ, Memoirs of the AMS, vol. 10, American Mathematical Society, 1952.Google Scholar
- 9.Raul H.C. Lopes, Inducing search methods from proofs, Tech. report, School of Computer Studies, University of Leeds, 1997.Google Scholar
- 10.Raul Henriques Cardoso Lopes, Inductive generalization of proof search strategies from examples, Ph.D. thesis, University of Leeds, 1998.Google Scholar
- 14.N. Shankar, Proof search in the intuitionistic sequent calculus, In Stickel , LNAI, 449, pp. 522–536.Google Scholar
- 15.M.E. Stickel (ed.), Proceedings of the 10th International Conference on Automated Deduction, Springer-Verlag, 1990, LNAI, 449.Google Scholar
- 16.Mark Tarver, An algorithm for inducing tactics from sequentzen proofs, Workshop on practical applications of automated reasoning, 1995, AISB.Google Scholar