[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

The Design of the Sixth Answer Set Programming Competition

– Report –

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

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

Abstract

Answer Set Programming (ASP) is a well-known paradigm of declarative programming with roots in logic programming and non-monotonic reasoning. Similar to other closely-related problem-solving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advances in ASP solving are assessed in competition events. In this paper, we report about the design of the Sixth ASP Competition, which is jointly organized by the University of Calabria (Italy), Aalto University (Finland), and the University of Genova (Italy), in affiliation with the 13th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR 2015). This edition maintains some of the design decisions introduced in the last event, e.g., the design of tracks, the scoring scheme, and the adherence to a fixed modeling language in order to push the adoption of the standard. On the other hand, it features also some novelties, like a benchmarks selection stage to classify instances according to their expected hardness, and a “marathon” track where the best performing systems are given more time for solving hard benchmarks.

M. Gebser—Affiliated with the University of Potsdam, Germany.

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
£29.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
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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.

    https://www.mat.unical.it/aspcomp2014/.

  2. 2.

    http://vsl2014.at/.

  3. 3.

    https://aspcomp2015.dibris.unige.it/.

  4. 4.

    http://lpnmr2015.mat.unical.it/.

  5. 5.

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

  6. 6.

    http://www.mancoosi.org/misc/.

  7. 7.

    https://github.com/alviano/python/.

  8. 8.

    http://www.maxsat.udl.cat/14/index.html.

  9. 9.

    http://www.satcompetition.org/2014/index.shtml.

