Meta-level inference and program verification
In [Bundy and Sterling 81] we described how meta-level inference was useful for controlling search and deriving control information in the domain of algebra. Similar techniques are applicable to the verification of logic programs. A developing meta-language is described, and an explicit proof plan using this language is given. A program, IMPRESS, is outlined which executes this plan.
Keywordsmeta-level inference logic programming program verification
Unable to display preview. Download preview PDF.
- [Boyer & Moore 79]Boyer, R.S. and Moore, J.S. ACM monograph series.: A Computational Logic. Academic Press, 1979.Google Scholar
- [Bundy and Sterling 81]Bundy, A. and Sterling L. S. Meta-level Inference in Algebra. Research Paper 164, Dept. of Artificial Intelligence, Edinburgh, September, 1981. Presented at the workshop on logic programming for intelligent systems, Los Angeles, 1981.Google Scholar
- [Clark 79]Clark, K.L. Predicate Logic as a Computational Formalism. Report 79/59, Department of Computing, Imperial College, London, December, 1979.Google Scholar
- [Darlington 81]
- [Gordon et al 79]Gordon M.J., Milner A.J., and Wadsworth C.P. Lecture Notes in Computer Science. Volume 78: Edinburgh LCF — A mechanised logic of computation. Springer Verlag, 1979.Google Scholar
- [Kowalski 79]Robert Kowalski. Logic for Problem Solving. North Holland, 1979.Google Scholar
- [Pereira et al 79]Pereira, L.M., Pereira, F.C.N. and Warren, D.H.D. User's guide to DECsystem-10 PROLOG. Occasional Paper 15, Dept. of Artificial Intelligence, Edinburgh, 1979.Google Scholar