Simple and structural redundancy in non-deterministic computation

  • Patrick J. Hayes
Friday Afternoon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blikle, A, An algebraic approach to programs and their computations. Proc. 2nd MFCS Symposium (1973), Czechoslovak Academy of Sciences, pp17–26.Google Scholar
  2. 2.
    Bobrow, D.G. & Wegbreit, B, A model and stack implementation of multiple environments. Report 2334, Bolt Beranek & Newman, Inc., Cambridge, Mass. (1972).Google Scholar
  3. 3.
    Boyer, R. & Moore, J, Sharing structure in theorem-proving programs. Machine Intelligence 7, (1972) Edinburgh University Press, ppGoogle Scholar
  4. 4.
    Carlucci, A. & Montanari, Towards a formal definition of control in structured programs. Proc. 2nd MFCS Symposium (1973), Czechoslovak Academy of Sciences, pp169–174.Google Scholar
  5. 5.
    Hayes, P.J., Ph.D. Thesis (1973), Edinburgh University.Google Scholar
  6. 6.
    Hayes, P.J., Computation and Deduction. Proc. 2nd MFCS Symposium (1973) Czechoslovak Academy of Sciences, pp105–118.Google Scholar
  7. 7.
    Hayes, P.J., & Kowalski, R., Notes on automatic theorem-proving. Memo 40 (1971), Dept. of Computational Logic, Edinburgh University.Google Scholar
  8. 8.
    Hewitt, C., Ph.D. Thesis (1971), M.I.T.Google Scholar
  9. 9.
    Kowalski, R., Search strategies for theorem-proving. Machine Intelligence 5, (1969), Edinburgh University Press, pp181–202.Google Scholar
  10. 10.
    Kowalski, R., And-or graphs, theorem-proving graphs and bi-directional search. Machine Intelligence 7 (1972), Edinburgh University Press ppGoogle Scholar
  11. 11.
    Kowalski, R., Ph.D. Thesis (1971), Edinburgh University.Google Scholar
  12. 12.
    Landin, P.J., Mechanical Evaluation of Expressions. Comp. Journal 6 (1964), pp308–321.Google Scholar
  13. 13.
    Landin, P.J., A program-machine symmetric automata theory. Machine Intelligence 5 (1969), Edinburgh University Press, pp99–120.Google Scholar
  14. 14.
    Prawitz, D., Advances and Problems in mechanical proof procedures. Machine Intelligence 4 (1969), Edinburgh University Press, pp59–72.Google Scholar
  15. 15.
    Robinson, J.A., Computational Logic: The unification computation. Machine Intelligence 6, (1972), Edinburgh University Press, pp63–72.Google Scholar
  16. 16.
    Sandewall, E., Heuristic Search: Concepts and Methods. Artificial Intelligence and Heuristic Programming, (1971) American Elsevier, New York, pp81–100.Google Scholar
  17. 17.
    Slagle, J., An approach for finding C-linear complete inference systems. J.A.C.M. 19, 3.Google Scholar
  18. 18.
    Stansfield, J.L., Process 1: a generalisation of recursive programming languages. Research report 8 (1972), Bionics Laboratory, Edinburgh.Google Scholar
  19. 19.
    Wos, L., Robinson, G., & Carson, Efficiency and Completeness of the set-of-support strategy in theorem-proving. J.A.C.M. 12, (1965), pp536–541.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Patrick J. Hayes
    • 1
  1. 1.University of EssexUK

Personalised recommendations