Pdk: The System and Its Language

  • Marta Cialdea Mayer
  • Carla Limongelli
  • Andrea Orlandini
  • Valentina Poggioni
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3702)


This paper presents the planning system Pdk (Planning with Domain Knowledge), based on the translation of planning problems into Linear Time Logic theories, in such a way that finding solution plans is reduced to model search. The model search mechanism is based on temporal tableaux. The planning language accepted by the system allows one to specify extra problem dependent information, that can be of help both in reducing the search space and finding plans of better quality.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bacchus, F., Kabanza, F.: Using temporal logics to express search control knowledge for planning. Artificial Intelligence 116, 123–191 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Barringer, H., Fisher, M., Gabbay, D., Hunter, A.: Meta-reasoning in executable temporal logic. In: Proc. of KR 1991, pp. 40–49 (1991)Google Scholar
  3. 3.
    Cerrito, S., Mayer, M.C.: Using linear temporal logic to model and solve planning problems. In: Giunchiglia, F. (ed.) AIMSA 1998. LNCS, vol. 1480, pp. 141–152. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  4. 4.
    Mayer, M.C., Orlandini, A., Balestreri, G., Limongelli, C.: A planner fully based on linear time logic. In: Proc. of AIPS 2000, pp. 347–354 (2000)Google Scholar
  5. 5.
    Cimatti, A., Giunchiglia, E., Giunchiglia, F., Traverso, P.: Planning via model checking: a decision procedure for \(\cal AR\). In: Proc. ECP 1997, pp. 130–142 (1997)Google Scholar
  6. 6.
    Doherty, P., Kvarnström, J.: TALplanner: A temporal logic based planner. AI Magazine 22, 95–102 (2001)Google Scholar
  7. 7.
    Fisher, M., Owens, R.: An introduction to executable modal and temporal logics. In: Executable modal and temporal logics (Proc. of the IJCAI 1993 Workshop), pp. 1–20 (1995)Google Scholar
  8. 8.
    Fox, M., Long, D.: PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20, 61–124 (2003)zbMATHGoogle Scholar
  9. 9.
    Janssen, G.L.J.M.: Logics for Digital Circuit Verification. Theory, Algorithms and Applications. CIP-DATA Library Technische Universiteit Eindhoven (1999)Google Scholar
  10. 10.
    Koehler, J., Treinen, R.: Constraint deduction in an interval-based temporal logic. In: Executable Modal and Temporal Logics (Proc. of the IJCAI 1993 Workshop), pp. 103–117 (1995)Google Scholar
  11. 11.
    Reiter, R.: Knowledge in Action: logical foundations for describing and implementing dynamical systems. MIT Press, Cambridge (2001)Google Scholar
  12. 12.
    Stephan, B., Biundo, S.: Deduction based refinement planning. In: Proc. of AIPS 1996, pp. 213–220 (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Marta Cialdea Mayer
    • 1
  • Carla Limongelli
    • 1
  • Andrea Orlandini
    • 1
  • Valentina Poggioni
    • 1
  1. 1.Dipartimento di Informatica e AutomazioneUniversità di Roma Tre 

Personalised recommendations