System description: Proof planning in higher-order logic with λClam

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

Volumn 1421, Issue , 1998, Pages 129-133

  Richardson, Julian ^a   Smaill, Alan ^a   Green, Ian ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; FORMAL LOGIC; THEOREM PROVING; VERIFICATION;

HIGHER ORDER LOGIC; HIGHER-ORDER; META-THEORY; PROOF-PLANNING; SYSTEM DESCRIPTION; VERIFICATION OF SOFTWARES;

COMPUTER CIRCUITS;

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

References (8)

1. P. Brisset and O. Ridoux. The architecture of an implementation of LambdaProlog: Prolog/Mali. In Proceedings of the Workshop on Implementation of Logic Programming, ILPS'94, Ithaca, NY. The MIT Press, November 1994.
2. A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62: 185-253, 1993. Also available from Edinburgh as DAI Research Paper No. 567.
3. A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The Oyster-Clam system. In M.E. Stickel, editor, 10th International Conference on Automated Deduction, pages 647-648. Springer-Verlag, 1990. Lecture Notes in Artificial Intelligence No. 449. Also available from Edinburgh as DAI Research Paper 507.
4. Alan Bundy. The use of explicit plans to guide inductive proofs. In R. Lusk and R. Overbeek, editors, 9th, Conference on Automated Deduction, pages 111-120. Springer-Verlag, 1988. Longer version available as DAI Research Paper No. 349.
5. A. Felty. A logic programming approach to implementing higher-order term rewriting. In L-H Eriksson et al., editors, Second International Workshop on Extensions to Logic Programming, volume 596 of Lecture Notes in Artificial Intelligence, pages 135-61. Springer-Verlag, 1992.
6. J.T. Hesketh. Using Middle-Out Reasoning to Guide Inductive Theorem Proving. PhD thesis, University of Edinburgh, 1991.
7. A. Ireland and A. Bundy. Productive use of failure in inductive proof. Journal of Automated Reasoning, 16(l-2): 79-lll, 1996. Also available as DAI Research Paper No 716, Dept, of Artificial Intelligence, Edinburgh.
8. A. Smaill and I. Green. Higher-order annotated terms for proof search. In J. von Wright, J. Grundy, and J Harrison, editors, Theorem Proving in Higher Order Logics, volume 1125 of Lecture Notes in Computer Science, pages 399-414. Springer, 1996. Also available as DAI Research Paper 799.