Skip to main content
SpringerLink
Log in

Relating logic programming theories of actions and partial order planning

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

Abstract

In this paper we argue that logic programming theories of action allow us to identify subclasses for which the corresponding logic program has nice properties (such as acyclicity). As an example we extend the action description language \(\mathcal{A}\) to allow executability conditions and show its formalization in logic programming. We show the relationship between the execution of partial order planners and the SLDNF tree with respect to the corresponding logic programs. In the end we briefly discuss how this relationship helps us in extending partial order planners to extended languages by following the corresponding logic program.

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. K. Apt and M. Bezem, Acyclic programs, in: Logic Programming: Proc. of the Seventh Int. Conf., eds. D. Warren and P. Szeredi (1990) pp. 617–633.

  2. K. Apt and M. Bezem, Acyclic programs, New Generation Computing 9(3,4) (1991) 335–365.

    Article  MATH  Google Scholar 

  3. S. Abiteboul, R. Hall and V. Vianu, Foundations of Databases (Addison-Wesley, 1995).

  4. K. Apt and A. Pellegrini, On the occur-check free logic programs, ACM Transactions on Programming Languages and Systems 16(3) (1994) 687–726.

    Article  Google Scholar 

  5. C. Baral, Reasoning about actions: Non-deterministic effects, constraints and qualification, in: Proc. of IJCAI 95 (1995) pp. 2017–2023.

  6. A. Blum and M. Furst, Fast planning through planning graph analysis, in: Proc. of IJCAI 95 (1995) pp. 1636–1642.

  7. C. Baral and M. Gelfond, Representing concurrent actions in extended logic programming, in: Proc. of 13th International Joint Conference on Artificial Intelligence, Chambery, France (1993) pp. 866–871.

  8. C. Baral and M. Gelfond, Logic programming and knowledge representation, Journal of Logic Programming 19,20 (1994) 73–148.

    Article  MATH  MathSciNet  Google Scholar 

  9. C. Baral, M. Gelfond and A. Provetti, Representing actions: Laws, observations and hypothesis, Journal of Logic Programming 31(1–3) (1997) 201–243.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Barrett, K. Golden, J. Penberthy and D. Weld, UCPOP User's manual, version 2.0, Technical Report 93-09-06, Department of Computer Science and Engineering, University of Washington, 1993.

  11. F. Brown, ed., Proceedings of the 1987 Worskshop on The Frame Problem in AI (Morgan Kaufmann, 1987).

  12. D. Chapman, Planning for conjunctive goals, Artificial Intelligence (1987) 333–377.

  13. W. Chen, T. Swift and D. Warren, Efficient top-down computation of queries under the well-founded semantics, Journal of Logic Programming 24(3) (1995) 161–201.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. Denecker and D. De Schreye, Representing incomplete knowledge in abductive logic programming, in: Proc. of ILPS 93, Vancouver (1993) pp. 147–164.

  15. P. Dung, Representing actions in logic programming and its application in database updates, in: Proc. of ICLP-93, ed. D.S. Warren (1993) pp. 222–238.

  16. O. Etzioni, S. Hanks, D. Weld, d. Draper, N. Lesh and M. Williamson, An approach to planning with incomplete information, in: KR 92 (1992) pp. 115–125.

  17. K. Erol, D. Nau and V.S. Subrahmanian, On the complexity of domain-independent planning, in: AAAI 92 (1992) pp. 381–386.

  18. K. Erol, D. Nau and V.S. Subrahmanian, Complexity, decidability and undecidability results for domain-independent planning, AI Journal, to appear.

  19. K. Golden, O. Etzioni and D. Weld, Planning with execution and incomplete informations, Technical Report, Dept. of Computer Science, University of Washington, TR96-01-09, 1996.

  20. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Logic Programming: Proc. of the Fifth Int. Conf. and Symp., eds. R. Kowalski and K. Bowen (1988) pp. 1070–1080.

  21. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing (1991) 365–387.

  22. M. Gelfond and V. Lifschitz, Representing actions in extended logic programs, in: Joint International Conference and Symposium on Logic Programming (1992) pp. 559–573.

  23. M. Gelfond and V. Lifschitz, Representing actions and change by logic programs, Journal of Logic Programming 17(2–4) (1993) 301–323.

    Article  MATH  MathSciNet  Google Scholar 

  24. E. Giunchiglia and V. Lifschitz, Dependent fluents, in: Proc. of IJCAI 95 (1995) pp. 1964–1969.

  25. S. Holldobler and M. Thielscher, Actions and specificity, in: Proc. of ICLP-93, ed. D. Miller (1993) pp. 164–180.

  26. S. Kambhampati, C. Knoblock and Q. Yang, Planning as refinement search: a unified framework for evaluating design tradeoffs in partial order planning, AI Journal, also in ASU-CSE-TR 94 002, 1995.

  27. G. Kartha and V. Lifschitz, Actions with indirect effects: Preliminary report, in: KR 94 (1994) pp. 341–350.

  28. S. Kambhampati and D. Nau, On the nature of modal truth criteria in planning, in: Proc. of AAAI 94 (1994) pp. 1055–1060.

  29. H. Levesque, What is planning in the presence of sensing?, in: AAAI 96 (1996).

  30. F. Lin, An ordering on subgoals for planning, Annals of Math. and AI 21 (1997) this issue.

  31. F. Lin, Embracing causality in specifying the indirect effects of actions, in: Proc. of IJCAI 95 (1995) pp. 1985–1993.

  32. Y. Lesperance, H. Levesque, F. Lin, D. Marcu, R. Reiter and R. Scherl, A logical approach to high level robot programming — a progress report, in: Working Notes of the 1994 AAAI Fall Symposium on Control of the Physical World by Intelligent Systems, New Orleans, LA, November 1994.

  33. F. Lin and R. Reiter, State constraints revisited, Journal of Logic and Computation 4(5) (1994) 655–678.

    MATH  MathSciNet  Google Scholar 

  34. F. Lin and Y. Shoham, Concurrent actions in the situation calculus, in: Proc. of AAAI 92 (1992) pp. 590–595.

  35. R. Miller, Situation calculus specifications for event calculus logic programs, in: Proceedings of 3rd International Conference on Logic Programming and Non-monotonic Reasoning (1995).

  36. W. Marek and V.S. Subrahmanian, The relationship between logic program semantics and nonmonotonic reasoning, in: Proc. of the Sixth Int. Conf. on Logic Programming, eds. G. Levi and M. Martelli (1989) pp. 600–617.

  37. R. Miller and M. Shanahan, Narratives in the situation calculus, Journal of Logic and Computation 4(5) (1994) 513–530.

    MATH  MathSciNet  Google Scholar 

  38. N. McCain and M. Turner, A causal theory of ramifications and qualifications, in: Proc. of IJCAI 95 (1995) pp. 1978–1984.

  39. E. Pednault, ADL and the state-transition model of actions, Journal of Logic and Computation 4(5) (1994) 467–513.

    MATH  MathSciNet  Google Scholar 

  40. J. Pinto, Temporal reasoning in the situation calculus, PhD thesis, University of Toronto, Department of Computer Science, February 1994. KRR-TR-94-1.

  41. J. Pinto and R. Reiter, Temporal reasoning in logic programming: A case for the situation calculus, in: Proceedings of 10th International Conference in Logic Programming, Hungary (1993) pp. 203–221.

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

  43. H. Turner, Representing actions in default logic: A situation calculus approach, in: Proceedings of the Symposium in Honor of Michael Gelfond's 50th Birthday (1995) (also in Common Sense 96).

  44. D. Weld, An introduction to least commitment planning, AI Magazine 15(4) (1994) 27–61.

    Google Scholar 

Download references

Authors
  1. Chitta Baral
    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

Baral, C. Relating logic programming theories of actions and partial order planning. Annals of Mathematics and Artificial Intelligence 21, 131–151 (1997). https://doi.org/10.1023/A:1018961217989

Download citation

  • Issue Date:

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

Keywords

Search

Navigation