Skip to main content

Implementing Reversible Processes in Multi-agent Action Languages Using Answer Set Planning

  • Conference paper
  • 386 Accesses

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

Abstract

This paper presents an implementation of the action language \(\mathcal{L}^{mt}\) in answer set programming. The novelty of this language comes from the use of processes to execute delayed effects for actions. In addition, the ability to reverse, or cancel, the processes is available. A simple example is introduced to show when reversing actions are useable - even by other agents in the domain. These processes are the base foundation for future implementation of commitments in planning for multi-agent domains.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   72.00
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Potassco - the potsdam answer set solving collection, http://potassco.sourceforge.net/

  2. Baldoni, M., Baroglio, C., Chiarotto, A., Patti, V.: Programming Goal-Driven Web Sites Using an Agent Logic Language. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 60–75. Springer, Heidelberg (2001), http://www.springerlink.com/index/labcg2d7yjdcjrjc.pdf

    Chapter  Google Scholar 

  3. Baldoni, M., Giordano, L., Martelli, A., Patti, V.: Modeling Agents in a Logic Action Language. In: Proc. of Workshop on Practical Reasoning Agents, FAPR 2000 (2000)

    Google Scholar 

  4. Baldoni, M., Martelli, A., Patti, V., Giordano, L.: Programming Rational Agents in a Modal Action Logic. Annals of Mathematics and Artificial Intelligence 41(2-4), 207–257 (2004), http://www.springerlink.com/openurl.asp?id=doi:10.1023/B:AMAI.0000031196.24935.b5

    Article  MathSciNet  MATH  Google Scholar 

  5. Baral, C., Gelfond, G., Pontelli, E., Son, T.C.: Logic programming for finding models in the logics of knowledge and its applications: A case study. TPLP 10(4-6), 675–690 (2010)

    MathSciNet  MATH  Google Scholar 

  6. Baral, C., Gelfond, M., Provetti, A.: Representing actions: Laws, observations and hypotheses. J. Log. Program. 31(1-3), 201–243 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Baral, C., Son, T.C., Tuan, L.C.: A transition function based characterization of actions with delayed and continuous effects. In: Proceedings of the Eighth International Conference on Principles of Knowledge and Representation and Reasoning (KR 2000), pp. 291–302 (2002)

    Google Scholar 

  8. Bordini, R.H., Wooldridge, M., Hübner, J.F.: Programming Multi-Agent Systems in AgentSpeak using Jason (Wiley Series in Agent Technology). John Wiley & Sons (2007)

    Google Scholar 

  9. Brenner, M.: A Multiagent Planning Language. In: Proc. of ICAPS 2003 Workshop on PDDL (2003)

    Google Scholar 

  10. Brewka, G., Strass, H., Thielscher, M.: Declarative strategies for agents with incomplete knowledge. In: NMR 2012: 14th International Workshop on Non-Monotonic Reasoning (2012)

    Google Scholar 

  11. Casolary, M., Lee, J.: Representing the language of the causal calculator in answer set programming. In: Gallagher, J.P., Gelfond, M. (eds.) ICLP (Technical Communications). LIPIcs, vol. 11, pp. 51–61. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)

    Google Scholar 

  12. Dimopoulos, Y., Kakas, A.C., Michael, L.: Reasoning About Actions and Change in Answer Set Programming. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 61–73. Springer, Heidelberg (2003), http://dblp.uni-trier.de/db/conf/lpnmr/lpnmr2004.html#DimopoulosKM04

    Chapter  Google Scholar 

  13. Dovier, A., Formisano, A., Pontelli, E.: Planning with action languages: Perspectives using clp(fd) and asp. In: CILC 2006: Convegno Italiano di Logica Computazionale (2006)

    Google Scholar 

  14. Dovier, A., Formisano, A., Pontelli, E.: Perspectives on Logic-Based Approaches for Reasoning About Actions and Change. In: Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, pp. 259–279. Springer, Heidelberg (2011), http://dl.acm.org/citation.cfm?id=2001078.2001096

    Chapter  Google Scholar 

  15. Fox, M., Long, D.: PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. Journal of Artificial Intelligence Research 20, 61–124 (2003)

    MATH  Google Scholar 

  16. Gebser, M., Grote, T., Schaub, T.: Coala: A Compiler from Action Languages to ASP. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 360–364. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming, pp. 1070–1080. MIT Press (1988)

    Google Scholar 

  18. Gelfond, M., Lifschitz, V.: Action languages. Electronic Transactions on AI 3 (1998)

    Google Scholar 

  19. Giunchiglia, E., Lifschitz, V.: Action languages, temporal action logics and the situation calculus. In: Working Notes of the IJCAI 1999 Workshop on Nonmonotonic Reasoning, Action, and Change (1999), http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.25.2280&rep=rep1&type=pdf

  20. Kowalski, R., Sadri, F.: An Agent Language with Destructive Assignment and Model-Theoretic Semantics. In: Dix, J., Leite, J., Governatori, G., Jamroga, W. (eds.) CLIMA XI. LNCS, vol. 6245, pp. 200–218. Springer, Heidelberg (2010), http://dl.acm.org/citation.cfm?id=1893859.1893877

    Chapter  Google Scholar 

  21. Lifschitz, V.: Action languages, answer sets and planning. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 357–373. Springer (1999)

    Google Scholar 

  22. Lifschitz, V.: Answer set programming and plan generation. Artif. Intell. 138(1-2), 39–54 (2002), http://dx.doi.org/10.1016/S0004-37020200186-8

    Article  MathSciNet  MATH  Google Scholar 

  23. Rao, A.: Agentspeak(l): Bdi Agents Speak Out in a Logical Computable Language. In: Perram, J., Van de Velde, W. (eds.) MAAMAW 1996. LNCS, vol. 1038, pp. 42–55. Springer, Heidelberg (1996), http://dx.doi.org/10.1007/BFb0031845

    Chapter  Google Scholar 

  24. Sirbu, M.: Credits and debits on the internet. In: Huhns, M., Singh, M.P. (eds.) Readings in Agents, pp. 299–305. Morgan Kaufmann (1998)

    Google Scholar 

  25. Son, T.C., Pontelli, E., Nguyen, N.-H.: Planning for Multiagent Using ASP-Prolog. In: Dix, J., Fisher, M., Novák, P. (eds.) CLIMA X. LNCS, vol. 6214, pp. 1–21. Springer, Heidelberg (2010), http://dx.doi.org/10.1007/978-3-642-16867-3_1 , 10.1007, doi:10.1007/978-3-642-16867-3_1

    Chapter  Google Scholar 

  26. Son, T.C., Pontelli, E., Sakama, C.: Formalizing Commitments Using Action Languages. In: Sakama, C., Sardina, S., Vasconcelos, W., Winikoff, M. (eds.) DALT 2011. LNCS, vol. 7169, pp. 67–83. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  27. Subrahmanian, V.S., Zaniolo, C.: Relating stable models and ai planning domains. In: Proc. ICLP 1995, pp. 233–247. MIT Press (1995)

    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 paper

Cite this paper

Wright, B., Pontelli, E., Son, T.C. (2012). Implementing Reversible Processes in Multi-agent Action Languages Using Answer Set Planning. In: Fisher, M., van der Torre, L., Dastani, M., Governatori, G. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2012. Lecture Notes in Computer Science(), vol 7486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32897-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32897-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32896-1

  • Online ISBN: 978-3-642-32897-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics