Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic for Programming Artificial Intelligence and Reasoning

LPAR 1994: Logic Programming and Automated Reasoning pp 174–188Cite as

Towards efficient calculi for resource-oriented deductive planning

  • Conference paper
  • First Online:

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

Abstract

An important advantage of deductive approaches for solving planning problems is the possibility to exploit powerful proof methods and techniques to reduce the search space developed in the field of automated deduction. The aim of this paper is to adapt such techniques to build efficient resource-oriented planning systems.

The author is supported by the Deutsche Forschungsgemeinschaft (DFG) within project KONNEKTIONSBEWEISER under grant no. Bi 228/6-2.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. L. Astrachan and M. E. Stickel. Caching and Lemmaizingin Model Elimination Theorem Provers. In Proceedings of the Conference on Automated Deduction, pages 224–238. Springer, 1992.

    Google Scholar 

  2. W. Bibel. A deductive solution for plan generation. New Generation Computing, 4:115–132, 1986.

    Google Scholar 

  3. W. Bibel. Automated Theorem Proving. Vieweg Verlag, Braunschweig, 1987.

    Google Scholar 

  4. W. Bibel. Deduction: Automated Logic. Academic Press, London, 1993.

    Google Scholar 

  5. R. N. Bol, K. R. Apt, and J. W. Klop. An analysis of loop checking mechanisms for logic programming. Theoretical Computer Science, 86:35–79, 1991.

    Google Scholar 

  6. S. Brüning. On Loop Detection in Connection Calculi. In Proceedings of the Kurt Gödel Colloquium, pages 144–151. Springer Verlag, 1993.

    Google Scholar 

  7. S. Brüning. Towards Efficient Calculi for Resource-Oriented Linear Deductive Planning. Technical report, FG Intellektik, FB Informatik, TH Darmstadt, 1993.

    Google Scholar 

  8. S. Brüning, G. Große, S. Hölldobler, J. Schneeberger, U. Sigmund, and M. Thielscher. Disjunction in plan generation by equational logic programming. In Beiträge zum 7. Workshop Planen und Konfigurieren, pages 18–26. Arbeitspapiere der GMD 723, January 1993.

    Google Scholar 

  9. R. Feldman and P. Morris. Admissible Criteria For Loop Control In Planning. In Proceedings of the Eigth National Conference on Artificial Intelligence, pages 151–157, 1990.

    Google Scholar 

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

    Google Scholar 

  11. B. Fronhöfer and R. Caferra. Memorization of literals: An enhancement of the connection method. Technical report, Institut für Informatik, TU München, 1988.

    Google Scholar 

  12. C. Green. Application of theorem proving to problem solving. In Proceedings of IJCAI 1969, pages 741–747, 1969.

    Google Scholar 

  13. G. Große, S. Hölldobler, and J. Schneeberger. On linear deductive planning. Technical Report AIDA-92-08, FG Intellektik, FB Informatik, TH Darmstadt, 1992.

    Google Scholar 

  14. Gerd Große, Steffen Hölldobler, Josef Schneeberger, Ute Sigmund, and Michael Thielscher. Equational Logic Programming, Actions, and Change. In Proc. Joint International Conference and Symposium on Logic Programming JICSLP'92, 1992.

    Google Scholar 

  15. S. Hölldobler and J. Schneeberger. A new deductive approach to planning. New Generation Computing, 8:225–244, 1990.

    Google Scholar 

  16. R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO — A High-Performance Theorem Prover for First-Order Logic. JAR, 8:183–212, 1992.

    Google Scholar 

  17. V. Lifschitz. On the semantics of STRIPS. In Proc. of the Workshop on Reasoning about Actions and Plans, pages 1–8, Los Altos, 1986. Morgan Kaufmann.

    Google Scholar 

  18. M. Masseron, C. Tollu, and J. Vauzielles. Generating plans in linear logic. In Foundations of Software Technology and Theoretical Computer Science, pages 63–75. Springer, LNCS 472, 1990.

    Google Scholar 

  19. S. Thiébaux and J. Hertzberg. A semi-reactive planner based on a possible models action formalization. In Artificial Intelligence Planning Systems: Proceedings of the First International Conference (AIPS92), San Mateo, CA, 1992. Morgan Kaufmann.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FG Intellektik, FB Informatik, Technische Hochschule Darmstadt, Alexanderstraße 10, D-64283, Darmstadt, Germany

    Stefan Brüning

Authors
  1. Stefan Brüning
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Pfenning

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brüning, S. (1994). Towards efficient calculi for resource-oriented deductive planning. In: Pfenning, F. (eds) Logic Programming and Automated Reasoning. LPAR 1994. Lecture Notes in Computer Science, vol 822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58216-9_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-58216-9_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58216-8

  • Online ISBN: 978-3-540-48573-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation