Skip to main content
SpringerLink
Log in

On the combination of partial action descriptions

  • Scientific Track
  • Conference paper
  • First Online:
Advanced Topics in Artificial Intelligence (AI 1998)

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

Included in the following conference series:

  • 164 Accesses

Abstract

We investigate the problems of precondition interactions and effect cumulations, typically caused by the concurrent execution of actions. Our analysis leads to an integration of property oriented and resource oriented approaches to the representation of action and change. We formalize our ideas by introducing an extension A ORC of the Action Description Language A C [2]. In order to enable sound and complete automated inference, we give a corresponding encoding in terms of the Fluent calculus [10].

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Baral, M. Gelfond, and A. Provetti. Representing Actions: Laws, Observations and Hypotheses. Journal of Logic Programming, 31 (1–3): 201–243, May 1997.

    Article  MATH  MathSciNet  Google Scholar 

  2. Chitta Baral and Michael Gelfond. Representing Concurrent Actions in Extended Logic Programming. In R. Bajcsy, editor, Proceedings of IJCAI, pages 866–871, Chambéry, France, August 1993. Morgan Kaufmann.

    Google Scholar 

  3. W. Bibel. A Deductive Solution for Plan Generation. New Generation Computing, 4: 115–132, 1986.

    MATH  Google Scholar 

  4. S.-E. Bornscheuer and M. Thielscher Representing Concurrent Actions and Solving Conflicts. Journal of the IGPL, 4(3): 355–368, 1996. ISSN 0945-9103.

    MATH  MathSciNet  Google Scholar 

  5. S.-E. Bornscheuer and M. Thielscher. Explicit and Implicit Indeterminism: Reasoning About Uncertain and Contradictory Specifications of Dynamic Systems. Journal of Logic Programming, 31 (1–3): 119–155, May 1997.

    Article  MATH  MathSciNet  Google Scholar 

  6. K. L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293–322. Plenum, New York, NY, 1978.

    Google Scholar 

  7. V. Lifschitz (ed.) Special Issue: Reasoning about Action and Change. Journal of Logic Programming, 31 (1–3), May 1997.

    Google Scholar 

  8. J. Y. Girard: Linear Logic. Theoretical Computer Science, 50(1): 1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  9. E. Giunchiglia and V. Lifschitz. An Action Language based on Causal Explanation. In Working Papers of Common Sense ’98, pages 217–238, 1998. http://www.dcs.qmw.ac.uk/conferences/CS98.

    Google Scholar 

  10. S. Hölldobler and J. Schneeberger A New Deductive Approach to Planning. New Generation Computing, 8: 225–244, 1990.

    Article  MATH  Google Scholar 

  11. S. Hölldobler and M. Thielscher. Computing Change and Specificity with Equational Logic Programs. Annals of Mathematics and Artificial Intelligence, 14: 99–133, 1995.

    Article  MathSciNet  Google Scholar 

  12. J. Jaffar, J-L. Lassez, and M. J. Maher. A Theory of Complete Logic Programs with Equality. In Proceedings of FGCS pages 175–184. ICOT, 1984.

    Google Scholar 

  13. H. Lehmann. Actions, Conditions, and Resources. Diploma thesis, Wissensverarbeitung, Informatik, TU Dresden, Germany, January 1997. (In German).

    Google Scholar 

  14. R. Li and L. M. Pereira. Reasoning about Concurrent Actions and Observations. In Proceedings of APPIA-GULP-PRODE, pages 549–560. University of the Basque Country, 1996.

    Google Scholar 

  15. F. Lin and Y. Shoham. Concurrent Actions in the Situation Calculus. In Proceedings of AAAI National Conference on Artificial Intelligence, pages 590–595. MIT Press, 1992.

    Google Scholar 

  16. J. McCarthy and P. J. Hayes. Some philosophical problems from the standpoint of Artificial Intelligence. In B. Meltzer and D. Michie, editors, Machine Intelligence 4, pages 463–502. Edinburgh University Press, 1969.

    Google Scholar 

  17. R. Reiter. Proving Properties of States in the Situation Calculus. Artificial Intelligence, (64): 337–351, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  18. E. Sandewall. Features and Fluents. The Representation of Knowledge about Dynamical Systems. Oxford University Press, 1994.

    Google Scholar 

  19. J. C. Shepherdson. SLDNF-Resolution with Equality. JAR, 8:297–306, 1992.

    MATH  MathSciNet  Google Scholar 

  20. M. Thielscher. Representing Actions in Equational Logic Programming. In P. Van Hentenryck, editor, Proceedings of ICLP, pages 207–224. MIT Press, 1994.

    Google Scholar 

  21. M. Thielscher. On the Completeness of SLDENF-Resolution. Journal of Automated Reasoning, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dresden University of Technology, Dresden, Germany

    Sven-Erik Bornscheuer & Helko Lehmann

Authors
  1. Sven-Erik Bornscheuer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Helko Lehmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Grigoris Antoniou John Slaney

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bornscheuer, SE., Lehmann, H. (1998). On the combination of partial action descriptions. In: Antoniou, G., Slaney, J. (eds) Advanced Topics in Artificial Intelligence. AI 1998. Lecture Notes in Computer Science, vol 1502. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095044

Download citation

  • DOI: https://doi.org/10.1007/BFb0095044

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65138-3

  • Online ISBN: 978-3-540-49561-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation