Skip to main content

Communicating ASP and the Polynomial Hierarchy

  • Conference paper
  • 723 Accesses

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

Abstract

Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expressiveness of this framework crucially depends on the nature of the communication mechanism that is adopted. The communication mechanism we introduce in this paper allows us to focus on a sequence of programs, where each program in the sequence may successively eliminate some of the remaining models. The underlying intuition is that of leaders and followers: each agent’s decisions are limited by what its leaders have previously decided. We show that extending answer set programs in this way allows us to capture the entire polynomial hierarchy.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bauters, K., Janssen, J., Schockaert, S., Vermeir, D., De Cock, M.: Communicating answer set programs. In: Tech. Comm. of ICLP 2010, vol. 7, pp. 34–43 (2010)

    Google Scholar 

  2. Brain, M., De Vos, M.: Implementing OCLP as a front-end for answer set solvers: From theory to practice. In: Proc. of ASP 2005 (2003)

    Google Scholar 

  3. Brewka, G., Eiter, T.: Equilibria in heterogeneous nonmonotonic multi-context systems. In: Proc. of AAAI 2007, pp. 385–390 (2007)

    Google Scholar 

  4. Brewka, G., Roelofsen, F., Serafini, L.: Contextual default reasoning. In: Proc. of. IJCAI 2007, pp. 268–273 (2007)

    Google Scholar 

  5. Buccafurri, F., Caminiti, G., Laurendi, R.: A logic language with stable model semantics for social reasoning. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 718–723. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence 69, 165–204 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dao-Tran, M., Eiter, T., Fink, M., Krennwallner, T.: Modular nonmonotonic logic programming revisited. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 145–159. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. De Vos, M., Crick, T., Padget, J., Brain, M., Cliffe, O., Needham, J.: LAIMA: A multi-agent platform using ordered choice logic programming. In: Baldoni, M., Endriss, U., Zhang, S.-W., Torroni, P. (eds.) DALT 2005. LNCS (LNAI), vol. 3904, pp. 72–88. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Dell’Acqua, P., Sadri, F., Toni, F.: Communicating agents. In: Proc. of MASL 1999 (1999)

    Google Scholar 

  10. Eiter, T., Gottlob, G.: The complexity of logic-based abduction. Journal of the ACM 42, 3–42 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artifial Intelligence 172(12-13), 1495–1539 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In: Proc. of IJCAI 2005, pp. 90–96 (2005)

    Google Scholar 

  13. Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: dlvhex: A tool for semantic-web reasoning under the answer-set semantics. In: Proc. of ALPSWS 2006, pp. 33–39 (2006)

    Google Scholar 

  14. Gelder, A.V., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)

    MathSciNet  MATH  Google Scholar 

  15. Gelfond, M., Lifzchitz, V.: The stable model semantics for logic programming. In: Proc. of ICLP 1988, pp. 1081–1086 (1988)

    Google Scholar 

  16. Giunchiglia, F., Serafini, L.: Multilanguage hierarchical logics or: How we can do without modal logics. Artifial Intelligence 65(1), 29–70 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  17. Jeroslow, R.: The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming 32, 146–164 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  18. Luo, J., Shi, Z., Wang, M., Huang, H.: Multi-agent cooperation: A description logic view. In: Lukose, D., Shi, Z. (eds.) PRIMA 2005. LNCS, vol. 4078, pp. 365–379. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Papadimitriou, C.: Computational complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  20. Roelofsen, F., Serafini, L.: Minimal and absent information in contexts. In: Proc. of IJCAI 2005, pp. 558–563 (2005)

    Google Scholar 

  21. Van Nieuwenborgh, D., De Vos, M., Heymans, S., Hadavandi, E.: Hierarchical decision making in multi-agent systems using answer set programming. In: Inoue, K., Satoh, K., Toni, F. (eds.) CLIMA 2006. LNCS (LNAI), vol. 4371, pp. 20–40. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bauters, K., Schockaert, S., Vermeir, D., De Cock, M. (2011). Communicating ASP and the Polynomial Hierarchy. In: Delgrande, J.P., Faber, W. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2011. Lecture Notes in Computer Science(), vol 6645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20895-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20895-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20894-2

  • Online ISBN: 978-3-642-20895-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics