Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 2017: Logic Programming and Nonmonotonic Reasoning pp 23–35Cite as

Answer Set Programming and Its Applications in Planning and Multi-agent Systems

  • Conference paper
  • First Online:

  • 828 Accesses

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

Abstract

The paper presents some applications in planning and multi-agent systems of answer set programming. It highlights the benefits of answer set programming based techniques in these applications. It also describes a class of multi-agent planning problems that is challenging to answer set programming.

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

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

Learn about institutional subscriptions

Notes

  1. 1.

    Rules with variables are viewed as a shorthand for the set of their ground instances.

  2. 2.

    The window is closed and unlocked.

  3. 3.

    The window is closed and locked.

  4. 4.

    In our view, static causal laws can be used to represent relationships between fluents and thus could be considered as axioms in PDDL.

  5. 5.

    A set of literals is interpreted as the conjunction of its members. \(\emptyset \) denotes true.

References

  1. Baral, C., Kreinovich, V., Trejo, R.: Computational complexity of planning and approximate planning in the presence of incompleteness. Artif. Intell. 122, 241–267 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baral, C., McIlraith, S., Son, T.C.: Formulating diagnostic problem solving using an action language with narratives and sensing. In: KR, pp. 311–322 (2000)

    Google Scholar 

  3. Dimopoulos, Y., Nebel, B., Koehler, J.: Encoding planning problems in non-monotonic logic programs. In: ECP, pp. 169–181 (1997)

    Google Scholar 

  4. Eiter, T., Ianni, G., Krennwallner, T.: Answer set programming: a primer. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web 2009. LNCS, vol. 5689, pp. 40–110. Springer, Heidelberg (2009). doi:10.1007/978-3-642-03754-2_2

    Chapter  Google Scholar 

  5. Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The KR system dlv: progress report, comparisons, and benchmarks. In: KR 1998, pp. 406–417 (1998)

    Google Scholar 

  6. Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53–68 (2016)

    Google Scholar 

  7. Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS, vol. 3229, pp. 200–212. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30227-8_19

    Chapter  Google Scholar 

  8. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: a conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 260–265. Springer, Heidelberg (2007). doi:10.1007/978-3-540-72200-7_23

    Chapter  Google Scholar 

  9. Geffner, H., Bonet, B.: A Concise Introduction to Models and Methods for Automated Planning. Morgan & Claypool Publishers (2013)

    Google Scholar 

  10. Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: ICLP, pp. 579–597 (1990)

    Google Scholar 

  11. Ghallab, M., Howe, A., Knoblock, C., McDermott, D., Ram, A., Veloso, M., Weld, D., Wilkins, D.: PDDL – the planning domain definition language, version 1.2. Technical report, CVC TR98003/DCS TR1165, Yale Center for Comp, Vis and Ctrl (1998)

    Google Scholar 

  12. Keren, S., Gal, A., Karpas, E.: Goal recognition design. In: ICAPS (2014)

    Google Scholar 

  13. Le, T., Fioretto, F., Yeoh, W., Son, T.C., Pontelli, E.: ER-DCOPs: a framework for distributed constraint optimization with uncertainty in constraint utilities. In: AAMAS, pp. 606–614. ACM (2016)

    Google Scholar 

  14. Le, T., Son, T.C., Pontelli, E., Yeoh, W.: Solving distributed constraint optimization problems using logic programming. In: AAAI, pp. 1174–1181. AAAI Press (2015)

    Google Scholar 

  15. Leone, N., Rosati, R., Scarcello, F.: Enhancing answer set planning. In: IJCA Workshop on Planning under Uncertainty and Incomplete Information (2001)

    Google Scholar 

  16. Lifschitz, V.: Answer set programming and plan generation. Artif. Intell. 138(1–2), 39–54 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ma, H., Koenig, S.: Optimal target assignment and path finding for teams of agents, pp. 1144–1152 (2016)

    Google Scholar 

  18. Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375–398 (1999)

    Google Scholar 

  19. Nguyen, V.D., Obermeier, P., Son, T.C., Schaub, T., Yeoh, W.: Generalized target assignment and path finding using answer set programming. Technical report, NMSU (2017)

    Google Scholar 

  20. Niemelä, I.: Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3,4), 241–273 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  21. Pelov, N., Denecker, M., Bruynooghe, M.: Partial stable models for logic programs with aggregates. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 207–219. Springer, Heidelberg (2003). doi:10.1007/978-3-540-24609-1_19

    Chapter  Google Scholar 

  22. Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: IJCAI, pp. 1413–1420 (2005)

    Google Scholar 

  23. Ramírez, M., Geffner, H.: Goal recognition over pomdps: inferring the intention of a POMDP agent. In: IJCAI, pp. 2009–2014 (2011)

    Google Scholar 

  24. Simons, P., Niemelä, N., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell. 138(1–2), 181–234 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  25. Son, T.C., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming. Theory Pract. Logic Program. 7(03), 355–375 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  26. Son, T.C., Pontelli, E., Sakama, C.: Logic programming for multiagent planning with negotiation. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 99–114. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02846-5_13

    Chapter  Google Scholar 

  27. Son, T.C., Pontelli, E., Nguyen, N., Sakama, C.: Formalizing negotiations using logic programming. ACM Trans. Comput. Log. 15(2), 12 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  28. Son, T.C., Pontelli, E., Nguyen, N.-H.: Planning for multiagent using ASP-prolog. In: Dix, J., Fisher, M., Novák, P. (eds.) CLIMA 2009. LNCS (LNAI), vol. 6214, pp. 1–21. Springer, Heidelberg (2010). doi:10.1007/978-3-642-16867-3_1

    Chapter  Google Scholar 

  29. Son, T.C., Sabuncu, O., Schulz-Hanke, C., Schaub, T., Yeoh, W.: Solving goal recognition design using ASP. In: AAAI (2016)

    Google Scholar 

  30. Son, T.C., Tu, P.H., Gelfond, M., Morales, R.: An approximation of action theories of \(\cal{AL}\) and its application to conformant planning. In: LPNMR, pp. 172–184 (2005)

    Google Scholar 

  31. Son, T.C., Tu, P.H., Gelfond, M., Morales, R.: Conformant planning for domains with constraints – a new approach. In: AAAI, pp. 1211–1216 (2005)

    Google Scholar 

  32. Subrahmanian, V., Zaniolo, C.: Relating stable models and AI planning domains. In: ICLP, pp. 233–247 (1995)

    Google Scholar 

  33. Thiebaux, S., Hoffmann, J., Nebel, B.: In defense of PDDL axioms. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003) (2003)

    Google Scholar 

  34. Tu, P., Son, T.C., Baral, C.: Reasoning and planning with sensing actions, incomplete information, and static causal laws using logic programming. Theory Pract. Logic Program. 7, 1–74 (2006)

    MATH  Google Scholar 

  35. Tu, P., Son, T.C., Gelfond, M., Morales, R.: Approximation of action theories and its application to conformant planning. Artif. Intell. J. 175(1), 79–119 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  36. Wurman, P., D’Andrea, R., Mountz, M.: Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Mag. 29(1), 9–20 (2008)

    Google Scholar 

Download references

Acknowledgement

The author wishes to thank his many collaborators and students for their contributions in the research reported in this paper. He would also like to acknowledge the partial support from various NSF grants.

Author information

Authors and Affiliations

  1. Department of Computer Science, New Mexico State University, Las Cruces, NM, 88003, USA

    Tran Cao Son

Authors
  1. Tran Cao Son
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tran Cao Son .

Editor information

Editors and Affiliations

  1. Drexel University, Philadelphia, Pennsylvania, USA

    Marcello Balduccini

  2. Aalto University, Espoo, Finland

    Tomi Janhunen

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Son, T.C. (2017). Answer Set Programming and Its Applications in Planning and Multi-agent Systems. In: Balduccini, M., Janhunen, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2017. Lecture Notes in Computer Science(), vol 10377. Springer, Cham. https://doi.org/10.1007/978-3-319-61660-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61660-5_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61659-9

  • Online ISBN: 978-3-319-61660-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation