Skip to main content
SpringerLink
Log in

Declarative Formalization of Reasoning Strategies: A Case Study on Heuristic Nonlinear Planning

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We study the declarative formalization of reasoning strategies by presenting declarative formalizations of: (1) the SNLP algorithm for nonlinear planning, and (2) a particular algorithm for blocks world nonlinear planning proposed in this paper. The formal models of a heuristic forward chaining planner, which can take advantage of declarative formalizations of action selection strategies, and of a reasoning strategy based planner, which can use declarative formalizations of reasoning strategies, are proposed. The effectiveness of these systems is studied from formal and empirical points of view. Empirical results showing how the use of declarative formalizations of reasoning strategies can reduce the amount of search required for solving planning problems (with respect to state of the art planning systems) are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.H. Allen, J. Hendler and A. Tate (eds.), Readings in Planning (Morgan Kaufmann, San Mateo, CA, 1990).

    Google Scholar 

  2. F. Bacchus and F. Kabanza, Using temporal logic to control search in a forward chaining planner, in: New Directions in AI Planning, eds. M. Ghallab and A. Milani (IOS Press, 1996) pp. 141–153.

  3. F. Bacchus and F. Kabanza, Planning for temporally extended goals, in: Proceedings of AAAI-96 (1996) pp. 1215–1222.

  4. F. Bacchus and F. Kabanza, Using temporal logics to express search control knowledge for planning, Artificial Intelligence 116 (2000) 123–191.

    Google Scholar 

  5. A. Blum and M. Furst, Fast planning through planning graph analysis, Artificial Intelligence 90 (1997) 281–300.

    Google Scholar 

  6. K. Clark, Negation as failure, in: Logic and Data Bases, eds. H. Gallaire and J. Minker (Plenum, New York, 1978) pp. 293–322.

    Google Scholar 

  7. A. del Val and Y. Shoham, A unified view of belief revision and update, Journal of Logic and Computation, Special Issue on Actions and Processes 4(5) (1994) 797–810.

    Google Scholar 

  8. R. Fikes and N. Nilsson, STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence 2 (1971) 189–208.

    Google Scholar 

  9. M. Genesereth and J. Hsu, Partial programs, TR 89-20, Computer Science, Stanford University (1989).

  10. A. Gerevini and L. Schubert, Inferring state constraints for domain-independent planning, in: Proceedings of AAAI-98 (1998) pp. 905–912.

  11. Y. Huang, B.S. and H. Kautz, Control knowledge in planning: benefits and tradeoffs, in: Proceedings of AAAI-99 (1999) pp. 511–517.

  12. H. Kautz and B. Selman, Pushing the envelop: planning, propositional logic, and stochastic search, in: Proceedings of AAAI-96 (1996) pp. 1194–1201.

  13. H. Kautz and B. Selman, Blackbox: A new approach to the application of theorem proving to problem solving, Technical report (1998), available at http://www.research.att.com/kautz.

  14. D. Kliber and P. Morris, Don't be stupid, in: Proceedings of IJCAI-81 (1981) pp. 345–347.

  15. H. Levesque, R. Reiter, Y. Lesperance, F. Lin and R. Scherl, GOLOG: A logic programming language for dynamic domains, Journal of Logic Programming 31 (1997) 59–84.

    Google Scholar 

  16. V. Lifschitz, Computing circumscription, in: Proceedings of IJCAI-85 (1985) pp. 121–127.

  17. V. Lifschitz, Frames in the space of situations, Artificial Intelligence 46 (1990) 365–376.

    Google Scholar 

  18. V. Lifschitz, Circumscription, in: Non-Monotonic Reasoning and Uncertain Reasoning, eds. D.M. Gabbay, C.J. Hogger and J.A. Robinson, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3 (Oxford University Press, 1993) pp. 298–352.

  19. V. Lifschitz, Nested abnormality theories, Artificial Intelligence 74 (1995) 1262–1277.

    Google Scholar 

  20. F. Lin, Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator, in: Proceedings of IJCAI-97 (1997) pp. 1412–1418.

  21. F. Lin, An ordering on subgoals for planning, Annals of Mathematics and Artificial Intelligence 21 (1997) 321–342.

    Google Scholar 

  22. F. Lin, Search algorithms in the situation calculus, in: Logical Foundations of Cognitive Agents: Contributions in Honor of Ray Reiter (Springer, Berlin, 1999) pp. 213–233.

    Google Scholar 

  23. F. Lin and R. Reiter, State constraints revisited, Journal of Logic and Computation, Special Issue on Actions and Processes 4(5) (1994) 655–678.

    Google Scholar 

  24. D. McAllester and D. Rosenblitt, Systematic nonlinear planning, in: Proceedings of AAAI-91 (1991) pp. 534–539.

  25. J. McCarthy, Programs with common sense, in: Mechanization of Thought Processes, Proceedings of the Symposium of the National Physics Laboratory (1959) pp. 77–84. Reproduced in [30].

  26. J. McCarthy, First order theories of individual concepts and propositions, Machine Intelligence 9 (1979) 129–147. Reproduced in [30].

    Google Scholar 

  27. J. McCarthy, Circumscription – a form of non-monotonic reasoning, Artificial Intelligence 13 (1980) 27–39.

    Google Scholar 

  28. J. McCarthy, Formalization of STRIPS in situation calculus, Technical Report TR 85-9, Computer Science, Stanford University, Stanford, CA (1985).

    Google Scholar 

  29. J. McCarthy, Applications of circumscription to formalizing common sense knowledge, Artificial Intelligence 28 (1986) 89–116.

    Google Scholar 

  30. J. McCarthy, Formalizing Common Sense (Ablex Publishing Corporation, Norwood, NJ, 1990).

    Google Scholar 

  31. J. McCarthy, Making robots conscious of their mental states, in: Proceedings of the AAAI Spring Symposium on Representing Mental States and Mechanisms (1995) pp. 89–96.

  32. J. McCarthy and P. Hayes, Some philosophical problems from the standpoint of artificial intelligence, Machine Intelligence 4 (1969) 463–502.

    Google Scholar 

  33. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving (Addison-Wesley, Norwood, NJ, 1984).

    Google Scholar 

  34. R. Reiter, The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression, in: Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, ed. V. Lifschitz (Academic Press, New York, 1991) pp. 359–380.

    Google Scholar 

  35. R. Reiter, Sequential, temporal GOLOG, in: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, KR-98 (1998) pp. 547–556.

  36. R. Reiter, Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems (MIT Press, Cambridge, MA, 2001).

    Google Scholar 

  37. R. Scherl and H. Levesque, The frame problem and knowledge producing actions, in: Proceedings of AAAI-93 (1993) pp. 689–695.

  38. J. Shoenfield, Mathematical Logic (Addison-Wesley, Reading, MA, 1967).

    Google Scholar 

  39. J. Sierra, Declarative formalization of strategies for action selection, in: Proceedings of the Seventh International Workshop on Non-Monotonic Reasoning (1998) pp. 21–29.

  40. J. Sierra, A declarative formalization of STRIPS, in: Proceedings of the European Conference on Artificial Intelligence, ECAI-98 (1998) pp. 509–513.

  41. G. Sussman, The virtuous nature of bugs, in: First Conference of the Society for AI and the Simulation of Behavior, AISB-74 (1974) pp. 224–237. Reproduced in [1].

Download references

Author information

Authors and Affiliations

  1. Departamento de Lenguajes y Sistemas Informáticos, Universidad Politécnica de Cataluña, 08034, Barcelona, Spain

    Josefina Sierra-Santibáñez

Authors
  1. Josefina Sierra-Santibáñez
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sierra-Santibáñez, J. Declarative Formalization of Reasoning Strategies: A Case Study on Heuristic Nonlinear Planning. Annals of Mathematics and Artificial Intelligence 39, 61–100 (2003). https://doi.org/10.1023/A:1024464815668

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024464815668

Search

Navigation