{"type":"ScholarlyArticle","title":"Evaluation Techniques and Systems for Answer Set Programming: a Survey","authors":[{"name":"Martin Gebser","slug":"martin-gebser","given":"Martin","family":"Gebser","affiliation":"University of Potsdam , Germany"},{"name":"Nicola Leone","slug":"nicola-leone","given":"Nicola","family":"Leone","affiliation":"University of Calabria , Italy"},{"name":"Marco Maratea","slug":"marco-maratea","given":"Marco","family":"Maratea","affiliation":"University of Genova , Italy"},{"name":"Simona Perri","slug":"simona-perri","given":"Simona","family":"Perri","affiliation":"University of Calabria , Italy"},{"name":"Francesco Ricca","slug":"francesco-ricca","given":"Francesco","family":"Ricca","affiliation":"University of Calabria , Italy"},{"name":"Torsten Schaub","slug":"torsten-schaub","given":"Torsten","family":"Schaub","affiliation":"University of Potsdam , Germany"}],"abstract":"Answer set programming (ASP) is a prominent knowledge representation and reasoning paradigm that found both industrial and scientific applications. The success of ASP is due to the combination of two factors: a rich modeling language and the availability of efficient ASP implementations. In this paper we trace the history of ASP systems, describing the key evaluation techniques and their implementation in actual tools.","doi":"10.24963/ijcai.2018/769","url":"https://ijcai.org/proceedings/2018/769","pdf":"https://ijcai.org/proceedings/2018/0769.pdf","markdown":"https://ijcai.org/proceedings/2018/769.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/769","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Survey track","track":"Survey track","number":769,"pages":{"first":5450,"last":5456},"keywords":["Constraints and SAT: Constraints: Solvers and Tools","Knowledge Representation and Reasoning: Logics for Knowledge Representation"],"videos":[],"references":[{"position":1,"raw":"[Alviano et al., 2013] M. Alviano, C. Dodaro, W. Faber, N. Leone, and F. Ricca. WASP: A native ASP solver based on constraint learning. In LPNMR13, volume 8148 of LNCS, pages 54-66. Springer, 2013.","title":"WASP: A native ASP solver based on constraint learning","authors":"M Alviano, C Dodaro, W Faber, N Leone, F Ricca","year":"2013","venue":"LPNMR","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alviano et al., 2015a] M. Alviano, C. Dodaro, N. Leone, and F. Ricca. Advances in WASP. In LPNMR15, volume 9345 of LNCS, pages 40-54. Springer, 2015.","title":"Advances in WASP","authors":"Alviano","year":"2015","venue":"LPNMR15","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alviano et al., 2015b] M. Alviano, C. Dodaro, and F. Ricca. Reduct-based stability check using literal assumptions. In ASPOCP'15, 2015.","title":"Reduct-based stability check using literal assumptions","authors":"Alviano","year":"2015","venue":"ASPOCP'15","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Alviano et al., 2017] M. Alviano, F. Calimeri, C. Dodaro, D. Fuscà, N. Leone, S. Perri, F. Ricca, P. Veltri, and J. Zan- gari. The ASP system DLV2. In LPNMR 2017, volume 10377 of LNCS, pages 215-221. Springer, 2017.","title":"The ASP system DLV2","authors":"M Alviano, F Calimeri, C Dodaro, D Fuscà, N Leone, S Perri, F Ricca, P Veltri, J Zangari","year":"2017","venue":"LPNMR 2017","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Aschinger et al., 2011] M. Aschinger, C. Drescher, G. Friedrich, G. Gottlob, P. Jeavons, A. Ryabokon, and E. Thorstensen. Optimization methods for the partner units problem. In CPAIOR'11, volume 6697 of LNCS, pages 4-19. Springer, 2011.","title":"Optimization methods for the partner units problem","authors":"M Aschinger, C Drescher, G Friedrich, G Gottlob, P Jeavons, A Ryabokon, E Thorstensen","year":"2011","venue":"CPAIOR'11","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Aziz et al., 2013] R. A. Aziz, G. Chu, and P. J. Stuckey. Sta- ble model semantics for founded bounds. TPLP, 13(4- 5):517-532, 2013.","title":"Stable model semantics for founded bounds","authors":"R A Aziz, G Chu, P J Stuckey","year":"2013","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Balduccini and Lierler, 2017] M. Balduccini and Y. Lierler. Constraint answer set solver EZCSP and why integration schemas matter. TPLP, 17(4):462-515, 2017.","title":"Constraint answer set solver EZCSP and why integration schemas matter","authors":"M Balduccini, Y Lierler","year":"2017","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Balduccini et al., 2005] M. Balduccini, E. Pontelli, O. El- Khatib, and H. Le. Issues in parallel execution of non-monotonic reasoning systems. Parallel Computing, 31(6):608-647, 2005.","title":"Issues in parallel execution of non-monotonic reasoning systems","authors":"M Balduccini, E Pontelli, O El-Khatib, H Le","year":"2005","venue":"Parallel Computing","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Banbara et al., 2017] M. Banbara, B. Kaufmann, M. Os- trowski, and T. Schaub. Clingcon: The next generation. TPLP, 17(4):408-461, 2017.","title":"Clingcon: The next generation","authors":"M Banbara, B Kaufmann, M Ostrowski, T Schaub","year":"2017","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Baselice et al., 2005] S. Baselice, P. A. Bonatti, and M. Gel- fond. A preliminary report on integrating of answer set and constraint solving. In Answer Set Programming, volume 142 of CEUR Workshop Proceedings, 2005.","title":"A preliminary report on integrating of answer set and constraint solving","authors":"S Baselice, P A Bonatti, M Gelfond","year":"2005","venue":"CEUR Workshop Proceedings","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bomanson et al., 2016] J. Bomanson, M. Gebser, T. Jan- hunen, B. Kaufmann, and T. Schaub. Answer set program- ming modulo acyclicity. Fund. Infor., 147(1):63-91, 2016.","title":"Answer set programming modulo acyclicity","authors":"J Bomanson, M Gebser, T Janhunen, B Kaufmann, T Schaub","year":"2016","venue":"Fund. Infor","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Brewka et al., 2011] G. Brewka, T. Eiter, and M. Truszczyński. Answer set programming at a glance. Communications of the ACM, 54(12):92-103, 2011.","title":"Answer set programming at a glance","authors":"G Brewka, T Eiter, M Truszczyński","year":"2011","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Bruynooghe et al., 2015] M. Bruynooghe, H. Blockeel, B. Bogaerts, B. De Cat, S. De Pooter, J. Jansen, A. Labarre, J. Ramon, M. Denecker, and S. Verwer. Pred- icate logic as a modeling language: Modeling and solv- ing some machine learning and data mining problems with IDP3. TPLP, 15(6):783-817, 2015.","title":"Predicate logic as a modeling language: Modeling and solving some machine learning and data mining problems with IDP3","authors":"M Bruynooghe, H Blockeel, B Bogaerts, B De Cat, S De Pooter, J Jansen, A Labarre, J Ramon, M Denecker, S Verwer","year":"2015","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Calimeri et al., 2005] F. Calimeri, W. Faber, N. Leone, and S. Perri. Declarative and Computational Properties of Logic Programs with Aggregates. In IJCAI-05, pages 406-411, 2005.","title":"Declarative and Computational Properties of Logic Programs with Aggregates","authors":"F Calimeri, W Faber, N Leone, S Perri","year":"2005","venue":"IJCAI-05","doi":null,"url":null,"internal_url":"/proceedings/2005/166"},{"position":15,"raw":"[Calimeri et al., 2006] F. Calimeri, W. Faber, N. Leone, and G. Pfeifer. Pruning operators for disjunctive logic pro- gramming systems. Fund. Infor., 71(2-3):183-214, 2006.","title":"Pruning operators for disjunctive logic programming systems","authors":"F Calimeri, W Faber, N Leone, G Pfeifer","year":"2006","venue":"Fund. Infor","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Calimeri et al., 2012] F. Calimeri, W. Faber, M. Gebser, G. Ianni, R. Kaminski, T. Krennwallner, N. Leone, F. Ricca, and T. Schaub. ASP-Core-2: Input lan- guage format. https://www.mat.unical.it/ aspcomp2013/ASPStandardization/, 2012.","title":"ASP-Core-2: Input language format","authors":"F Calimeri, W Faber, M Gebser, G Ianni, R Kaminski, T Krennwallner, N Leone, F Ricca, T Schaub","year":null,"venue":null,"doi":null,"url":"https://www.mat.unical.it/aspcomp2013/ASPStandardization/,2012","internal_url":null},{"position":17,"raw":"[Calimeri et al., 2014] F. Calimeri, G. Ianni, and F. Ricca. The third open answer set programming competition. TPLP, 14(1):117-135, 2014.","title":"The third open answer set programming competition","authors":"F Calimeri, G Ianni, F Ricca","year":"2014","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Calimeri et al., 2016] F. Calimeri, M. Gebser, M. Maratea, and F. Ricca. Design and results of the fifth answer set pro- gramming competition. Artif. Intell., 231:151-181, 2016.","title":"Design and results of the fifth answer set programming competition","authors":"F Calimeri, M Gebser, M Maratea, F Ricca","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Calimeri et al., 2017] F. Calimeri, D. Fuscà, S. Perri, and J. Zangari. I-DLV: the new intelligent grounder of DLV. Intell. Artif., 11(1):5-20, 2017.","title":"I-DLV: the new intelligent grounder of DLV","authors":"F Calimeri, D Fuscà, S Perri, J Zangari","year":"2017","venue":"Intell. Artif","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Clark, 1978] K. Clark. Negation as failure. In Logic and Data Bases, pages 293-322. Plenum Press, 1978.","title":"Negation as failure","authors":"K Clark","year":"1978","venue":"Logic and Data Bases","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Cuteri et al., 2017] B. Cuteri, C. Dodaro, F. Ricca, and P. Schüller. Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis. TPLP, 17(5-6):780- 799, 2017.","title":"Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis","authors":"B Cuteri, C Dodaro, F Ricca, P Schüller","year":"2017","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Dal Palù et al., 2009] A. Dal Palù, A. Dovier, E. Pontelli, and G. Rossi. GASP: Answer set programming with lazy grounding. Fund. Infor., 96(3):297-322, 2009.","title":"GASP: Answer set programming with lazy grounding","authors":"Dal Palù","year":"2009","venue":"Fund. Infor","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Dao-Tran et al., 2012] M. Dao-Tran, T. Eiter, M. Fink, G. Weidinger, and A. Weinzierl. Omiga : An open minded grounding on-the-fly answer set solver. In JELIA 2012, pages 480-483, 2012.","title":"Omiga : An open minded grounding on-the-fly answer set solver","authors":"M Dao-Tran, T Eiter, M Fink, G Weidinger, A Weinzierl","year":"2012","venue":"JELIA 2012","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Davis et al., 1962] M. Davis, G. Logemann, and D. Love- land. A machine program for theorem proving. Commu- nications of the ACM, 5(7):394-397, 1962.","title":"Loveland. A machine program for theorem proving","authors":"M Davis, G Logemann, D","year":"1962","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[de Cat et al., 2015] B. de Cat, M. Denecker, M. Bruynooghe, and P. J. Stuckey. Lazy model ex- pansion: Interleaving grounding with search. J. Artif. Intell. Res., 52:235-286, 2015.","title":"Lazy model expansion: Interleaving grounding with search","authors":"B De Cat, M Denecker, M Bruynooghe, P J Stuckey","year":"2015","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Dimopoulos et al., 2017] Y. Dimopoulos, M. Gebser, P. Lühne, J. Romero, and T. Schaub. plasp 3: Towards effective ASP planning. In LPNMR'17, volume 10377 of LNAI, pages 286-300. Springer, 2017.","title":"plasp 3: Towards effective ASP planning","authors":"Y Dimopoulos, M Gebser, P Lühne, J Romero, T Schaub","year":"2017","venue":"LPNMR'17","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Dodaro et al., 2016] C. Dodaro, P. Gasteiger, N. Leone, B. Musitsch, F. Ricca, and K. Schekotihin. Combining answer set programming and domain heuristics for solv- ing hard industrial problems (application paper). TPLP, 16(5-6):653-669, 2016.","title":"Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)","authors":"C Dodaro, P Gasteiger, N Leone, B Musitsch, F Ricca, K Schekotihin","year":"2016","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Dovier et al., 2016] A. Dovier, A. Formisano, E. Pontelli, and F. Vella. A GPU implementation of the ASP compu- tation. In PADL'16, volume 9585 of LNCS, pages 30-47. Springer, 2016.","title":"A GPU implementation of the ASP computation","authors":"A Dovier, A Formisano, E Pontelli, F Vella","year":"2016","venue":"PADL'16","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Drescher and Walsh, 2012] C. Drescher and T. Walsh. An- swer set solving with lazy nogood generation. In Technical Communications of ICLP'12, volume 17 of LIPIcs, pages 188-200. SD, 2012.","title":"Answer set solving with lazy nogood generation","authors":"C Drescher, T Walsh","year":"2012","venue":"Technical Communications of ICLP'12","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Eén and Sörensson, 2003] N. Eén and N. Sörensson. Tem- poral induction by incremental SAT solving. Electronic Notes in Theoret. Comput. Science, 89(4):543-560, 2003.","title":"Temporal induction by incremental SAT solving","authors":"N Eén, N Sörensson","year":"2003","venue":"Electronic Notes in Theoret. Comput. Science","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Eiter et al., 2007] T. Eiter, W. Faber, M. Fink, and S. Woltran. Complexity results for answer set program- ming with bounded predicate arities and implications. AMAI, 51(2-4):123-165, 2007.","title":"Complexity results for answer set programming with bounded predicate arities and implications","authors":"T Eiter, W Faber, M Fink, S Woltran","year":"2007","venue":"AMAI","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Eiter et al., 2016] T. Eiter, M. Fink, G. Ianni, T. Krennwall- ner, C. Redl, and P. Schüller. A model building framework for answer set programming with external computations. Theory and Practice of Logic Progeamming, 16(4):418- 464, 2016.","title":"A model building framework for answer set programming with external computations","authors":"T Eiter, M Fink, G Ianni, T Krennwallner, C Redl, P Schüller","year":"2016","venue":"Theory and Practice of Logic Progeamming","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Erdem and Lifschitz, 2003] E. Erdem and V. Lifschitz. Tight logic programs. TPLP, 3(4-5):499-518, 2003.","title":"Tight logic programs","authors":"E Erdem, V Lifschitz","year":"2003","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Erdem et al., 2016] E. Erdem, M. Gelfond, and N. Leone. Applications of answer set programming. AI Magazine, 37(3):53-68, 2016.","title":"Applications of answer set programming","authors":"E Erdem, M Gelfond, N Leone","year":"2016","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Faber et al., 2012] W. Faber, N. Leone, and S. Perri. The intelligent grounder of DLV. In Correct Reasoning: Es- says on Logic-Based AI in Honour of Vladimir Lifschitz, volume 7265 of LNCS, pages 247-264. Springer, 2012.","title":"The intelligent grounder of DLV","authors":"W Faber, N Leone, S Perri","year":"2012","venue":"Correct Reasoning: Essays on Logic-Based AI in Honour of Vladimir Lifschitz","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Finkel et al., 2001] R. Finkel, V. Marek, N. Moore, and M. Truszczyński. Computing stable models in parallel. In ASP'01, 2001.","title":"Computing stable models in parallel","authors":"R Finkel, V Marek, N Moore, M Truszczyński","year":"2001","venue":"ASP'01","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Gebser et al., 2007] M. Gebser, T. Schaub, and S. Thiele. Gringo : A new grounder for answer set programming. In LPNMR'07, volume 4483 of LNCS, pages 266-271. Springer, 2007.","title":"Gringo : A new grounder for answer set programming","authors":"M Gebser, T Schaub, S Thiele","year":"2007","venue":"LPNMR'07","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Gebser et al., 2008] M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, and S. Thiele. Engineering an incremental ASP solver. In ICLP'08, volume 5366 of LNCS, pages 190-205. Springer-Verlag, 2008.","title":"Engineering an incremental ASP solver","authors":"M Gebser, R Kaminski, B Kaufmann, M Ostrowski, T Schaub, S Thiele","year":"2008","venue":"ICLP'08","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Gebser et al., 2011a] M. Gebser, R. Kaminski, B. Kauf- mann, T. Schaub, M. Schneider, and S. Ziller. A port- folio solver for answer set programming: Preliminary re- port. In LPNMR'11, volume 6645 of LNCS, pages 352- 357. Springer, 2011.","title":"A portfolio solver for answer set programming: Preliminary report","authors":"Gebser","year":"2011","venue":"LPNMR'11","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Gebser et al., 2011b] M. Gebser, R. Kaminski, B. Kauf- mann, T. Schaub, and B. Schnor. Cluster-based ASP solv- ing with claspar. In LPNMR'11, volume 6645 of LNCS, pages 364-369. Springer, 2011.","title":"Cluster-based ASP solving with claspar","authors":"Gebser","year":"2011","venue":"LPNMR'11","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Gebser et al., 2011c] M. Gebser, O. Sabuncu, and T. Schaub. An incremental answer set programming based system for finite model computation. AI Communi- cations, 24(2):195-212, 2011.","title":"An incremental answer set programming based system for finite model computation","authors":"Gebser","year":"2011","venue":"AI Communications","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Gebser et al., 2012a] M. Gebser, B. Kaufmann, and T. Schaub. Conflict-driven answer set solving: From theory to practice. Artif. Intell., 187-188:52-89, 2012.","title":"Conflict-driven answer set solving: From theory to practice","authors":"Gebser","year":"2012","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Gebser et al., 2012b] M. Gebser, B. Kaufmann, and T. Schaub. Multi-threaded ASP solving with clasp. TPLP, 12(4-5):525-545, 2012.","title":"Multi-threaded ASP solving with clasp","authors":"Gebser","year":"2012","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Gebser et al., 2013] M. Gebser, B. Kaufmann, and T. Schaub. Advanced conflict-driven disjunctive answer set solving. In IJCAI'13, pages 912-918. IJCAI/AAAI Press, 2013.","title":"Advanced conflict-driven disjunctive answer set solving","authors":"M Gebser, B Kaufmann, T Schaub","year":"2013","venue":"IJCAI'13","doi":null,"url":null,"internal_url":"/proceedings/2013/140"},{"position":45,"raw":"[Gebser et al., 2014a] M. Gebser, T. Janhunen, and J. Rinta- nen. Answer set programming as SAT modulo acyclic- ity. In ECAI'14, volume 263 of FAIA, pages 351-356. IOS Press, 2014.","title":"Answer set programming as SAT modulo acyclicity","authors":"Gebser","year":"2014","venue":"ECAI'14","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Gebser et al., 2014b] M. Gebser, R. Kaminski, B. Kauf- mann, and T. Schaub. Clingo = ASP + control: Prelim- inary report. In Technical Communications of ICLP'14, volume 14(4-5) of TPLP Online Supplement, 2014.","title":"Clingo = ASP + control: Preliminary report","authors":"Gebser","year":"2014","venue":"Technical Communications of ICLP'14","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Gebser et al., 2015a] M. Gebser, A. Harrison, R. Kaminski, V. Lifschitz, and T. Schaub. Abstract gringo. TPLP, 15(4- 5):449-463, 2015.","title":"Abstract gringo","authors":"Gebser","year":"2015","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Gebser et al., 2015b] M. Gebser, R. Kaminski, B. Kauf- mann, J. Romero, and T. Schaub. Progress in clasp se- ries 3. In LPNMR'15, volume 9345 of LNCS, pages 368- 383. Springer, 2015.","title":"Progress in clasp series 3","authors":"Gebser","year":"2015","venue":"LPNMR'15","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Gebser et al., 2015c] M. Gebser, A. Ryabokon, and G. Schenner. Combining heuristics for configuration problems using answer set programming. In LPNMR'15, volume 9345 of LNCS, pages 384-397. Springer, 2015.","title":"Combining heuristics for configuration problems using answer set programming","authors":"Gebser","year":"2015","venue":"LPNMR'15","doi":null,"url":null,"internal_url":null},{"position":50,"raw":"[Gebser et al., 2016] M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, and P. Wanko. Theory solving made easy with clingo 5. In Technical Communications of ICLP'16, volume 52, pages 2:1-2:15. OASICS, 2016.","title":"Theory solving made easy with clingo 5","authors":"M Gebser, R Kaminski, B Kaufmann, M Ostrowski, T Schaub, P Wanko","year":"2016","venue":"Technical Communications of ICLP'16","doi":null,"url":null,"internal_url":null},{"position":51,"raw":"[Gebser et al., 2017a] M. Gebser, M. Maratea, and F. Ricca. The design of the seventh answer set programming com- petition. In LPNMR 2017, volume 10377 of LNCS, pages 3-9. Springer, 2017.","title":"The design of the seventh answer set programming competition","authors":"Gebser","year":"2017","venue":"LPNMR 2017","doi":null,"url":null,"internal_url":null},{"position":52,"raw":"[Gebser et al., 2017b] M. Gebser, M. Maratea, and F. Ricca. The sixth answer set programming competition. J. Artif. Intell. Res., 60:41-95, 2017.","title":"The sixth answer set programming competition","authors":"Gebser","year":"2017","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":53,"raw":"[Gebser et al., 2017c] M. Gebser, M. Maratea, and F. Ricca. The sixth answer set programming competition. J. Artif. Intell. Res., 60:41-95, 2017.","title":"The sixth answer set programming competition","authors":"Gebser","year":"2017","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":54,"raw":"[Gelfond and Lifschitz, 1991] M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.","title":"Classical negation in logic programs and disjunctive databases","authors":"M Gelfond, V Lifschitz","year":"1991","venue":"New Generation Computing","doi":null,"url":null,"internal_url":null},{"position":55,"raw":"[Giunchiglia et al., 2006] E. Giunchiglia, Y. Lierler, and M. Maratea. Answer set programming based on propo- sitional satisfiability. Journal of Automated Reasoning, 36(4):345-377, 2006.","title":"Answer set programming based on propositional satisfiability","authors":"E Giunchiglia, Y Lierler, M Maratea","year":"2006","venue":"Journal of Automated Reasoning","doi":null,"url":null,"internal_url":null},{"position":56,"raw":"[Gressmann et al., 2006] J. Gressmann, T. Janhunen, R. E. Mercer, T. Schaub, S. Thiele, and R. Tichy. On probing and multi-threading in platypus. In ECAI'06, volume 141 of FAIA, pages 392-396. IOS Press, 2006.","title":"On probing and multi-threading in platypus","authors":"J Gressmann, T Janhunen, R E Mercer, T Schaub, S Thiele, R Tichy","year":"2006","venue":"ECAI'06","doi":null,"url":null,"internal_url":null},{"position":57,"raw":"[Hoos et al., 2014] H. Hoos, M. Lindauer, and T. Schaub. claspfolio 2: Advances in algorithm selection for answer set programming. TPLP, 14(4-5):569-585, 2014.","title":"claspfolio 2: Advances in algorithm selection for answer set programming","authors":"H Hoos, M Lindauer, T Schaub","year":"2014","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":58,"raw":"[Hoos et al., 2015] Holger Hoos, Roland Kaminski, Marius Lindauer, and Torsten Schaub. aspeed: Solver scheduling via answer set programming. TPLP, 15(1):117-142, 2015.","title":"aspeed: Solver scheduling via answer set programming","authors":"Holger Hoos, Roland Kaminski, Marius Lindauer, Torsten Schaub","year":"2015","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":59,"raw":"[Janhunen and Niemelä, 2011] T. Janhunen and I. Niemelä. Compact translations of non-disjunctive answer set pro- grams to propositional clauses. In LP, KR, and NMR, vol- ume 6565 of LNCS, pages 111-130. Springer, 2011.","title":"Compact translations of non-disjunctive answer set programs to propositional clauses","authors":"T Janhunen, I Niemelä","year":"2011","venue":"LNCS","doi":null,"url":null,"internal_url":null},{"position":60,"raw":"[Janhunen et al., 2006] T. Janhunen, I. Niemelä, D. Seipel, P. Simons, and J. You. Unfolding partiality and disjunc- tions in stable model semantics. ACM TOCL, 7(1):1-37, 2006.","title":"Unfolding partiality and disjunctions in stable model semantics","authors":"T Janhunen, I Niemelä, D Seipel, P Simons, J You","year":"2006","venue":"ACM TOCL","doi":null,"url":null,"internal_url":null},{"position":61,"raw":"[Janhunen et al., 2009] T. Janhunen, I. Niemelä, and M. Se- valnev. Computing stable models via reductions to differ- ence logic. In LPNMR'09, volume 5753 of LNCS, pages 142-154. Springer, 2009.","title":"Computing stable models via reductions to difference logic","authors":"T Janhunen, I Niemelä, M Sevalnev","year":"2009","venue":"LPNMR'09","doi":null,"url":null,"internal_url":null},{"position":62,"raw":"[Janhunen, 2006] T. Janhunen. Some (in)translatability re- sults for normal logic programs and propositional theories. J. of Appl. Non-Class. Log., 16(1-2):35-86, 2006.","title":"Some (in)translatability results for normal logic programs and propositional theories","authors":"T Janhunen","year":"2006","venue":"J. of Appl. Non-Class. Log","doi":null,"url":null,"internal_url":null},{"position":63,"raw":"[Kaufmann et al., 2016] B. Kaufmann, N. Leone, S. Perri, and T. Schaub. Grounding and solving in answer set pro- gramming. AI Magazine, 37(3):25-32, 2016.","title":"Grounding and solving in answer set programming","authors":"B Kaufmann, N Leone, S Perri, T Schaub","year":"2016","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":64,"raw":"[Lee and Lifschitz, 2003] J. Lee and V. Lifschitz. Loop for- mulas for disjunctive logic programs. In ICLP'03, volume 2916 of LNCS, pages 451-465. Springer, 2003.","title":"Loop formulas for disjunctive logic programs","authors":"Lifschitz Lee, ] J Lee, V Lifschitz","year":"2003","venue":"ICLP'03","doi":null,"url":null,"internal_url":null},{"position":65,"raw":"[Lee, 2005] J. Lee. A model-theoretic counterpart of loop formulas. In IJCAI'05, pages 503-508. Professional Book Center, 2005.","title":"A model-theoretic counterpart of loop formulas","authors":"J Lee","year":"2005","venue":"IJCAI'05","doi":null,"url":null,"internal_url":"/proceedings/2005/155"},{"position":66,"raw":"[Lefèvre et al., 2017] C. Lefèvre, C. Béatrix, I. Stéphan, and L. Garcia. ASPeRiX, a first-order forward chaining ap- proach for answer set computing. TPLP, 17(3):266-310, 2017.","title":"ASPeRiX, a first-order forward chaining approach for answer set computing","authors":"C Lefèvre, C Béatrix, I Stéphan, L Garcia","year":"2017","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":67,"raw":"[Leone et al., 1997] N. Leone, P. Rullo, and F. Scarcello. Disjunctive stable models: Unfounded sets, fixpoint se- mantics and computation. Information and Computation, 135(2):69-112, 1997.","title":"Disjunctive stable models: Unfounded sets, fixpoint semantics and computation","authors":"N Leone, P Rullo, F Scarcello","year":"1997","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":68,"raw":"[Leone et al., 2006] N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. The DLV system for knowledge representation and reasoning. ACM TOCL, 7(3):499-562, 2006.","title":"The DLV system for knowledge representation and reasoning","authors":"N Leone, G Pfeifer, W Faber, T Eiter, G Gottlob, S Perri, F Scarcello","year":"2006","venue":"ACM TOCL","doi":null,"url":null,"internal_url":null},{"position":69,"raw":"[Lierler et al., 2016] Y. Lierler, M. Maratea, and F. Ricca. Systems, engineering environments, and competitions. AI Magazine, 37(3):45-52, 2016.","title":"Systems, engineering environments, and competitions","authors":"Y Lierler, M Maratea, F Ricca","year":"2016","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":70,"raw":"[Lierler, 2005] Y. Lierler. Disjunctive answer set program- ming via satisfiability. In LPNMR'05, volume 3662 of LNCS, pages 447-451. Springer, 2005.","title":"Disjunctive answer set programming via satisfiability","authors":"Y Lierler","year":"2005","venue":"LPNMR'05","doi":null,"url":null,"internal_url":null},{"position":71,"raw":"[Lierler, 2014] Y. Lierler. Relating constraint answer set pro- gramming languages and algorithms. Artif. Intell., 207:1- 22, 2014.","title":"Relating constraint answer set programming languages and algorithms","authors":"Y Lierler","year":"2014","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":72,"raw":"[Lifschitz and Razborov, 2006] V. Lifschitz and A. Razborov. Why are there so many loop formu- las? ACM TOCL, 7(2):261-268, 2006.","title":"Why are there so many loop formulas?","authors":"V Lifschitz, A Razborov","year":"2006","venue":"ACM TOCL","doi":null,"url":null,"internal_url":null},{"position":73,"raw":"[Lin and Zhao, 2004] F. Lin and Y. Zhao. ASSAT: Comput- ing answer sets of a logic program by SAT solvers. Artif. Intell., 157(1-2):115-137, 2004.","title":"ASSAT: Computing answer sets of a logic program by SAT solvers","authors":"F Lin, Y Zhao","year":"2004","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":74,"raw":"[Liu et al., 2012] G. Liu, T. Janhunen, and I. Niemelä. An- swer set programming via mixed integer programming. In KR'12, pages 32-42. AAAI Press, 2012.","title":"Answer set programming via mixed integer programming","authors":"G Liu, T Janhunen, I Niemelä","year":"2012","venue":"KR'12","doi":null,"url":null,"internal_url":null},{"position":75,"raw":"[Maratea et al., 2008] M. Maratea, F. Ricca, W. Faber, and Nicola Leone. Look-back techniques and heuristics in DLV: Implementation, evaluation and comparison to QBF solvers. J. of Algor., 63(1-3):70-89, 2008.","title":"Look-back techniques and heuristics in DLV: Implementation, evaluation and comparison to QBF solvers","authors":"M Maratea, F Ricca, W Faber, Nicola Leone","year":"2008","venue":"J. of Algor","doi":null,"url":null,"internal_url":null},{"position":76,"raw":"[Maratea et al., 2013] M. Maratea, L. Pulina, and F. Ricca. Automated selection of grounding algorithm in answer set programming. In AI*IA'13, volume 8249 of LNCS, pages 73-84. Springer, 2013.","title":"Automated selection of grounding algorithm in answer set programming","authors":"M Maratea, L Pulina, F Ricca","year":"2013","venue":"AI*IA'13","doi":null,"url":null,"internal_url":null},{"position":77,"raw":"[Maratea et al., 2014] M. Maratea, L. Pulina, and F. Ricca. A multi-engine approach to answer-set programming. TPLP, 14(6):841-868, 2014.","title":"A multi-engine approach to answer-set programming","authors":"M Maratea, L Pulina, F Ricca","year":"2014","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":78,"raw":"[Maratea et al., 2015a] M. Maratea, L. Pulina, and F. Ricca. Multi-engine ASP solving with policy adaptation. Journal of Logic and Computation, 25(6):1285-1306, 2015.","title":"Multi-engine ASP solving with policy adaptation","authors":"Maratea","year":"2015","venue":"Journal of Logic and Computation","doi":null,"url":null,"internal_url":null},{"position":79,"raw":"[Maratea et al., 2015b] M. Maratea, L. Pulina, and F. Ricca. Multi-level algorithm selection for ASP. In LPNMR'15, volume 9345 of LNCS, pages 439-445. Springer, 2015.","title":"Multi-level algorithm selection for ASP","authors":"Maratea","year":"2015","venue":"LPNMR'15","doi":null,"url":null,"internal_url":null},{"position":80,"raw":"[Mariën et al., 2008] M. Mariën, J. Wittocx, M. Denecker, and M. Bruynooghe. SAT(ID): Satisfiability of proposi- tional logic extended with inductive definitions. In SAT'08, volume 4996 of LNCS, pages 211-224. Springer, 2008.","title":"SAT(ID): Satisfiability of propositional logic extended with inductive definitions","authors":"M Mariën, J Wittocx, M Denecker, M Bruynooghe","year":"2008","venue":"SAT'08","doi":null,"url":null,"internal_url":null},{"position":81,"raw":"[Marques-Silva and Sakallah, 1999] J. Marques-Silva and K. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Trans on Comp., 48(5):506-521, 1999.","title":"GRASP: A search algorithm for propositional satisfiability","authors":"J Marques-Silva, K Sakallah","year":"1999","venue":"IEEE Trans on Comp","doi":null,"url":null,"internal_url":null},{"position":82,"raw":"[Nguyen et al., 2011] M. Nguyen, T. Janhunen, and I. Niemelä. Translating answer-set programs into bit- vector logic. In INAP'11 and WLP'11, volume 7773 of LNCS, pages 95-113. Springer, 2011.","title":"Translating answer-set programs into bitvector logic","authors":"M Nguyen, T Janhunen, I Niemelä","year":"2011","venue":"INAP'11 and WLP'11","doi":null,"url":null,"internal_url":null},{"position":83,"raw":"[Niemelä, 2008] I. Niemelä. Stable models and difference logic. AMAI, 53(1-4):313-329, 2008.","title":"Stable models and difference logic","authors":"; I Niemelä, Niemelä","year":"2008","venue":"AMAI","doi":null,"url":null,"internal_url":null},{"position":84,"raw":"[Perri et al., 2013] S. Perri, F. Ricca, and M. Sirianni. Paral- lel instantiation of ASP programs: Techniques and experi- ments. TPLP, 13(2):253-278, 2013.","title":"Parallel instantiation of ASP programs: Techniques and experiments","authors":"S Perri, F Ricca, M Sirianni","year":"2013","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":85,"raw":"[Pontelli et al., 2003] E. Pontelli, M. Balduccini, and F. Bermudez. Non-monotonic reasoning on Beowulf platforms. In PADL'03, volume 2562 of LNCS, pages 37-57. Springer, 2003.","title":"Non-monotonic reasoning on Beowulf platforms","authors":"E Pontelli, M Balduccini, F Bermudez","year":"2003","venue":"PADL'03","doi":null,"url":null,"internal_url":null},{"position":86,"raw":"[Prosser, 1993] P. Prosser. Hybrid algorithms for the con- straint satisfaction problem. Computational Intelligence, 9:268-299, 1993.","title":"Hybrid algorithms for the constraint satisfaction problem","authors":"P Prosser","year":"1993","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":87,"raw":"[Pulina and Tacchella, 2009] L. Pulina and A. Tacchella. A self-adaptive multi-engine solver for quantified Boolean formulas. Constraints, 14(1):80-116, 2009.","title":"A self-adaptive multi-engine solver for quantified Boolean formulas","authors":"L Pulina, A Tacchella","year":"2009","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":88,"raw":"[Ricca et al., 2006] F Ricca, W. Faber, and N. Leone. A backjumping technique for disjunctive logic program- ming. AI Communications, 19(2):155-172, 2006.","title":"A backjumping technique for disjunctive logic programming","authors":"W Ricca, N Faber, Leone","year":"2006","venue":"AI Communications","doi":null,"url":null,"internal_url":null},{"position":89,"raw":"[Rice, 1976] J. Rice. The algorithm selection problem. Ad- vances in Computers, 15:65-118, 1976.","title":"The algorithm selection problem","authors":"J Rice","year":"1976","venue":"Advances in Computers","doi":null,"url":null,"internal_url":null},{"position":90,"raw":"[SAT, 2009] Handbook of Satisfiability, volume 185 of FAIA. IOS Press, 2009.","title":"Handbook of Satisfiability","authors":"Sat","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":91,"raw":"[Simons et al., 2002] P. Simons, I. Niemelä, and T. Soininen. Extending and implementing the stable model semantics. Artif. Intell., 138(1-2):181-234, 2002.","title":"Extending and implementing the stable model semantics","authors":"P Simons, I Niemelä, T Soininen","year":"2002","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":92,"raw":"[Susman and Lierler, 2016] B. Susman and Y. Lierler. Smt- based constraint answer set solver EZSMT (system de- scription). In ICLP (Technical Communications), vol- ume 52 of OASICS, pages 1:1-1:15. SD, 2016.","title":"Smtbased constraint answer set solver EZSMT (system description)","authors":"B Susman, Y Lierler","year":"2016","venue":"ICLP (Technical Communications)","doi":null,"url":null,"internal_url":null},{"position":93,"raw":"[Syrjänen, 2001] T. Syrjänen. Omega-restricted logic pro- grams. In LPNMR'01, volume 2173 of LNCS, pages 267- 279. Springer, 2001.","title":"Omega-restricted logic programs","authors":"T Syrjänen","year":"2001","venue":"LPNMR'01","doi":null,"url":null,"internal_url":null},{"position":94,"raw":"[Ullman, 1988] J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press, 1988.","title":"Principles of Database and Knowledge-Base Systems","authors":"J D Ullman","year":"1988","venue":null,"doi":null,"url":null,"internal_url":null},{"position":95,"raw":"[Van Gelder et al., 1991] A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. JACM, 38(3):620-650, 1991.","title":"The well-founded semantics for general logic programs","authors":"Van Gelder","year":"1991","venue":"JACM","doi":null,"url":null,"internal_url":null},{"position":96,"raw":"[Ward and Schlipf, 2004] J. Ward and J. Schlipf. Answer set programming with clause learning. In LPNMR'04, volume 2923 of LNCS, pages 302-313. Springer, 2004.","title":"Answer set programming with clause learning","authors":"J Ward, J Schlipf","year":"2004","venue":"LPNMR'04","doi":null,"url":null,"internal_url":null},{"position":97,"raw":"[Weinzierl, 2017] A. Weinzierl. Blending lazy-grounding and CDNL search for answer-set solving. In LPNMR 2017, pages 191-204, 2017.","title":"Blending lazy-grounding and CDNL search for answer-set solving","authors":"A Weinzierl","year":"2017","venue":"LPNMR 2017","doi":null,"url":null,"internal_url":null},{"position":98,"raw":"[Wittocx et al., 2008] J. Wittocx, M. Mariën, and M. De- necker. GidL: A grounder for FO+. In NMR'08, pages 189-198, 2008.","title":"GidL: A grounder for FO+","authors":"J Wittocx, M Mariën, M Denecker","year":"2008","venue":"NMR'08","doi":null,"url":null,"internal_url":null},{"position":99,"raw":"[Zhang et al., 1996] H. Zhang, M. Bonacina, and J. Hsiang. PSATO: A distributed propositional prover and its appli- cation to quasigroup problems. Journal of Symbolic Com- putation, 21(4):543-560, 1996.","title":"PSATO: A distributed propositional prover and its application to quasigroup problems","authors":"H Zhang, M Bonacina, J Hsiang","year":"1996","venue":"Journal of Symbolic Computation","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}