Skip to main content Accessibility help
×
Home

Expressiveness of communication in answer set programming

  • KIM BAUTERS (a1), STEVEN SCHOCKAERT (a1), JEROEN JANSSEN (a2), DIRK VERMEIR (a2) and MARTINE DE COCK (a3)...

Abstract

Answer set programming (ASP) is a form of declarative programming that allows to succinctly formulate and efficiently solve complex problems. An intuitive extension of this formalism is communicating ASP, in which multiple ASP programs collaborate to solve the problem at hand. However, the expressiveness of communicating ASP has not been thoroughly studied. In this paper, we present a systematic study of the additional expressiveness offered by allowing ASP programs to communicate. First, we consider a simple form of communication where programs are only allowed to ask questions to each other. For the most part, we deliberately consider only simple programs, i.e. programs for which computing the answer sets is in P. We find that the problem of deciding whether a literal is in some answer set of a communicating ASP program using simple communication is NP-hard. In other words, due to the ability of these simple ASP programs to communicate and collaborate, we move up a step in the polynomial hierarchy. Second, we modify the communication mechanism to also allow us to focus on a sequence of communicating programs, where each program in the sequence may successively remove some of the remaining models. This mimics a network of leaders, where the first leader has the first say and may remove models that he or she finds unsatisfactory. Using this particular communication mechanism allows us to capture the entire polynomial hierarchy. This means, in particular, that communicating ASP could be used to solve problems that are above the second level of polynomial hierarchy, such as some forms of abductive reasoning as well as PSPACE-complete problems such as STRIPS planning.

Copyright

References

