Skip to main content

Extending ConGolog to Allow Partial Ordering

  • Conference paper
Intelligent Agents VI. Agent Theories, Architectures, and Languages (ATAL 1999)

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

Included in the following conference series:

Abstract

In this paper we extend the high level execution language ConGolog (developed at the University of Toronto) by adding to it a new construct which we call the htn-construct. The new construct improves ConGolog by allowing easy specification of non-determinism when a partial ordering between a set of actions needs to be maintained. Furthermore, it allows temporal constraints to be specified easily. We present an implementation of the htn-construct in PROLOG which can be directly added to PROLOG implementations of ConGolog interpreters.

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

Access this chapter

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Erol, K., Hendler, J., Nau, D.: HTN-planning: Complexity and Expressivity. In: AAAI 1994, pp. 1123–1228 (1994)

    Google Scholar 

  2. Graham, J.R., Decker, K.S.: Towards a Distributed, Environment-Centered Agent Framework. In: Pre-Proceedings ATAL 1999, pp. 162–175 (1999)

    Google Scholar 

  3. De Giacomo, G., Lespérance, Y., Levesque, H.: Reasoning about concurrent execution, prioritized interrupts, and exogenous actions in the situation calculus. In: IJCAI 1997, pp. 1221–1226 (1997)

    Google Scholar 

  4. De Giacomo, G., Lespérance, Y., Levesque, H.: ConGolog, a concurrent programming language based on the situation calculus: the foundation. To appear in AIJ

    Google Scholar 

  5. De Giacomo, G., Lespërance, Y., Levesque, H.: ConGolog, a concurrent programming language based on the situation calculus: language and implementation. To appear in AIJ

    Google Scholar 

  6. Hindriks, K.V., de Boer, F.S., van der Hoek, W., Meyer, J.J.C.: Formal Semantics for an Abstract Agent Programming Language. In: Rao, A., Singh, M.P., Wooldridge, M.J. (eds.) ATAL 1997. LNCS (LNAI), vol. 1365, pp. 215–229. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Lespérance, Y., Tam, K., Jenkin, M.: Reactivity in a Logic-Based Robot Programming Framework. In: Pre-Proceedings ATAL 1999, pp. 32–46 (1999)

    Google Scholar 

  8. Levesque, H., Reiter, R., Lespérance, Y., Lin, F., Scherl, R.: GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming 31(1- 3), 59–84 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lakemeyer, G.: On Sensing and Off-line Interpreting in GOLOG. In: AAAI Fall Symposium, Cognitive Robotics, pp. 91–97 (1998)

    Google Scholar 

  10. McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 4, pp. 463–502. Edinburgh University Press, Edinburgh (1969)

    Google Scholar 

  11. Paolucci, M., Kalp, D., Pannu, A., Shehory, O., Sycara, K.: A Planning Component for RETSINA Agents. In: Pre-Proceedings ATAL 1999, pp. 235–250 (1999)

    Google Scholar 

  12. Rao, A.S.: AgentSpeak(L): BDI Agents Speak Out in a Logical Computable Language. In: van der Velde, W., Perram, J.W. (eds.) Agents Breaking Away, pp. 42–55 (1996)

    Google Scholar 

  13. Reiter, R.: The frame problem in the situation calculus:A simple solution (sometimes) and a completeness result for goal regression. In: Lifschitz, V. (ed.) Artificial Intelligence and Mathematical Theory of Computation, pp. 359–380. Academic Press, London (1991)

    Google Scholar 

  14. Sacerdoti, E.D.: Planning in a Hierarchy of Abstraction Spaces. Artificial Intelligence 5, 115–135 (1974)

    Article  MATH  Google Scholar 

  15. Shoham, Y.: Agent-oriented programming. Artificial Intelligence 60, 51–92 (1993)

    Article  MathSciNet  Google Scholar 

  16. Reiter, R.: Sequential, Temporal GOLOG. In: KR (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baral, C., Son, T.C. (2000). Extending ConGolog to Allow Partial Ordering. In: Jennings, N.R., Lespérance, Y. (eds) Intelligent Agents VI. Agent Theories, Architectures, and Languages. ATAL 1999. Lecture Notes in Computer Science(), vol 1757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719619_14

Download citation

  • DOI: https://doi.org/10.1007/10719619_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67200-5

  • Online ISBN: 978-3-540-46467-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics