Skip to main content

Extending Action Language \(\mathcal{C}+\) by Formalizing Composite Actions

  • Chapter
Correct Reasoning

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7265))

  • 1037 Accesses

Abstract

This paper extends action language \(\mathcal{C}+\) by introducing composite actions as sequential execution of primitive actions. Such extension leads to a more intuitive and flexible way to represent action domains, better exploit a general-purpose formalization, and improve the reasoning efficiency for large domains. The semantics of composite actions is defined by a translation to nonmonotonic causal theories. We implement the language by extending cplus2asp, which translates causal theories into answer set programming (ASP) and calls ASP solver.

Xiaoping Chen and Guoqiang Jin are supported by the National Hi-Tech Project of China under grant 2008AA01Z150 and the Natural Science Foundations of China under grant 60745002 and 61175057.

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. Fikes, R., Nilsson, N.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2(3-4), 189–208 (1971)

    Article  MATH  Google Scholar 

  2. Gelfond, M., Lifschitz, V.: Action languages. Electronic Transactions on Artificial Intelligence 3, 195–210 (1998)

    Google Scholar 

  3. Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artificial Intelligence 153(1-2), 49–104 (2004)

    Article  MathSciNet  MATH  Google Scholar 

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

  5. Levesque, H.J., Reiter, R., Lespérance, Y., Lin, F., Scherl, R.B.: Golog: A logic programming language for dynamic domains. J. Log. Program. 31(1-3), 59–83 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Son, T.C., Baral, C., McIlraith, S.A.: Planning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, p. 226. Springer, Heidelberg (2001)

    Google Scholar 

  7. Shanahan, M.: Event Calculus Planning Revisited. In: Steel, S. (ed.) ECP 1997. LNCS (LNAI), vol. 1348, pp. 390–402. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  8. Sacerdott, E.D.: Planning in a hierarchy of abstraction spaces. In: Proceedings of the 3rd International Joint Conference on Artificial Intelligence, IJCAI 1973 (1973)

    Google Scholar 

  9. Erol, K., Hendler, J.A., Nau, D.S.: Htn planning: Complexity and expressivity. In: AAAI, pp. 1123–1128 (1994)

    Google Scholar 

  10. Lifschitz, V., Ren, W.: A modular action description language. In: Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 853–859 (2006)

    Google Scholar 

  11. Gelfond, M., Inclezan, D.: Yet another modular action language. In: Proceedings of the Second International Workshop on Software Engineering for Answer Set Programming, pp. 64–78 (2009)

    Google Scholar 

  12. McCarthy, J.: Generality in Artificial Intelligence. Communications of the ACM 30(12), 1030–1035 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  13. ErdoÄŸan, S.T.: A Library of General-Purpose Action Descriptions. PhD thesis, University of Texas at Austin (2008)

    Google Scholar 

  14. Casolary, M., Lee, J.: Representing the language of the causal calculator in answer set programming. In: Technical Communications of the 27th International Conference on Logic Programming (ICLP 2011), pp. 51–61 (2011)

    Google Scholar 

  15. Inclezan, D., Gelfond, M.: Representing Biological Processes in Modular Action Language ALM. In: Proceedings of the 2011 AAAI Spring Symposium on Formalizing Commonsense, pp. 49–55. AAAI Press (2011)

    Google Scholar 

  16. Lin, F.: Embracing causality in specifying the indirect effects of actions. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 1985–1991 (1995)

    Google Scholar 

  17. Erdoğan, S.T., Lifschitz, V.: Actions as special cases. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 377–387 (2006)

    Google Scholar 

  18. Chen, X., Ji, J., Jiang, J., Jin, G., Wang, F., Xie, J.: Developing high-level cognitive functions for service robots. In: Proc. of 9th Int. Conf. on Autonomous Agents and Multi-agent Systems, AAMAS 2010 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chen, X., Jin, G., Yang, F. (2012). Extending Action Language \(\mathcal{C}+\) by Formalizing Composite Actions. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds) Correct Reasoning. Lecture Notes in Computer Science, vol 7265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30743-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30743-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30742-3

  • Online ISBN: 978-3-642-30743-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics