Skip to main content
Springer Nature Link
Log in

The Design of the Seventh Answer Set Programming Competition

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 2017)

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

Abstract

Answer Set Programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning. Biennial competitions are organized in order to furnish challenging benchmark collections and assess the advancement of the state of the art in ASP solving. In this paper, we report about the design of the Seventh ASP Competition, which is jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the University of Potsdam (Germany), in affiliation with the 14th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR 2017). A novel feature of this competition edition is the re-introduction of a Model&Solve track, complementing the usual System track with problem domains where participants need to provide dedicated encodings and solving means.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    http://aspcomp2017.dibris.unige.it.

  2. 2.

    http://lpnmr2017.aalto.fi.

  3. 3.

    https://www.mat.unical.it/aspcomp2013/ASPStandardization/.

  4. 4.

    http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsplib.html.

References

  1. Alviano, M., Dodaro, C., Ricca, F.: JWASP: a new Java-based ASP solver. In: Bistarelli, S., Formisano, A., Maratea, M. (eds.) Proceedings of RCRA 2015, vol. 1451 of CEUR Workshop Proceedings, pp. 16–23. CEUR-WS.org (2015)

    Google Scholar 

  2. Alviano, M., Dodaro, C., Faber, W., Leone, N., Ricca, F.: WASP: a native ASP solver based on constraint learning. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol. 8148, pp. 54–66. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40564-8_6

    Chapter  Google Scholar 

  3. Alviano, M., Dodaro, C., Leone, N., Ricca, F.: Advances in WASP. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 40–54. Springer, Cham (2015). doi:10.1007/978-3-319-23264-5_5

    Chapter  Google Scholar 

  4. Alviano, M., Dodaro, C., Ricca, F.: A MaxSAT algorithm using cardinality constraints of bounded size. In: Yang, Q., Wooldridge, M. (eds.) Proceedings of IJCAI 2015, pp. 2677–2683. AAAI Press (2015)

    Google Scholar 

  5. Amendola, G., Dodaro, C., Faber, W., Leone, N., Ricca, F.: On the computation of paracoherent answer sets. In: Singh, S., Markovitch, S. (eds.) Proceedings of AAAI 2017, pp. 1034–1040. AAAI Press (2017)

    Google Scholar 

  6. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)

    MATH  Google Scholar 

  7. Balduccini, M., Magazzeni, D., Maratea, M.: PDDL+ planning via constraint answer set programming. In: Bogaerts, B., Harrison, A. (eds.) Proceedings of ASPOCP 2016, pp. 1–12 (2016)

    Google Scholar 

  8. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, New York (2003)

    Book  MATH  Google Scholar 

  9. Béatrix, C., Lefèvre, C., Garcia, L., Stéphan, I.: Justifications and blocking sets in a rule-based answer set computation. In: Carro, M., King, A. (eds.) Technical Communications of ICLP 2016, vol. 52 of OASIcs, pp. 6:1–6:15. Schloss Dagstuhl (2016)

    Google Scholar 

  10. Bogaerts, B., Janhunen, T., Tasharrofi, S.: Stable-unstable semantics: beyond NP with normal logic programs. Theory Pract. Logic Program. 16(5–6), 570–586 (2016)

    Article  MathSciNet  Google Scholar 

  11. Bomanson, J., Gebser, M., Janhunen, T.: Improving the normalization of weight rules in answer set programs. In: Fermé, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 166–180. Springer, Cham (2014). doi:10.1007/978-3-319-11558-0_12

    Google Scholar 

  12. Bomanson, J., Gebser, M., Janhunen, T.: Rewriting optimization statements in answer-set programs. In: Carro, M., King, A. (eds.) Technical Communications of ICLP 2016, vol. 52 of OASIcs, pp. 5:1–5:15. Schloss Dagstuhl (2016)

    Google Scholar 

  13. Bomanson, J., Gebser, M., Janhunen, T., Kaufmann, B., Schaub, T.: Answer set programming modulo acyclicity. Fundamenta Informaticae 147(1), 63–91 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  14. Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)

    Article  Google Scholar 

  15. Bruynooghe, M., Blockeel, H., Bogaerts, B., De Cat, B., De Pooter, S., Jansen, J., Labarre, A., Ramon, J., Denecker, M., Verwer, S.: Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3. Theory Pract. Logic Program. 15(6), 783–817 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  16. Calimeri, F., Fuscà, D., Perri, S., Zangari, J.: \(\cal{I}\)-dlv: the new intelligent grounder of dlv. In: Adorni, G., Cagnoni, S., Gori, M., Maratea, M. (eds.) AI*IA 2016. LNCS, vol. 10037, pp. 192–207. Springer, Cham (2016). doi:10.1007/978-3-319-49130-1_15

    Chapter  Google Scholar 

  17. Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the fifth answer set programming competition. Artif. Intell. 231, 151–181 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  18. Cussens, J.: Bayesian network learning with cutting planes. In: Cozman, F., Pfeffer, A. (eds.) Proceedings of UAI 2011, pp. 153–160. AUAI Press (2011)

    Google Scholar 

  19. Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: propositional case. Ann. Math. Artif. Intell. 15(3–4), 289–323 (1995)

    Article  MathSciNet  MATH  Google Scholar 

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

  21. Fages, F.: Consistency of Clark’s completion and the existence of stable models. J. Methods Logic Comput. Sci. 1, 51–60 (1994)

    Google Scholar 

  22. Gebser, M., Janhunen, T., Rintanen, J.: Answer set programming as SAT modulo acyclicity. In: Schaub, T., Friedrich, G., O’Sullivan, B. (eds.) Proceedings of ECAI 2014, pp. 351–356. IOS Press (2014)

    Google Scholar 

  23. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: Engineering an incremental ASP solver. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 190–205. Springer, Heidelberg (2008). doi:10.1007/978-3-540-89982-2_23

    Chapter  Google Scholar 

  24. Gebser, M., Kaminski, R., Kaufmann, B., Romero, J., Schaub, T.: Progress in clasp series 3. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 368–383. Springer, Cham (2015). doi:10.1007/978-3-319-23264-5_31

    Chapter  Google Scholar 

  25. Gebser, M., Kaminski, R., Schaub, T.: Grounding recursive aggregates: preliminary report. In: Denecker, M., Janhunen, T. (eds.) Proceedings of GTTV 2015 (2015)

    Google Scholar 

  26. Gebser, M., Maratea, M., Ricca, F.: The design of the sixth answer set programming competition. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 531–544. Springer, Cham (2015). doi:10.1007/978-3-319-23264-5_44

    Chapter  Google Scholar 

  27. Gelfond, M., Leone, N.: Logic programming and knowledge representation - the A-Prolog perspective. Artif. Intell. 138(1–2), 3–38 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  28. Guerinik, N., Caneghem, M.: Solving crew scheduling problems by constraint programming. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 481–498. Springer, Heidelberg (1995). doi:10.1007/3-540-60299-2_29

    Chapter  Google Scholar 

  29. Havur, G., Cabanillas, C., Mendling, J., Polleres, A.: Resource allocation with dependencies in business process management systems. In: La Rosa, M., Loos, P., Pastor, O. (eds.) BPM 2016. LNBIP, vol. 260, pp. 3–19. Springer, Cham (2016). doi:10.1007/978-3-319-45468-9_1

    Chapter  Google Scholar 

  30. Inoue, K., Sakama, C.: A fixpoint characterization of abductive logic programs. J. Logic Program. 27(2), 107–136 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  31. Janhunen, T., Gebser, M., Rintanen, J., Nyman, H., Pensar, J., Corander, J.: Learning discrete decomposable graphical models via constraint optimization. Stat. Comput. 27(1), 115–130 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  32. Janhunen, T., Niemelä, I.: Compact translations of non-disjunctive answer set programs to propositional clauses. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS (LNAI), vol. 6565, pp. 111–130. Springer, Heidelberg (2011). doi:10.1007/978-3-642-20832-4_8

    Chapter  Google Scholar 

  33. Koponen, L., Oikarinen, E., Janhunen, T., Säilä, L.: Optimizing phylogenetic supertrees using answer set programming. Theory Pract. Logic Program. 15(4–5), 604–619 (2015)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  35. Liu, G., Janhunen, T., Niemelä, I.: Answer set programming via mixed integer programming. In: Brewka, G., Eiter, T., McIlraith, S. (eds.) Proceedings of KR 2012, pp. 32–42. AAAI Press (2012)

    Google Scholar 

  36. Maratea, M., Pulina, L., Ricca, F.: A multi-engine approach to answer-set programming. Theory Pract. Logic Program. 14(6), 841–868 (2014)

    Article  MathSciNet  Google Scholar 

  37. Maratea, M., Pulina, L., Ricca, F.: Multi-level algorithm selection for ASP. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 439–445. Springer, Cham (2015). doi:10.1007/978-3-319-23264-5_36

    Chapter  Google Scholar 

  38. Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: Apt, K., Marek, V., Truszczyński, M., Warren, D. (eds.) The Logic Programming Paradigm - A 25-Year Perspective, pp. 375–398. Springer, Heidelberg (1999)

    Google Scholar 

  39. Marple, K., Gupta, G.: Dynamic consistency checking in goal-directed answer set programming. Theory Pract. Logic Program. 14(4–5), 415–427 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  40. Mellarkod, V., Gelfond, M., Zhang, Y.: Integrating answer set programming and constraint logic programming. Ann. Math. Artif. Intell. 53(1–4), 251–287 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

Download references

Author information

Authors and Affiliations

  1. Institute for Computer Science, University of Potsdam, Potsdam, Germany

    Martin Gebser

  2. DIBRIS, Università di Genova, Genoa, Italy

    Marco Maratea

  3. Dipartimento di Matematica e Informatica, Università della Calabria, Rende, Italy

    Francesco Ricca

Authors
  1. Martin Gebser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Maratea
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francesco Ricca
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Gebser .

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

Gebser, M., Maratea, M., Ricca, F. (2017). The Design of the Seventh Answer Set Programming Competition. 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_1

Download citation

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

  • 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