Skip to main content
SpringerLink
Log in

Formalizing Goal Serializability for Evaluation of Planning Features

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10021))

Included in the following conference series:

  • 605 Accesses

Abstract

Evaluation of the properties of various planning techniques such as completeness and termination plays an important role in choosing an appropriate planning technique for a particular planning problem. In this paper, we use the already existing formal specification of two well-known and classic state space planning techniques, forward state space planning and goal stack state space planning techniques, in Transaction Logic(\( \mathcal {TR} \)) to study their completeness. Our study shows that using \( \mathcal {TR} \), we can formally specify the serializability of planning problems and prove the completeness of \( \textit{STRIPS}\) planning problems for planning problems with serializable goals.

This work was supported, in part, by the NSF grant 0964196.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Due to its simple nature.

  2. 2.

    As it was originally proposed by [7] in \( \textit{STRIPS}\).

  3. 3.

    http://ewl.cewit.stonybrook.edu/planning/Goal-Serializability.pdf.

References

  1. Sacerdoti, E.D.: The nonlinear nature of plans. In: Proceedings of the 4th International Joint Conference on Artificial Intelligence, IJCAI 1975, vol. 1, pp. 206–214. Morgan Kaufmann Publishers Inc., San Francisco (1975)

    Google Scholar 

  2. Bibel, W.: A deductive solution for plan generation. In: Schmidt, J.W., Thanos, C. (eds.) Foundations of Knowledge Base Management. Topics in Information Systems, pp. 453–473. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  3. Kahramanoğulları, O.: On linear logic planning and concurrency. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 250–262. Springer, Heidelberg (2008). doi:10.1007/978-3-540-88282-4_24

    Chapter  Google Scholar 

  4. Cresswell, S., Smaill, A., Richardson, J.: Deductive synthesis of recursive plans in linear logic. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS (LNAI), vol. 1809, pp. 252–264. Springer, Heidelberg (2000). doi:10.1007/10720246_20

    Chapter  Google Scholar 

  5. Guglielmi, A.: Concurrency and plan generation in a logic programming language with a sequential operator. In: Hentenryck, P.V. (ed.) ICLP, pp. 240–254. MIT Press (1994)

    Google Scholar 

  6. Kahramanogullari, O.: Towards planning as concurrency. In: Hamza, M.H. (ed.) Artificial Intelligence and Applications, pp. 387–393. IASTED/ACTA Press (2005)

    Google Scholar 

  7. Fikes, R.E., Nilsson, N.J.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2, 189–208 (1971)

    Article  MATH  Google Scholar 

  8. Bonner, A., Kifer, M.: Transaction logic programming (or a logic of declarative and procedural knowledge). Technical report CSRI-323, University of Toronto, November 1995. http://www.cs.toronto.edu/~bonner/transaction-logic.html

  9. Bonner, A., Kifer, M.: A logic for programming database transactions. In: Chomicki, J., Saake, G. (eds.) Logics for Databases and Information Systems, pp. 117–166. Kluwer Academic Publishers, March 1998

    Google Scholar 

  10. Bonner, A.J., Kifer, M.: An overview of transaction logic. Theoret. Comput. Sci. 133(32), 205–265 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  11. Bonner, A., Kifer, M.: Transaction logic programming. In: International Conference on Logic Programming, Budapest, Hungary, pp. 257–282. MIT Press, June 1993

    Google Scholar 

  12. Basseda, R., Kifer, M., Bonner, A.J.: Planning with transaction logic. In: Kontchakov, R., Mugnier, M.-L. (eds.) RR 2014. LNCS, vol. 8741, pp. 29–44. Springer, Heidelberg (2014). doi:10.1007/978-3-319-11113-1_3

    Google Scholar 

  13. Basseda, R., Kifer, M.: Planning with regression analysis in transaction logic. In: Cate, B., Mileo, A. (eds.) RR 2015. LNCS, vol. 9209, pp. 45–60. Springer, Heidelberg (2015). doi:10.1007/978-3-319-22002-4_5

    Chapter  Google Scholar 

  14. Basseda, R., Kifer, M.: State space planning using transaction logic. In: Pontelli, E., Son, T.C. (eds.) PADL 2015. LNCS, vol. 9131, pp. 17–33. Springer, Heidelberg (2015). doi:10.1007/978-3-319-19686-2_2

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stony Brook University, Stony Brook, NY, 11794, USA

    Reza Basseda & Michael Kifer

Authors
  1. Reza Basseda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Kifer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Reza Basseda .

Editor information

Editors and Affiliations

  1. Open University of Cyprus, Nicosia, Cyprus

    Loizos Michael

  2. University of Cyprus, Nicosia, Cyprus

    Antonis Kakas

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Basseda, R., Kifer, M. (2016). Formalizing Goal Serializability for Evaluation of Planning Features. In: Michael, L., Kakas, A. (eds) Logics in Artificial Intelligence. JELIA 2016. Lecture Notes in Computer Science(), vol 10021. Springer, Cham. https://doi.org/10.1007/978-3-319-48758-8_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48758-8_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48757-1

  • Online ISBN: 978-3-319-48758-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation