LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Chrpa, Lukáš; Surynek, Pavel; Vyskočil, Jiří (2009)
Publisher: Springer
Languages: English
Types: Part of book or chapter of book
Subjects: QA75

Classified by OpenAIRE into

ACM Ref: ComputerApplications_COMPUTERSINOTHERSYSTEMS
Girard’s Linear Logic is a formalism which can be used to manage a lot of problems with consumable resources. Its expressiveness is quite good for an easily understandable encoding of many problems. We concentrated on expressing planning problems by linear logic in this paper. We observed a rich usage of a construct of consumable resources in planning problem formulations. This fact motivates us to provide a possible encoding of planning problems in linear logic. This paper shows how planning problems can be encoded in Linear Logic and how some optimizations of planning problems can be encoded. These optimizations can help planners to improve the efficiency of finding solutions (plans).
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 1. Bacchus F., Kabanza F.: Using temporal logics to express search control knowledge for planning. Arti¯cial Intelligence 22:5-27. 1998.
    • 2. Banbara M. Design and Implementation of Linear Logic Programming Languages. Ph.D. Dissertation, The Graduate School of Science and Technology, Kobe University. 2002.
    • 3. Bibel W., Cerro L. F., Fronhofer B., Herzig A. Plan Generation by Linear Proofs: On Semantics. In proceedings of GWAI. 49{62. 1989.
    • 4. Chrpa L. Linear Logic: Foundations, Applications and Implementations. In proceedings of workshop CICLOPS. 110-124. 2006.
    • 5. Chrpa L. Linear logic in planning. In proceedings of Doctoral Consorcium ICAPS. 26-29. 2006.
    • 6. Chrpa L., Bartak R. Towards getting domain knowledge: Plans analysis through investigation of actions dependencies In proceedings of FLAIRS. 531{536.
    • 7. Cresswell S., Smaill A., Richardson J. Deductive Synthesis of Recursive Plans in Linear Logic. In proceedings of ECP. 252{264. 1999.
    • 8. Doherty P., Kvanstrom J.: TALplanner: A temporal logic based planner. AI Magazine 22(3):95-102. 2001.
    • 9. Ghallab M, Nau D., Traverso P. Automated planning, theory and practice. Morgan Kaufmann Publishers 2004. 2004.
    • 10. Girard J.-Y. Linear logic. Theoretical computer science 50:1{102. 1987.
    • 11. Girard J.-Y. Linear Logic: Its Syntax and Semantics. Technical report, Cambridge University Press. 1995.
    • 12. Hodas J. Linear Logic in Computer Science. Cambridge University Press. 2004.
    • 13. Hickmott S., Rintanen J., Thiebaux S., White L. Planning via Petri Net Unfolding In proceedings of IJCAI. 1904-1911. 2007
    • 14. Hodas J. Logic Programming in Intuitionistic Linear Logic: Theory, Design, and Implementation. Ph.D. Dissertation, University of Pennsylvania, Department of Computer and Information Science. 1994.
    • 15. Jacopin E. Classical AI Planning as Theorem Proving: The Case of a Fragment of Linear Logic In proccedings of AAAI. 62{66. 1993.
    • 16. Kautz H. A., Selman B.: Planning as Satis¯ability. In proccedings of ECAI. 359- 363. 1992.
    • 17. Kautz H. A., Selman B., Ho®mann J.: SatPlan: Planning as Satis¯ability. In proccedings of 5th IPC. 2006.
    • 18. Korf, R. Macro-operators: A weak method for learning. Arti¯cial Intelligence 26(1):35{77. 1985.
    • 19. KuÄngas P. Analysing AI Planning Problems in Linear Logic - A Partial Deduction Approach. IN proceedings of SBIA. 52{61. 2004.
    • 20. KuÄngas P. Linear logic for domain-independent ai planning. Proceedings of Doctoral Consorcium ICAPS. 2003.
    • 21. Lincoln P. Linear logic. Proceedings of SIGACT. 1992.
    • 22. Masseron M. Tollu C., Vauzeilles J. Generating plans in linear logic i-ii. Theoretical Computer Science. vol. 113, 349-375. 1993.
    • 23. Oliet N. M., Meseguer, J. From petri nets to linear logic. Springer LNCS 389. 1989.
    • 24. Tamura N. User's guide of a linear logic theorem prover (llprover) Technical report, Kobe University, Japan. 1998.
    • 25. Tanabe M. Timed petri nets and temporal linear logic. In proceedings of Application and Theory of Petri Nets. 156-174. 1997
    • 26. Thielsher M.: FLUX: A logic programming method for reasoning agents. Theory and Practice of Logic Programming 5(4-5):533{565. 2005.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article