International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 2015: Logic Programming and Nonmonotonic Reasoning pp 40-54 | Cite as

Advances in WASP

  • Mario Alviano
  • Carmine Dodaro
  • Nicola Leone
  • Francesco Ricca
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9345)

Abstract

ASP solvers address several reasoning tasks that go beyond the mere computation of answer sets. Among them are cautious reasoning, for modeling query entailment, and optimum answer set computation, for supporting numerical optimization. This paper reports on the recent improvements of the solver wasp, and details the algorithms and the design choices for addressing several reasoning tasks in ASP. An experimental analysis on publicly available benchmarks shows that the new version of wasp outperforms the previous one. Comparing with the state-of-the-art solver clasp, the performance of wasp is competitive in the overall for number of solved instances and average execution time.

References

  1. 1.
    Alviano, M., Calimeri, F., Charwat, G., Dao-Tran, M., Dodaro, C., Ianni, G., Krennwallner, T., Kronegger, M., Oetsch, J., Pfandler, A., Pührer, J., Redl, C., Ricca, F., Schneider, P., Schwengerer, M., Spendier, L.K., Wallner, J.P., Xiao, G.: The fourth answer set programming competition: preliminary report. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 42–53. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  2. 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, vol. 8148, pp. 54–66. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  3. 3.
    Alviano, M., Dodaro, C., Marques-Silva, J., Ricca, F.: Optimum stable model search: algorithms and implementation. J. Log. Comput. doi:10.1093/logcom/exv061
  4. 4.
    Alviano, M., Dodaro, C., Ricca, F.: Anytime computation of cautious consequences in answer set programming. TPLP 14(4–5), 755–770 (2014)MATHGoogle Scholar
  5. 5.
    Alviano, M., Dodaro, C., Ricca, F.: Preliminary report on WASP 2.0 (2014). CoRR, abs/1404.6999
  6. 6.
    Alviano, M., Dodaro, C., Ricca, F.: A MaxSAT algorithm using cardinality constraints of bounded size. In: 24th International Joint Conference on Artificial Intelligence (To appear). IJCAI Organization, Buenos Aires, Argentina, July 2015Google Scholar
  7. 7.
    Alviano, M., Faber, W., Leone, N., Perri, S., Pfeifer, G., Terracina, G.: The disjunctive datalog system DLV. In: de Moor, O., Gottlob, G., Furche, T., Sellers, A. (eds.) Datalog 2010. LNCS, vol. 6702, pp. 282–301. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  8. 8.
    Andres, B., Kaufmann, B., Matheis, O., Schaub, T.: Unsatisfiability-based optimization in clasp. In: Dovier, A., Costa, V.S. (eds.) ICLP (Technical Communications). LIPIcs, vol. 17, pp. 211–221. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)Google Scholar
  9. 9.
    Ansótegui, C., Bonet, M.L., Levy, J.: SAT-based MaxSAT algorithms. Artif. Intell. 196, 77–105 (2013)MATHCrossRefGoogle Scholar
  10. 10.
    Arenas, M., Bertossi, L.E., Chomicki, J.: Answer sets for consistent query answering in inconsistent databases. TPLP 3(4–5), 393–424 (2003)MATHMathSciNetGoogle Scholar
  11. 11.
    Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Boutilier, C. (ed.) IJCAI, pp. 399–404 (2009)Google Scholar
  12. 12.
    Barceló, P., Bertossi, L.: Logic programs for querying inconsistent databases. In: Dahl, V. (ed.) PADL 2003. LNCS, vol. 2562, pp. 208–222. Springer, Heidelberg (2002) CrossRefGoogle Scholar
  13. 13.
    Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845–860 (2000)CrossRefGoogle Scholar
  14. 14.
    Dodaro, C., Leone, N., Nardi, B., Ricca, F.: Allotment problem in travel industry: a solution based on ASP. In: ten Cate, B., Mileo, A. (eds.) RR 2015. LNCS, vol. 9209, pp. 77–92. Springer, Heidelberg (2015) CrossRefGoogle Scholar
  15. 15.
    Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61–75. Springer, Heidelberg (2005) CrossRefGoogle Scholar
  16. 16.
    Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM TODS 22(3), 364–418 (1997)CrossRefGoogle Scholar
  17. 17.
    Gebser, M., Kaminski, R., König, A., Schaub, T.: Advances in gringo series 3. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 345–351. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  18. 18.
    Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187, 52–89 (2012)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–386 (1991)CrossRefGoogle Scholar
  20. 20.
    Heras, F., Morgado, A., Marques-Silva, J.: Core-guided binary search algorithms for maximum satisfiability. In: Burgard, W., Roth, D. (eds.) AAAI. AAAI Press (2011)Google Scholar
  21. 21.
    Janhunen, T.: Some (in)translatability results for normal logic programs and propositional theories. J. Appl. Non-Classical Logics 16(1–2), 35–86 (2006)MATHMathSciNetCrossRefGoogle Scholar
  22. 22.
    Kolaitis, P.G., Pema, E., Tan, W.: Efficient querying of inconsistent databases with binary integer programming. PVLDB 6(6), 397–408 (2013). http://www.vldb.org/pvldb/vol6/p397-tan.pdf Google Scholar
  23. 23.
    Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM TOCL 7(3), 499–562 (2006)MathSciNetCrossRefGoogle Scholar
  24. 24.
    Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 346–350. Springer, Heidelberg (2003) CrossRefGoogle Scholar
  25. 25.
    Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artif. Intell. 157(1–2), 115–137 (2004)MATHMathSciNetCrossRefGoogle Scholar
  26. 26.
    Manna, M., Oro, E., Ruffolo, M., Alviano, M., Leone, N.: The H \(\imath \) L \(\varepsilon \) X system for semantic information extraction. Trans. Large-Scale Data Knowl. Centered Syst. 5, 91–125 (2012)Google Scholar
  27. 27.
    Manna, M., Ricca, F., Terracina, G.: Consistent query answering via ASP from different perspectives: theory and practice. TPLP 13(2), 227–252 (2013)MATHMathSciNetGoogle Scholar
  28. 28.
    Marques-Silva, J., Janota, M., Lynce, I.: On computing backbones of propositional theories. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) ECAI. FAIA, vol. 215, pp. 15–20. IOS Press (2010)Google Scholar
  29. 29.
    Morgado, A., Dodaro, C., Marques-Silva, J.: Core-guided MaxSAT with soft cardinality constraints. In: O’Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 564–573. Springer, Heidelberg (2014) Google Scholar
  30. 30.
    Morgado, A., Heras, F., Liffiton, M.H., Planes, J., Marques-Silva, J.: Iterative and core-guided MaxSAT solving: a survey and assessment. Constraints 18(4), 478–534 (2013)MathSciNetCrossRefGoogle Scholar
  31. 31.
    Morgado, A., Heras, F., Marques-Silva, J.: Model-guided approaches for MaxSAT solving. In: ICTAI, pp. 931–938. IEEE (2013)Google Scholar
  32. 32.
    Narodytska, N., Bacchus, F.: Maximum satisfiability using core-guided MaxSAT resolution. In: Brodley, C.E., Stone, P. (eds.) AAAI, pp. 2717–2723. AAAI Press (2014)Google Scholar
  33. 33.
    Ricca, F., Grasso, G., Alviano, M., Manna, M., Lio, V., Iiritano, S., Leone, N.: Team-building with answer set programming in the gioia-tauro seaport. TPLP 12(3), 361–381 (2012)MATHMathSciNetGoogle Scholar
  34. 34.
    Rosa, E.D., Giunchiglia, E., Maratea, M.: A new approach for solving satisfiability problems with qualitative preferences. In: Ghallab, M., Spyropoulos, C.D., Fakotakis, N., Avouris, N.M. (eds.) ECAI. FAIA, vol. 178, pp. 510–514. IOS Press (2008)Google Scholar
  35. 35.
    Silva, J.P.M., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506–521 (1999)MathSciNetCrossRefGoogle Scholar
  36. 36.
    Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell. 138(1–2), 181–234 (2002)MATHCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Mario Alviano
    • 1
  • Carmine Dodaro
    • 1
  • Nicola Leone
    • 1
  • Francesco Ricca
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of CalabriaRende (CS)Italy

Personalised recommendations