Abstract
We introduce , a new Answer Set Programming (ASP) system. combines , a fully-compliant ASP-Core-2 grounder, with the well-assessed solver . Input programs may be enriched by annotations and directives that customize heuristics of the system and extend its solving capabilities. An empirical analysis conducted on benchmarks from past ASP competitions shows that outperforms the old system and is close to the state-of-the-art ASP system \(\textsc {clingo} \).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–386 (1991)
Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53–68 (2016)
Lifschitz, V.: Answer set planning. In: ICLP, pp. 23–37. MIT Press (1999)
Kaufmann, B., Leone, N., Perri, S., Schaub, T.: Grounding and solving in answer set programming. AI Mag. 37(3), 25–32 (2016). http://www.aaai.org/ojs/index.php/aimagazine/article/view/2672
Lierler, Y., Maratea, M., Ricca, F.: Systems, engineering environments, and competitions. AI Mag. 37(3), 45–52 (2016). http://www.aaai.org/ojs/index.php/aimagazine/article/view/2675
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. Log. 7(3), 499–562 (2006)
Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: ICLP TCs, pp. 2:1–2:15 (2016). http://dx.doi.org/10.4230/OASIcs.ICLP.2016.2
Calimeri, F., Fuscà , D., Perri, S., Zangari, J.: I-DLV: the new Intelligent Grounder of DLV. Intelligenza Artificiale 11(1), 5–20 (2017). doi:10.3233/IA-170104
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
Alviano, M., Dodaro, C., Ricca, F.: Anytime computation of cautious consequences in answer set programming. TPLP 14(4–5), 755–770 (2014)
Alviano, M., Faber, W., Greco, G., Leone, N.: Magic sets for disjunctive datalog programs. Artif. Intell. 187, 156–192 (2012)
Calimeri, F., Cozza, S., Ianni, G.: External sources of knowledge and value invention in logic programming. Ann. Math. Artif. Intell. 50(3–4), 333–361 (2007)
Dodaro, C., Gasteiger, P., Leone, N., Musitsch, B., Ricca, F., Schekotihin, K.: Combining answer set programming and domain heuristics for solving hard industrial problems (application paper). TPLP 16(5–6), 653–669 (2016)
Gebser, M., Maratea, M., Ricca, F.: The design of the sixth answer set programming competition – report. 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
Calimeri, F., Ianni, G., Ricca, F.: The third open answer set programming competition. TPLP 14(1), 117–135 (2014). http://dx.doi.org/10.1017/S1471068412000105
Acknowledgments
The work has been partially supported by the Italian ministry for economic development (MISE) under project “PIUCultura - Paradigmi Innovativi per l’Utilizzo della Cultura” (n. F/020016/01-02/X27), and under project “Smarter Solutions in the Big Data World (S2BDW)”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Alviano, M. et al. (2017). The ASP System DLV2. 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_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-61660-5_19
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)