\(\mathcal {I}\)-dlv: The New Intelligent Grounder of dlv

  • Francesco CalimeriEmail author
  • Davide Fuscà
  • Simona Perri
  • Jessica Zangari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10037)


DLV is a powerful system for knowledge representation and reasoning which supports Answer Set Programming (ASP) – a logic-based programming paradigm for solving problems in a fully declarative way. DLV is widely used in academy, and, importantly, it has been fruitfully employed in many relevant industrial applications. As for the other main-stream ASP systems, in the first phase of the computation DLV eliminates the variables, generating a ground program which is semantically equivalent to the original one but significantly smaller than the Herbrand Instantiation, in general. This phase, called ‘grounding’, plays a key role for the successful deployment in real-world contexts. In this work we present \(\mathcal {I}\)-DLV, a brand new version of the intelligent grounder of DLV. While relying on the solid theoretical foundations of its predecessor, it has been completely redesigned and re-engineered, both in algorithms and data structures; it now features full support to ASP-Core2 standard language, increased flexibility and customizability, significantly improved performances, and an extensible design that eases the incorporation of language updates and optimization techniques. \(\mathcal {I}\)-DLV results in a stable and efficient ASP instantiator that turns out to be a full-fledged deductive database system. We describe the main features of \(\mathcal {I}\)-DLV and carry out experimental activities for assessing applicability and performances.


