Top

Published in:

2017 | OriginalPaper | Chapter

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

Author : Tran Cao Son

Published in: Logic Programming and Nonmonotonic Reasoning

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

previous chapter A Bird’s-Eye View of Forgetting in Answer-Set Programming

next chapter From Logic Programming and Non-monotonic Reasoning to Computational Argumentation and Beyond

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

The window is closed and unlocked.

The window is closed and locked.

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

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

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

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)

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

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 CrossRef

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)

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

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 CrossRef

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 CrossRef

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

10.

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

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)

12.

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

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)

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)

15.

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

16.

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

17.

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

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)

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)

20.

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

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 CrossRef

22.

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

23.

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

24.

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

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

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 CrossRef

27.

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

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 CrossRef

29.

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

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)

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)

32.

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

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)

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

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

36.

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

Title: Answer Set Programming and Its Applications in Planning and Multi-agent Systems
Author: Tran Cao Son
Publisher: Springer International Publishing
Book: Logic Programming and Nonmonotonic Reasoning
Print ISBN: 978-3-319-61659-9

Electronic ISBN: 978-3-319-61660-5

Copyright Year: 2017
DOI: https://doi.org/10.1007/978-3-319-61660-5_3

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner