References

  1. W.T. Adrian, M. Alviano, F. Calimeri, B. Cuteri, C. Dodaro, W. Faber, D. Fuscà, N. Leone, M. Manna, S. Perri, F. Ricca, P. Veltri & J. Zangari (2018): The ASP System DLV: Advancements and Applications. KI 32(2-3), pp. 177–179, doi:10.1007/s13218-018-0533-0.
  2. M. Alviano, F. Calimeri, C. Dodaro, D. Fuscà, N. Leone, S. Perri, F. Ricca, P. Veltri & J. Zangari (2017): The ASP System DLV2. In: LPNMR, LNCS 10377. Springer, pp. 215–221, doi:10.1007/978-3-319-61660-5_19.
  3. M. Aschinger, C. Drescher, G. Friedrich, G. Gottlob, P. Jeavons, A. Ryabokon & E. Thorstensen (2011): Optimization Methods for the Partner Units Problem. In: CPAIOR, LNCS 6697. Springer, pp. 4–19, doi:10.1007/978-3-642-21311-3_4.
  4. ASP Standardization Working Group (2012): ASP-Core-2 Input Language Format. Available at https://www.mat.unical.it/aspcomp2013/files/ASP-CORE-2.03b.pdf.
  5. C. Baral (2003): Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, doi:10.1017/CBO9780511543357.
  6. B. Bogaerts & A. Weinzierl (2018): Exploiting Justifications for Lazy Grounding of Answer Set Programs. In: IJCAI, pp. 1737–1745, doi:10.24963/ijcai.2018/240.
  7. F. Calimeri, D. Fuscà, S. Perri & J. Zangari (2017): I-DLV: The new intelligent grounder of DLV. Intelligenza Artificiale 11(1), pp. 5–20, doi:10.3233/IA-170104.
  8. F. Calimeri, M. Gebser, M. Maratea & F. Ricca (2016): Design and results of the Fifth Answer Set Programming Competition. Artif. Intell. 231, pp. 151–181, doi:10.1016/j.artint.2015.09.008.
  9. M. Dao-Tran, T. Eiter, M. Fink, G. Weidinger & A. Weinzierl (2012): OMiGA : An Open Minded Grounding On-The-Fly Answer Set Solver. In: JELIA, LNCS 7519. Springer, pp. 480–483, doi:10.1007/978-3-642-33353-8_38.
  10. C. Dodaro, P. Gasteiger, N. Leone, B. Musitsch, F. Ricca & K. Schekotihin (2016): Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper). TPLP 16(5-6), pp. 653–669, doi:10.1017/S1471068416000284.
  11. M. Durzinsky, W. Marwan, M. Ostrowski, T. Schaub & A. Wagler (2011): Automatic network reconstruction using ASP. TPLP 11(4-5), pp. 749–766, doi:10.1017/S1471068411000287.
  12. T. Eiter, W. Faber, M. Fink & S. Woltran (2007): Complexity results for answer set programming with bounded predicate arities and implications. Ann. Math. Artif. Intell. 51(2-4), pp. 123–165, doi:10.1007/s10472-008-9086-5.
  13. T. Eiter, W. Faber, N. Leone, G. Pfeifer & A. Polleres (2003): A logic programming approach to knowledge-state planning, II: The DLV^\voidb@x K system. Artif. Intell. 144(1-2), pp. 157–211, doi:10.1016/S0004-3702(02)00367-3.
  14. E. Erdem, M. Gelfond & N. Leone (2016): Applications of Answer Set Programming. AI Magazine 37(3), pp. 53–68, doi:10.1609/aimag.v37i3.2678.
  15. W. Faber, G. Pfeifer & N. Leone (2011): Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), pp. 278–298, doi:10.1016/j.artint.2010.04.002.
  16. A.A. Falkner, G. Friedrich, A. Haselböck, G. Schenner & H. Schreiner (2016): Twenty-Five Years of Successful Application of Constraint Technologies at Siemens. AI Magazine 37(4), pp. 67–80, doi:10.1609/aimag.v37i4.2688.
  17. A.A. Falkner, G. Friedrich, K. Schekotihin, R. Taupe & E.C. Teppan (2018): Industrial Applications of Answer Set Programming. KI 32(2-3), pp. 165–176, doi:10.1007/s13218-018-0548-6.
  18. P. Ferraris (2011): Logic programs with propositional connectives and aggregates. ACM Trans. Comput. Log. 12(4), pp. 25:1–25:40, doi:10.1145/1970398.1970401.
  19. G. Friedrich, A. Ryabokon, A.A. Falkner, A. Haselböck, G. Schenner & H. Schreiner (2011): (Re)configuration using Answer Set Programming. In: IJCAI 2011 Workshop on Configuration.
  20. M. Gebser, R. Kaminski, B. Kaufmann, M. Lindauer, M. Ostrowski, J. Romero, T. Schaub, S. Thiele & P. Wanko (2019): Potassco guide version 2.2.0. Available at https://github.com/potassco/guide/releases/tag/v2.2.0.
  21. M. Gebser, R. Kaminski, B. Kaufmann & T. Schaub (2012): Answer Set Solving in Practice. Morgan and Claypool Publishers, doi:10.2200/S00457ED1V01Y201211AIM019.
  22. M. Gebser, R. Kaminski, B. Kaufmann & T. Schaub (2014): Clingo = ASP + Control: Preliminary Report. CoRR abs/1405.3694.
  23. M. Gebser, R. Kaminski, A. König & T. Schaub (2011): Advances in gringo Series 3. In: LPNMR, LNCS 6645. Springer, pp. 345–351, doi:10.1007/978-3-642-20895-9_39.
  24. M. Gebser, B. Kaufmann, J. Romero, R. Otero, T. Schaub & P. Wanko (2013): Domain-Specific Heuristics in Answer Set Programming. In: AAAI. AAAI Press.
  25. M. Gebser, B. Kaufmann & T. Schaub (2012): Conflict-driven answer set solving: From theory to practice. Artif. Intell. 187, pp. 52–89, doi:10.1016/j.artint.2012.04.001.
  26. M. Gebser, N. Leone, M. Maratea, S. Perri, F. Ricca & T. Schaub (2018): Evaluation Techniques and Systems for Answer Set Programming: a Survey. In: IJCAI 2018, doi:10.24963/ijcai.2018/769.
  27. M. Gebser, M. Maratea & F. Ricca (2017): The Sixth Answer Set Programming Competition. J. Artif. Intell. Res. 60, pp. 41–95, doi:10.1613/jair.5373.
  28. M. Gebser, M. Maratea & F. Ricca (2019): The Seventh Answer Set Programming Competition: Design and Results. TPLP, pp. 129, doi:10.1017/S1471068419000061.
  29. M. Gebser, A. Ryabokon & G. Schenner (2015): Combining Heuristics for Configuration Problems Using Answer Set Programming. In: LPNMR, LNCS 9345, doi:10.1007/978-3-319-23264-5_32.
  30. M. Gelfond & Y. Kahl (2014): Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach, doi:10.1017/CBO9781139342124.
  31. M. Gelfond & V. Lifschitz (1988): The Stable Model Semantics for Logic Programming. In: ICLP/SLP. MIT Press, pp. 1070–1080.
  32. H. Hoos, M.T. Lindauer & T. Schaub (2014): claspfolio 2: Advances in Algorithm Selection for Answer Set Programming. TPLP 14(4-5), pp. 569–585, doi:10.1017/S1471068414000210.
  33. L. Hotz, A. Felfernig, M. Stumptner, A. Ryabokon, C. Bagley & K. Wolter (2014): Chapter 6 - Configuration Knowledge Representation and Reasoning. In: Knowledge-Based Configuration. Morgan Kaufmann, pp. 41–72, doi:10.1016/B978-0-12-415817-7.00006-2.
  34. C. Lefèvre, C. Béatrix, I. Stéphan & L. Garcia (2017): ASPeRiX, a first-order forward chaining approach for answer set computing. TPLP 17(3), pp. 266–310, doi:10.1017/S1471068416000569.
  35. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri & F. Scarcello (2006): The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), pp. 499–562, doi:10.1145/1149114.1149117.
  36. N. Leone & F. Ricca (2015): Answer Set Programming: A Tour from the Basics to Advanced Development Tools and Industrial Applications. In: Reasoning Web, LNCS 9203. Springer, pp. 308–326, doi:10.1007/978-3-319-21768-0_10.
  37. L. Leutgeb & A. Weinzierl (2017): Techniques for Efficient Lazy-Grounding ASP Solving. In: DECLARE, LNCS 10997. Springer, pp. 132–148, doi:10.1007/978-3-030-00801-7_9.
  38. V. Lifschitz (2010): Thirteen Definitions of a Stable Model. In: Fields of Logic and Computation, LNCS 6300. Springer, pp. 488–503, doi:10.1007/978-3-642-15025-8_24.
  39. M. Maratea, L. Pulina & F. Ricca (2015): Advances in Multi-engine ASP Solving. In: AI*IA 2015, LNCS 9336. Springer, pp. 179–190, doi:10.1007/978-3-319-24309-2_14.
  40. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang & S. Malik (2001): Chaff: Engineering an Efficient SAT Solver. In: DAC. ACM, pp. 530–535, doi:10.1145/378239.379017.
  41. A.D. Palù, A. Dovier, E. Pontelli & G. Rossi (2009): GASP: Answer Set Programming with Lazy Grounding. Fundam. Inform. 96(3), doi:10.3233/FI-2009-180.
  42. C. Redl (2016): Automated Benchmarking of KR-systems. In: RCRA@AI*IA, CEUR Workshop Proceedings 1745. CEUR-WS.org, pp. 45–56.
  43. F. Ricca, G. Grasso, M. Alviano, M. Manna, V. Lio, S. Iiritano & N. Leone (2012): Team-building with answer set programming in the Gioia-Tauro seaport. TPLP 12(3), pp. 361–381, doi:10.1017/S147106841100007X.
  44. R. Taupe, A. Weinzierl & G. Friedrich (2019): Degrees of Laziness in Grounding - Effects of Lazy-Grounding Strategies on ASP Solving. In: LPNMR 2019, LNCS 11481. Springer, pp. 298–311, doi:10.1007/978-3-030-20528-7_22.
  45. R. Taupe, A. Weinzierl & G. Schenner (2017): Introducing Heuristics for Lazy-Grounding ASP Solving. In: 1st International Workshop on Practical Aspects of Answer Set Programming.
  46. E.C. Teppan (2016): Solving the partner units configuration problem with heuristic constraint answer set programming. In: Configuration workshop, pp. 61–68.
  47. A. Weinzierl (2017): Blending Lazy-Grounding and CDNL Search for Answer-Set Solving. In: LPNMR, LNCS 10377. Springer, pp. 191–204, doi:10.1007/978-3-319-61660-5_17.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org