Answer Set Programming DLV Artificial Intelligence Knowledge Representation and Reasoning 


  1. 1.
    Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)CrossRefGoogle Scholar
  2. 2.
    Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative problem-solving using the DLV system. In: Minker, J. (ed.) Logic-Based Artificial Intelligence. The Springer International Series in Engineering and Computer Science, vol. 597, pp. 79–103. Springer, New York (2000)CrossRefGoogle Scholar
  3. 3.
    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 CrossRefGoogle Scholar
  4. 4.
    Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–385 (1991)CrossRefzbMATHGoogle Scholar
  5. 5.
    Marek, V.W., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: Apt, K.R., Marek, V.W., Truszczyński, M., Warren, D.S. (eds.) The Logic Programming Paradigm - A 25-Year Perspective, pp. 375–398. Springer, New York (1999)CrossRefGoogle Scholar
  6. 6.
    Niemelä, I.: Logic programming with stable model semantics as constraint programming paradigm. Ann. Math. Artif. Intell. 25(3–4), 241–273 (1999)CrossRefzbMATHGoogle Scholar
  7. 7.
    Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the Fifth International Conference and Symposium Logic Programming, 15–19 August 1988, Seattle, WA, 2 Volumes, pp. 1070–1080. MIT Press, Cambridge (1988)Google Scholar
  8. 8.
    Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the fifth answer set programming competition. Artif. Intell. 231, 151–181 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Gebser, M., Maratea, M., Ricca, F.: What’s hot in the answer set programming competition. In: Schuurmans, D., Wellman, M.P. (eds.) Proceedings of the 13th AAAI Conference on Artificial Intelligence, 12–17 February 2016, Phoenix, Arizona, USA, pp. 4327–4329. AAAI Press (2016)Google Scholar
  10. 10.
    Leone, N., Ricca, F.: Answer set programming: a tour from the basics to advanced development tools and industrial applications. In: Faber, W., Paschke, A. (eds.) Reasoning Web 2015. LNCS, vol. 9203, pp. 308–326. Springer, Heidelberg (2015). doi: 10.1007/978-3-319-21768-0_10 CrossRefGoogle Scholar
  11. 11.
    Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An a-prolog decision support system for the space shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 169–183. Springer, Heidelberg (2001). doi: 10.1007/3-540-45241-9_12 CrossRefGoogle Scholar
  12. 12.
    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. Theory Pract. Logic Program. 12(3), 361–381 (2012). Cambridge University PressMathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Tiihonen, J., Soininen, T., Niemelä, I., Sulonen, R.: A practical tool for mass-customising configurable products. In: Proceedings of the 14th International Conference on Engineering Design (ICED 2003), pp. 1290–1299 (2003)Google Scholar
  14. 14.
    Dal Palù, A., Dovier, A., Pontelli, E., Rossi, G.: GASP: answer set programming with lazy grounding. Fundamenta Informaticae 96(3), 297–322 (2009)MathSciNetzbMATHGoogle Scholar
  15. 15.
    Lefèvre, C., Nicolas, P.: A first order forward chaining approach for answer set computing. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 196–208. Springer, Heidelberg (2009). doi: 10.1007/978-3-642-04238-6_18 CrossRefGoogle Scholar
  16. 16.
    Lefèvre, C., Nicolas, P.: The first version of a new ASP solver : In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 522–527. Springer, Heidelberg (2009). doi: 10.1007/978-3-642-04238-6_52 CrossRefGoogle Scholar
  17. 17.
    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 (TOCL) 7(3), 499–562 (2006)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Gebser, M., Kaminski, R., Kaufmann, B., Romero, J., Schaub, T.: Progress in clasp series 3, pp. 368–383 [40]Google Scholar
  19. 19.
    Gebser, M., Kaminski, R., König, A., Schaub, T.: Advances in gringo Series 3. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 345–351. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-20895-9_39 CrossRefGoogle Scholar
  20. 20.
    Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., Schaub, T.: ASP-Core-2: 4th ASP competition official input language format (2013).
  21. 21.
    Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374–425 (2001)CrossRefGoogle Scholar
  22. 22.
    Syrjänen, T.: Omega-restricted logic programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 267–280. Springer, Heidelberg (2001). doi: 10.1007/3-540-45402-0_20 CrossRefGoogle Scholar
  23. 23.
    Ullman, J.D.: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press, New York (1988)Google Scholar
  24. 24.
    Faber, W., Leone, N., Perri, S.: The intelligent grounder of DLV. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Correct Reasoning. LNCS, vol. 7265, pp. 247–264. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-30743-0_17 CrossRefGoogle Scholar
  25. 25.
    Alviano, M., Dodaro, C., Leone, N., Ricca, F.: Advances in WASP, pp. 40–54 [40]Google Scholar
  26. 26.
    Leone, N., Perri, S., Scarcello, F.: Improving ASP instantiators by join-ordering methods. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 280–294. Springer, Heidelberg (2001). doi: 10.1007/3-540-45402-0_21 CrossRefGoogle Scholar
  27. 27.
    Perri, S., Scarcello, F., Catalano, G., Leone, N.: Enhancing DLV instantiator by backjumping techniques. Ann. Math. Artif. Intell. 51(2–4), 195–228 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    Alviano, M., Faber, W., Greco, G., Leone, N.: Magic sets for disjunctive datalog programs. Artif. Intell. 187, 156–192 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Cumbo, C., Faber, W., Greco, G., Leone, N.: Enhancing the magic-set method for disjunctive datalog programs. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 371–385. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-27775-0_26 CrossRefGoogle Scholar
  30. 30.
    Calimeri, F., Perri, S., Fuscà, D., Zangari, J.: \({\cal{I}}\)-DLV homepage (2016).
  31. 31.
    De Vos, M., Kisa, D.G., Oetsch, J., Pührer, J., Tompits, H.: Annotating answer-set programs in LANA. Theory Pract. Logic Program. 12(4–5), 619–637 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  32. 32.
    Kulas, M.: Debugging prolog using annotations. Electron. Notes Theoret. Comput. Sci. 30(4), 235–255 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  33. 33.
    Reeve, L., Han, H.: Survey of semantic annotation platforms. In: Proceedings of the 2005 ACM Symposium on Applied Computing, SAC 2005, pp. 1634–1638. ACM New York (2005)Google Scholar
  34. 34.
    Gebser, M., Maratea, M., Ricca, F.: The design of the sixth answer set programming competition, pp. 531–544 [40]Google Scholar
  35. 35.
    Liang, S., Fodor, P., Wan, H., Kifer, M.: OpenRuleBench: an analysis of the performance of rule engines. In: Proceedings of the 18th International Conference on World Wide Web, WWW 2009, 20–24 April 2009, Madrid, Spain, pp. 601–610. ACM (2009)Google Scholar
  36. 36.
    Swift, T., Warren, D.S.: XSB: extending prolog with tabled logic programming. Theory Pract. Logic Program. 12(1–2), 157–187 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  37. 37.
    Liang, S., Fodor, P., Wan, H., Kifer, M.: OpenRuleBench: detailed report (2009).
  38. 38.
    Wittocx, J., Denecker, M.: GidL: A grounder for FO\(^+\). In: Proceedings of the Twelfth International Workshop on NonMonotonic Reasoning, pp. 189–198 (1998)Google Scholar
  39. 39.
    Calimeri, F., Perri, S., Fuscà, D., Zangari, J.: \({\cal{I}}\)-DLV repository (2016).
  40. 40.
    Calimeri, F., Ianni, G., Truszczynski, M. (eds.): LPNMR 2015. LNCS, vol. 9345. Springer, Heidelberg (2015)zbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Francesco Calimeri
    • 1
    • 2
    Email author
  • Davide Fuscà
    • 1
  • Simona Perri
    • 1
  • Jessica Zangari
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of CalabriaRende CSItaly
  2. 2.DLVSystem SrlRende CSItaly

Personalised recommendations