How to clear a block: Plan formation in situational logic

1. R. S. Boyer and J S. Moore, A Computational Logic, Academic Press, Orlando, Fla., 1979.

   Google Scholar 

2. V. J. Digricoli, Equality-based binary resolution, Journal of the ACM, Vol. 33, No. 2, April 1986, to appear.

   Google Scholar 

3. M. Fay, First-order unification in an equational theory, Proceedings of the Fourth Workshop on Automated Deduction, Austin, Texas, Feb. 1979, pp. 161–167.

   Google Scholar 

4. R. E. Fikes and N. J. Nilsson, STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence, Vol. 2, No. 3–4, Winter 1971, pp. 189–208.

   Article  Google Scholar 

5. C. C. Green, Application of theorem proving to problem solving, Proceedings of the International Joint Conference on Artificial Intelligence, Washington, D.C., May 7–9, 1969, pp. 219–239.

   Google Scholar 

6. J.-M. Hullot, Canonical forms and unification, Proceedings of the Fifth Conference on Automated Deduction, Les Arcs, France, July 8–11, 1980, pp. 318–334.

   Google Scholar 

7. R. Kowalski, Logic for Problem Solving, North-Holland, New York, N.Y., 1979.

   Google Scholar 

8. V. Lifschitz, Circumscription in the blocks world, Unpublished Report, Stanford University, Stanford, Calif., Dec. 1985.

   Google Scholar 

9. J. McCarthy, Situations, actions, and causal laws, Technical Report, Stanford University, Stanford, Calif., 1963. Reprinted in Semantic Information Processing, Marvin Minsky, editor, MIT Press, Cambridge, Mass., 1968, pp. 410–417.

   Google Scholar 

10. J. McCarthy and P. Hayes, Some philosophical problems from the standpoint of artificial intelligence, Machine Intelligence 4, B. Meltzer and D. Michie, editors, American Elsevier, New York, N. Y., 1969, pp. 463–502.

    Google Scholar 

11. Z. Manna and R. Waldinger, A deductive approach to program synthesis, ACM Transactions on Programming Languages and Systems, Vol. 2, No. 1, Jan. 1980, pp. 90–121.

    Article  Google Scholar 

12. Z. Manna and R. Waldinger, The origin of the binary-search paradigm, Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, Calif., Aug. 18–23, 1985, pp. 222–224.

    Google Scholar 

13. Z. Manna and R. Waldinger, The Logical Basis for Computer Programming, Vol. 1: Deductive Reasoning, Addison-Wesley, Reading, Mass., 1985.

    Google Scholar 

14. Z. Manna and R. Waldinger, Special relations in automated deduction, Journal of the ACM, Vol. 33, No. 1, Jan. 1986, pp. 1–60.

    Article  Google Scholar 

15. A. Martelli and G. Rossi, An algorithm for unification in equational theories, Proceedings of the Third Symposium on Logic Programming, Salt Lake City, Utah, Sept. 21–25, 1986 (to appear).

    Google Scholar 

16. J. B. Morris, E-resolution: Extension of resolution to include the equality relation, International Joint Conference on Artificial Intelligence, Washington, D.C., May 7–9, 1969, pp. 287–294.

    Google Scholar 

17. N. V. Murray, Completely nonclausal theorem proving, Artificial Intelligence, Vol. 18, No. 1, 1982, pp. 67–85.

    Article  Google Scholar 

18. G. Polya, How to Solve It, Doubleday and Company, Garden City, N.Y., 1957.

    Google Scholar 

19. E. D. Sacerdoti, A Structure for Plans and Behavior, Elsevier North-Holland, New York, N. Y., 1977.

    Google Scholar 

20. M. E. Stickel, Automated deduction by theory resolution, Journal of Automated Reasoning, Vol. 1, No. 4, 1985, pp. 333–355.

    Article  Google Scholar 

21. G. J. Sussman, A Computational Model of Skill Acquisition, Ph. D. Thesis, MIT, Cambridge, Mass., 1973.

    Google Scholar 

22. R. J. Waldinger and R. C. T. Lee, PROW: A step toward automatic program writing, Proceedings of the International Joint Conference on Artificial Intelligence, Washington, D. C., May 7–9, 1969, pp. 241–252.

    Google Scholar 

23. D. H. D. Warren, WARPLAN: A system for generating plans, Technical Report, University of Edinburgh, Edinburgh, Scotland, 1974.

    Google Scholar 

Download references