Hide All
Baral, C. 2003. Knowledge, Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, UK.
Bauters, K. 2011. Modeling coalition formation using multi-focused answer sets. In Proceedings of ESSLLI'11 Student Session, Ljubljana, Slovenia, 31 July–11 August. Springer, New York, USA, 2533.
Bauters, K., Janssen, J., Schockaert, S., Vermeir, D. and DeCock, M. Cock, M. 2010. Communicating answer set programs. In Technical Communications of ICLP 2010. Vol. 7, 34–43. Springer-Verlag, New York, USA.
Bauters, K., Schockaert, S., Vermeir, D. and De Cock, M. In Proceedings of LPNMR'11, Vancouver, British Columbia, Canada. 6779.
Brain, M. and De Vos, M. 2003. Implementing OCLP as a front-end for answer set solvers: From theory to practice. In Proceedings of ASP'05, Bath, UK. Springer-Verlag New York, USA, 224238.
Brewka, G. and Eiter, T. 2007. Equilibria in heterogeneous nonmonotonic multi-context systems. In Proceedings of AAAI'07, Vancouver, British Columbia, Canada. AAAI Press, California, USA, 385390.
Brewka, G., Eiter, T., Fink, M. and Weinzierl, A. 2011. Managed multi-context systems. In Proceedings of IJCAI'11, Barcelona, Catalonia, Spain. AAAI Press, California, USA, 786791.
Brewka, G., Roelofsen, F. and Serafini, L. 2007. Contextual default reasoning. In Proceedings of IJCAI'07, Hyderabad, India. AAAI Press, California, USA, 268273.
Buccafurri, F., Caminiti, G. and Laurendi, R. 2008. A logic language with stable model semantics for social reasoning. In Proceedings of ICLP'08, Udine, Italy. Springer-Verlag, New York, USA, 718723.
Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69, 165204.
Dao-Tran, M., Eiter, T., Fink, M. and Krennwallner, T. 2009. Modular nonmonotonic logic programming revisited. In Proceedings of ICLP'09, Pasadena, California, USA. Springer-Verlag, New York, USA, 145159.
Dao-Tran, M., Eiter, T., Fink, M. and Krennwallner, T. 2010. Distributed nonmonotonic multi-context systems. In Proceedings of KR'10, Toronto, Canada. AAAI Press, California, USA, 6070.
Dell'Acqua, P., Sadri, F. and Toni, F. 1999. Communicating agents. In Proceedings of MAS'99, Las Cruces, NM, USA. Pergamon, Netherlands.
De Vos, M., Crick, T., Padget, J., Brain, M., Cliffe, O. and Needham, J. 2005. LAIMA: A multi-agent platform using ordered choice logic programming. In Proceedings of DALT'05. LNCS, vol. 3904. Springer-Verlag, New York, USA, 7288.
Drescher, C., Eiter, T., Fink, M., Krennwallner, T. and Walsh, T. 2011. Symmetry breaking for distributed multi-context systems. In Proceedings of ICLP'10. Lecture Notes in Computer Science, vol. 6645. Springer-Verlag, New York, USA, 2639.
Eiter, T., Faber, W., Leone, N. and Pfeifer, G. 1999. The diagnosis frontend of the dlv system. AI Communications 12, 99111.
Eiter, T. and Gottlob, G. 1995. The complexity of logic-based abduction. Journal of ACM 42, 342.
Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R. and Tompits, H. 2008. Combining answer set programming with description logics for the semantic web. Artificial Intelligence 172,12–13, 14951539.
Eiter, T., Ianni, G., Schindlauer, R. and Tompits, H. 2005. A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In Proceedings of IJCAI'05, Edinburgh, Scotland. Springer-Verlag, New York, USA, 9096.
Eiter, T., Ianni, G., Schindlauer, R. and Tompits, H. 2006. dlvhex: A tool for semantic-web reasoning under the answer-set semantics. In Proceedings of International Workshop of ALPSWS'06, Seattle, WA, USA. Springer, New York, USA, 3339.
Gebser, M., Guziolowski, C., Ivanchev, M., Schaub, T., Siegel, A., Thiele, S. and Veber, P. 2010. Repair and prediction (under inconsistency) in large biological networks with answer set programming. In Proceedings of KR'10, Toronto, Canada. AAAI Press, California, USA, 497507.
Gelder, A. V., Ross, K. A. and Schlipf, J. S. 1991. The well-founded semantics for general logic programs. Journal of the ACM 38, 3, 620650.
Gelfond, M. and Lifzchitz, V. 1988. The stable model semantics for logic programming. In Proceedings of ICLP'88, Seattle, Washington. Springer-Verlag, New York, USA, 10811086.
Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365385.
Giunchiglia, F. and Serafini, L. 1994. Multilanguage hierarchical logics or: How we can do without modal logics. Artifial Intelligence 65, 1, 2970.
Jeroslow, R. 1985. The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming 32, 146164.
Lifschitz, V. 2002. Answer set programming and plan generation. Artificial Intelligence 138, 3954.
Lifschitz, V., Tang, L. R. and Turner, H. 1999. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25, 3–4, 369389.
Luo, J., Shi, Z., Wang, M. and Huang, H. 2005. Multi-agent cooperation: A description logic view. In Proceedings of PRIMA'05, Kuala Lumpur, Malaysia. Springer-Verlag, Heidelberg, Germany, 365379.
Niemelä, I. and Simons, P. 2000. Extending the smodels system with cardinality and weight constraints. In Logic-Based Artificial Intelligence, Minker, J., ed. Kluwer Norwell, MA, USA, 491521.
Papadimitriou, C. 1994. Computational Complexity. Addison-Wesley, Boston, MA, USA.
Roelofsen, F. and Serafini, L. 2005. Minimal and absent information in contexts. In Proceedings of IJCAI'05, Edinburgh, Scotland. Springer-Verlag, New York, USA, 558563.
Tarski, A. 1955. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 2, 285309.
Van Nieuwenborgh, D., De Vos, M., Heymans, S. and Vermeir, D. 2007. Hierarchical decision making in multi-agent systems using answer set programming. In Proceedings of CLIMA'07, Helsinki, Finland.

Keywords

Related content

Powered by UNSILO

Expressiveness of communication in answer set programming

  • KIM BAUTERS (a1), STEVEN SCHOCKAERT (a1), JEROEN JANSSEN (a2), DIRK VERMEIR (a2) and MARTINE DE COCK (a3)...

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.