References

  1. 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, vol. 8148, pp. 54–66. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  2. Alviano, M., Dodaro, C., Leone, N., Ricca, F.: Advances in Wasp. In: Proceedings of LPNMR 2015. Springer (2015)

    Google Scholar 

  3. Alviano, M., Dodaro, C., Ricca, F.: Anytime computation of cautious consequences in answer set programming. Theory Pract. Logic Program. 14(4–5), 755–770 (2014)

    Article  MATH  Google Scholar 

  4. Alviano, M., Dodaro, C., Ricca, F.: Preliminary report on Wasp 2.0. In: Proceedings of NMR 2014, pp. 68–72. Vienna University of Technology (2014)

    Google Scholar 

  5. Aschinger, M., Drescher, C., Friedrich, G., Gottlob, G., Jeavons, P., Ryabokon, A., Thorstensen, E.: Optimization methods for the partner units problem. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 4–19. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Balduccini, M.: Industrial-size scheduling with ASP+CP. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 284–296. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

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

    Book  MATH  Google Scholar 

  8. Berre, D., Parrain, A.: The Sat4j library, release 2.2. J. Satisfiability Boolean Model. Comput. 7, 59–64 (2010)

    Google Scholar 

  9. Biewer, A., Andres, B., Gladigau, J., Schaub, T., Haubelt, C.: A symbolic system synthesis approach for hard real-time systems based on coordinated SMT-solving. In: Proceedings of DATE 2015, pp. 357–362. ACM (2015)

    Google Scholar 

  10. 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, vol. 8761, pp. 166–180. Springer, Heidelberg (2014)

    Google Scholar 

  11. Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: The design of the fifth answer set programming competition. In: Technical Communications of ICLP 2014, http://arxiv.org/abs/1405.3710v4. CoRR (2014)

  12. Palù, D., Dovier, A., Pontelli, E., Rossi, G.: GASP: Answer set programming with lazy grounding. Fundamenta Informaticae 96(3), 297–322 (2009)

    MATH  MathSciNet  Google Scholar 

  13. Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative problem-solving using the DLV system. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 79–103. Kluwer Academic Publishers, Norwell (2000)

    Chapter  Google Scholar 

  14. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Trans. Database Syst. 22(3), 364–418 (1997)

    Article  Google Scholar 

  15. 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. LNCS, vol. 5689, pp. 40–110. Springer, Heidelberg (2009)

    Google Scholar 

  16. Erdem, E., Wong, M.D.F.: Rectilinear steiner tree construction using answer set programming. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 386–399. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Fulek, R., Pach, J.: A computational approach to conway’s thrackle conjecture. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 226–237. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. Gavanelli, M., Nonato, M., Peano, A., Alvisi, S., Franchini, M.: An ASP approach for the valves positioning optimization in a water distribution system. In: Proceedings of CILC 2012, pp. 134–148 (2012). http://www.CEUR-WS.org

  19. Gebser, M., Guziolowski, C., Ivanchev, M., Schaub, T., Siegel, A., Thiele, S., Veber, P.: Repair and prediction (under inconsistency) in large biological networks with answer set programming. In: Proceedings of KR 2010, pp. 497–507. AAAI (2010)

    Google Scholar 

  20. Gebser, M., Janhunen, T., Rintanen, J.: Answer set programming as SAT modulo acyclicity. In: Proceedings of ECAI 2014, pp. 351–356. IOS (2014)

    Google Scholar 

  21. Gebser, M., Janhunen, T., Rintanen, J.: SAT modulo graphs: acyclicity. In: Fermé, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 137–151. Springer, Heidelberg (2014)

    Google Scholar 

  22. Gebser, M., Kaminski, R., Schaub, T.: Complex optimization in answer set programming. Theory Pract. Logic Program. 11(4–5), 821–839 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  23. Gebser, M., Kaufmann, B., Schaub, T.: Advanced conflict-driven disjunctive answer set solving. In: Proceedings of IJCAI 2013, pp. 912–918. IJCAI/AAAI (2013)

    Google Scholar 

  24. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M.T., Ziller, S.: A portfolio solver for answer set programming: preliminary report. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 352–357. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  25. Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187–188, 52–89 (2012)

    Article  MathSciNet  Google Scholar 

  26. Gebser, M., Ryabokon, A., Schenner, G.: Combining heuristics for configuration problems using answer set programming. In: Proceedings of LPNMR 2015. Springer (2015)

    Google Scholar 

  27. Gebser, M., Schaub, T., Thiele, S., Veber, P.: Detecting inconsistencies in large biological networks with answer set programming. Theory Pract. Logic Program. 11(2–3), 323–360 (2011)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  29. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9, 365–385 (1991)

    Article  Google Scholar 

  30. Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. J. Autom. Reason. 36(4), 345–377 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  31. Janhunen, T., Niemelä, I., Seipel, D., Simons, P., You, J.: Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Comput. Logic 7(1), 1–37 (2006)

    Article  Google Scholar 

  32. Janota, M., Marques-Silva, J.: On deciding MUS membership with QBF. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 414–428. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  33. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Logic 7(3), 499–562 (2006)

    Article  MathSciNet  Google Scholar 

  34. Li, C., Manyà, F.: MaxSAT. In: Biere, A. (ed.) Handbook of Satisfiability, pp. 613–631. IOS Press, Amsterdam (2009)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  36. Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artif. Intell. 157(1–2), 115–137 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  37. Liu, G., Janhunen, T., Niemelä, I.: Answer set programming via mixed integer programming. In: Proceedings of KR 2012, pp. 32–42. AAAI (2012)

    Google Scholar 

  38. Manna, M., Ricca, F., Terracina, G.: Consistent query answering via ASP from different perspectives: theory and practice. Theory Pract. Logic Program. 13(2), 227–252 (2013)

    Article  MATH  MathSciNet  Google Scholar 

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

  40. Maratea, M., Pulina, L., Ricca, F.: Multi-level algorithm selection for ASP. In: Proceedings of LPNMR 2015. Springer (2015)

    Google Scholar 

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

    Chapter  Google Scholar 

  42. Mariën, M., Wittocx, J., Denecker, M., Bruynooghe, M.: SAT(ID): satisfiability of propositional logic extended with inductive definitions. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 211–224. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  43. Nguyen, M., Janhunen, T., Niemelä, I.: Translating answer-set programs into bit-vector logic. In: Tompits, H., Abreu, S., Oetsch, J., Pührer, J., Seipel, D., Umeda, M., Wolf, A. (eds.) INAP/WLP 2011. LNCS, vol. 7773, pp. 91–109. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  46. Toni, L., Aparicio-Pardo, R., Simon, G., Blanc, A., Frossard, P.: Optimal set of video representations in adaptive streaming. In: Proceedings of MMSys 2014, pp. 271–282. ACM (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Helsinki Institute for Information Technology HIIT, Aalto University, Espoo, Finland

    Martin Gebser

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

    Marco Maratea

  3. Dipartimento di Matematica e Informatica, Università della Calabria, Rende Cs, 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 Francesco Ricca .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Francesco Calimeri

  2. University of Calabria, Rende, Italy

    Giovambattista Ianni

  3. University of Kentucky Dept. Computer Science, Lexington, Kentucky, USA

    Miroslaw Truszczynski

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Gebser, M., Maratea, M., Ricca, F. (2015). The Design of the Sixth Answer Set Programming Competition. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. Lecture Notes in Computer Science(), vol 9345. Springer, Cham. https://doi.org/10.1007/978-3-319-23264-5_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23264-5_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23263-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation