Instantiation of existentially quantified variables in inductive specification proofs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1476, Issue , 1998, Pages 247-258

  Pientka, Brigitte ^a   Kreitz, Christoph ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS;

AUTOMATIC APPROACHES; FIRST ORDER; INTEGER SQUARE ROOT; NON TERMINATIONS; PROOF SEARCH;

ARTIFICIAL INTELLIGENCE;

EID: 22444452933     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055917     Document Type: Conference Paper

References (17)

1. A. Armando, A. Smaill, and I. Green. Automatic synthesis of recursive programs: The proof-planning paradigm. In Proceedings of the 12th IEEE International Automated Software Engineering Conference, p 2-9. IEEE Computer Society, 1997.
2. D. Basin and T. Walsh. A calculus for and termination of rippling. Journal of Automated Reasoning, 16(2):147-180, 1996.
3. J. L. Bates and R. L. Constable. Proofs as programs. ACM Transactions on Programming Languages and Systems, 7(1):113-136, January 1985.
4. W. Bibel, D. Korn, C. Kreitz, F. Kurucz et al.. A multi-level approach to program synthesis. In Logic Program Synthesis and Transformation, Springer, 1998.
5. S. Biundo. Automated synthesis of recursive algorithms as a theorem proving tool. In Proceedings of the 8th ECAI, 1988.
6. A. Bundy, A. Stevens, F. van Harmelen et al.. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62(2):185-253, August 1993.
7. A. Bundy, F. van Harmelen, A. Smaill et al.. Extensions to the rippling-out tactic for guiding inductive proofs. In Proceedings of the 10th International CADE, p 132-146. LNAI, 1990.
8. R. L. Constable, S. F. Allen, H. M. Bromley, and et al. Implementing Meta-Mathematics with the NuPRLProof Development System. Prentice-Hall, 1086.
9. Jane T. Hesketh. Using Middle-Out Reasoning to Guide Inductive Theorem Proving. PhD thesis, Dept. of Artificial Intelligence, University of Edinburgh, 1991.
10. I. Kraan, D. Basin, and A. Bundy. Logic program synthesis via proof planning. In Logic Program Synthesis and Transformation, p 1-14. Springer, 1993.
11. Ferenc Kurucz. Realisierung verschiedender Induktionsstrategien basierend auf dem Rippling-Kalkiil. Master's thesis, Technical University Darmstadt, 1997.
12. Per Martin-Lof. Constructive mathematics and computer programming. In 6-th International Congress for Logic, Methodology and Philosophy of Science, 1979, p 153-175. North-Holland, 1982.
13. B. Nordstrom, K. Petersson, and J. M. Smith. Programming in Martin-Lofs Type Theory. An introduction. Clarendon Press, Oxford, 1990.
14. J. Otten and C. Kreitz. A Uniform Proof Procedure for Classical and Non-classical Logics. KI-96: Advances in Artificial Intelligence, LNAI1137, p 307-319. Springer.
15. B. Pientka. Automating the instantiation of existentially quantified variables. technical report, Dept. of Computer Science, Cornell University,1998.
16. A. Smaill and I.Green. Automating the synthesis of functional programs. Research paper 777, Dept. of Artificial Intelligence, University of Edinburgh, 1995.
17. T. Tammet. A resolution theorem prover for intuitionistic logic. In Proceedings of the 13th International CADE, LNAI 1104, p 2-16, 1996.