{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T11:37:51Z","timestamp":1769600271268,"version":"3.49.0"},"reference-count":105,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Constraint answer set programming or CASP, for short, is a hybrid approach in automated reasoning putting together the advances of distinct research areas such as answer set programming, constraint processing, and satisfiability modulo theories. CASP demonstrates promising results, including the development of a multitude of solvers: <jats:sc>acsolver, clingcon, ezcsp, idp, inca, dingo, mingo, aspmt2smt, clingo[l,dl], and ezsmt<\/jats:sc>. It opens new horizons for declarative programming applications such as solving complex train scheduling problems. Systems designed to find solutions to constraint answer set programs can be grouped according to their construction into, what we call, <jats:italic>integrational or translational<\/jats:italic> approaches. The focus of this paper is an overview of the key ingredients of the design of constraint answer set solvers drawing distinctions and parallels between integrational and translational approaches. The paper also provides a glimpse at the kind of programs its users develop by utilizing a CASP encoding of Traveling Salesman problem for illustration. In addition, we place the CASP technology on the map among its automated reasoning peers as well as discuss future possibilities for the development of CASP.<\/jats:p>","DOI":"10.1017\/s1471068421000478","type":"journal-article","created":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T09:10:38Z","timestamp":1635844238000},"page":"195-225","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":8,"title":["Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches"],"prefix":"10.1017","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6146-623X","authenticated-orcid":false,"given":"YULIYA","family":"LIERLER","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2021,11,2]]},"reference":[{"key":"S1471068421000478_ref37","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000220"},{"key":"S1471068421000478_ref65","doi-asserted-by":"publisher","DOI":"10.1145\/35043.35046"},{"key":"S1471068421000478_ref42","doi-asserted-by":"publisher","DOI":"10.1007\/b94792"},{"key":"S1471068421000478_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000187"},{"key":"S1471068421000478_ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-010-9135-7"},{"key":"S1471068421000478_ref20","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2016-1398"},{"key":"S1471068421000478_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.09.008"},{"key":"S1471068421000478_ref54","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Schaub, T. and Thiele, S. 2007. Gringo: a new grounder for answer set programming. In Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning, 266\u2013271.","DOI":"10.1007\/978-3-540-72200-7_24"},{"key":"S1471068421000478_ref62","doi-asserted-by":"crossref","unstructured":"Janhunen, T. , Niemel\u00e4, I. and Sevalnev, M. 2009. Computing stable models via reductions to difference logic. In Logic Programming and Nonmonotonic Reasoning. Springer, Berlin, Heidelberg, 142\u2013154.","DOI":"10.1007\/978-3-642-04238-6_14"},{"key":"S1471068421000478_ref3","doi-asserted-by":"crossref","unstructured":"Balduccini, M. 2011. Industrial-size scheduling with ASP+cp. In Logic Programming and Nonmonotonic Reasoning - 11th International Conference (LPNMR). Lecture Notes in Computer Science, vol. 6645. Springer-Verlag, 284\u2013296.","DOI":"10.1007\/978-3-642-20895-9_33"},{"key":"S1471068421000478_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-007-9076-z"},{"key":"S1471068421000478_ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068421000478_ref78","unstructured":"Liu, G. , Janhunen, T. and Niemel\u00e4, I. 2012. Answer set programming via mixed integer programming. In Principles of Knowledge Representation and Reasoning: Proceedings of the 13th International Conference. AAAI Press, 32\u201342."},{"key":"S1471068421000478_ref69","doi-asserted-by":"crossref","unstructured":"Lierler, Y. 2014. Relating constraint answer set programming languages and algorithms. Artificial Intelligence 207C, 1\u201322.","DOI":"10.1016\/j.artint.2013.10.004"},{"key":"S1471068421000478_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_14"},{"key":"S1471068421000478_ref99","unstructured":"Susman, B. and Lierler, Y. 2016. SMT-based constraint answer set solver EZSMT (system description). In Proceedings of 32th International Conference on Logic Programming (ICLP). Dagstuhl Publishing, OpenAccess Series in Informatics (OASIcs)."},{"key":"S1471068421000478_ref82","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"S1471068421000478_ref71","doi-asserted-by":"crossref","unstructured":"Lierler, Y. , Smith, S. , Truszczy\u0144ski, M. and Westlund, A. 2012. Weighted-sequence problem: ASP vs cASP and declarative vs problem oriented solving. In Proceedings of the 14th International Symposium on Practical Aspects of Declarative Languages, PADL 2012, Russo, C. V. and Zhou, N.-F. , Eds. Lecture Notes in Computer Science, vol. 7149. Springer-Verlag, 63\u201377.","DOI":"10.1007\/978-3-642-27694-1_6"},{"key":"S1471068421000478_ref73","doi-asserted-by":"crossref","unstructured":"Lierler, Y. and Truszczy\u0144ski, M. 2011. Transition systems for model generators \u2014 a unifying approach. In Theory and Practice of Logic Programming, 27th Int\u2019l. Conference on Logic Programming (ICLP) Special Issue 11, 4\u20135, 629\u2013646.","DOI":"10.1017\/S1471068411000214"},{"key":"S1471068421000478_ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000265"},{"key":"S1471068421000478_ref92","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841100007X"},{"key":"S1471068421000478_ref16","unstructured":"Bartholomew, M. and Lee, J. 2013. Functional stable model semantics and answer set programming modulo theories. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI). 718\u2013\u2013724."},{"key":"S1471068421000478_ref13","first-page":"737","volume-title":"Handbook of Satisfiability","author":"Barrett","year":"2008"},{"key":"S1471068421000478_ref18","unstructured":"Biavaschi, S. 2017. Automated reasoning methods in hybrid systems. Annual Report of \u201cScuola Superiore dell\u2019Universit\u00e0 di Udine\u201d."},{"key":"S1471068421000478_ref83","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9118-9"},{"key":"S1471068421000478_ref21","first-page":"33:1","article-title":"Applying visible strong equivalence in answer-set program transformations","volume":"21","author":"Bomanson","year":"2020","journal-title":"Transactions on Computational Logic"},{"key":"S1471068421000478_ref17","doi-asserted-by":"crossref","unstructured":"Bartholomew, M. and Lee, J. 2014. System aspmt2smt: computing ASPMT theories by SMT solvers. In Logics in Artificial Intelligence: 14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, 24\u201326 September 2014. Proceedings. Springer International Publishing, Cham, 529\u2013542.","DOI":"10.1007\/978-3-319-11558-0_37"},{"key":"S1471068421000478_ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02846-5_23"},{"key":"S1471068421000478_ref76","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018978005636"},{"key":"S1471068421000478_ref105","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000445"},{"key":"S1471068421000478_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(03)58003-2"},{"key":"S1471068421000478_ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2008.50"},{"key":"S1471068421000478_ref34","doi-asserted-by":"crossref","unstructured":"De Moura, L. and Bj\u00f8rner, N. 2008. Z3: an efficient SMT solver. In Proceedings of the Theory and Practice of Software, 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 337\u2013340.","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"S1471068421000478_ref61","unstructured":"Janhunen, T. , Liu, G. and Niemel\u00e4, I. 2011. Tight integration of non-ground answer set programming and satisfiability modulo theories. In Working notes of the 1st Workshop on Grounding and Transformations for Theories with Variables."},{"key":"S1471068421000478_ref36","doi-asserted-by":"publisher","DOI":"10.1080\/09528130701538174"},{"key":"S1471068421000478_ref86","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217859"},{"key":"S1471068421000478_ref63","unstructured":"Kautz, H. and Selman, B. 1992. Planning as satisfiability. In Proceedings of European Conference on Artificial Intelligence (ECAI), 359\u2013363."},{"key":"S1471068421000478_ref52","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000019"},{"key":"S1471068421000478_ref93","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.08.001"},{"key":"S1471068421000478_ref79","volume-title":"The Logic Programming Paradigm: A 25-Year Perspective","author":"Marek","year":"1999"},{"key":"S1471068421000478_ref12","unstructured":"Barrett, C. , Fontaine, P. and Tinelli, C. 2015. The SMT-LIB Standard: version 2.5. Tech. rep., Department of Computer Science, The University of Iowa. Available at www.SMT-LIB.org."},{"key":"S1471068421000478_ref28","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000450"},{"key":"S1471068421000478_ref45","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001923"},{"key":"S1471068421000478_ref87","unstructured":"Nudelman, E. , Devkar, A. , Shoham, Y. , Leyton-Brown, K. and Hoos, H. 2004. SATzilla: an algorithm portfolio for SAT. In SAT Competition."},{"key":"S1471068421000478_ref75","first-page":"961","article-title":"Achievements in answer set programming","volume":"17","author":"Lifschitz","year":"2017","journal-title":"TPLP"},{"key":"S1471068421000478_ref40","unstructured":"Eiter, T. , Ianni, G. , Schindlauer, R. and Tompits, H. 2005. A uniform integration of higher-order reasoning and external evaluations in answer set programming. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI). Professional Book Center, 90\u201396."},{"key":"S1471068421000478_ref44","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000344"},{"key":"S1471068421000478_ref47","unstructured":"Gebser, M. , Kaminski, R. , Kaufmann, B. , Ostrowski, M. , Schaub, T. and Wanko, P. 2016. Theory solving made easy with Clingo 5. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016), Carro, M. , King, A. , Saeedloei, N. and Vos, M. D. , Eds. OpenAccess Series in Informatics (OASIcs), vol. 52. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2:1\u20132:15."},{"key":"S1471068421000478_ref15","unstructured":"Bartholomew, M. 2016. Answer Set Programming Modulo Theories. Ph.D. thesis, Arizona State University."},{"key":"S1471068421000478_ref6","unstructured":"Balduccini, M. , Gelfond, M. , Nogueira, M. , Watson, R. and Barry, M. 2001. An A-Prolog decision support system for the Space Shuttle. In Working Notes of the AAAI Spring Symposium on Answer Set Programming."},{"key":"S1471068421000478_ref41","doi-asserted-by":"crossref","unstructured":"Elkabani, I. , Pontelli, E. and Son, T. C. 2004. Smodels with clp and its applications: a simple and effective approach to aggregates in ASP. In ICLP, Demoen, B. and Lifschitz, V. , Eds. Lecture Notes in Computer Science, vol. 3132. Springer-Verlag, 73\u201389.","DOI":"10.1007\/978-3-540-27775-0_6"},{"key":"S1471068421000478_ref66","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Lawler","year":"1985"},{"key":"S1471068421000478_ref85","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_33"},{"key":"S1471068421000478_ref64","unstructured":"Kowalski, R. A. 1974. Predicate logic as programming language. In Proceedings of International Federation of Information Processing Conference, J. L. Rosenfeld, Ed. North\u2013Holland, Stockholm, Sweden, 569\u2013574."},{"key":"S1471068421000478_ref38","unstructured":"Drescher, C. and Walsh, T. 2011. Translation-based constraint answer set solving. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI). AAAI Press, 2596\u20132601."},{"key":"S1471068421000478_ref43","first-page":"51","article-title":"Consistency of Clark\u2019s completion and existence of stable models","volume":"1","author":"Fages","year":"1994","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"S1471068421000478_ref67","unstructured":"Lee, J. and Meng, Y. 2013. Answer set programming modulo theories and reasoning about continuous changes. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI-13), Beijing, China, 3\u20139 August 2013."},{"key":"S1471068421000478_ref84","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I. and Simons, P. 2000. Extending the Smodels system with cardinality and weight constraints. In Logic-Based Artificial Intelligence, J. Minker, Ed. Kluwer, 491\u2013521.","DOI":"10.1007\/978-1-4615-1567-8_21"},{"key":"S1471068421000478_ref2","unstructured":"Andres, B. , Kaufmann, B. , Matheis, O. and Schaub, T. 2012. Unsatisfiability-based optimization in clasp. In Technical Communications of the 28th International Conference on Logic Programming (ICLP\u201912), Dovier, A. and Costa, V. S. , Eds. Leibniz International Proceedings in Informatics (LIPIcs), vol. 17. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 211\u2013221."},{"key":"S1471068421000478_ref5","unstructured":"Balduccini, M. and Gelfond, M. 2005. Model-based reasoning for complex flight systems. In Proceedings of Infotech@Aerospace (American Institute of Aeronautics and Astronautics)."},{"key":"S1471068421000478_ref95","unstructured":"Rosis, A. F. D. , Eiter, T. , Redl, C. and Ricca, F. 2015. Constraint answer set programming based on hex-programs. In Eighth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2015), Cork, Ireland."},{"key":"S1471068421000478_ref59","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.16.35-86"},{"key":"S1471068421000478_ref98","unstructured":"Shen, D. and Lierler, Y. 2018b. SMT-based constraint answer set solver EZSMT+ for non-tight programs. In Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR)."},{"key":"S1471068421000478_ref100","unstructured":"Tinelli, C. and Barrett, C. 2015. AUFLIRA. http:\/\/smtlib.cs.uiowa.edu\/logics-all.shtml#AUFLIRA. [Accessed: 2018]."},{"key":"S1471068421000478_ref35","unstructured":"Denecker, M. , Lierler, Y. , Truszczynski, M. and Vennekens, J. 2019. The informal semantics of answer set programming: a Tarskian perspective. arXiv:1901.09125."},{"key":"S1471068421000478_ref102","unstructured":"Wintersteiger, C. M. , Bj\u00f8rner, N. and de Moura, L. 2016. Z3. URL: https:\/\/github.com\/Z3Prover\/z3\/releases\/tag\/z3-4.5.0. [Accessed: 2018]."},{"key":"S1471068421000478_ref60","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000242"},{"key":"S1471068421000478_ref22","unstructured":"Brain, M. , Erdem, E. , Inoue, K. , Oetsch, J. , Puehrer, J. , Tompits, H. and Yilmaz, C. 2012. Event-sequence testing using answer-set programming. International Journal on Advances in Software 5, 3&4."},{"key":"S1471068421000478_ref80","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9116-y"},{"key":"S1471068421000478_ref14","volume-title":"Handbook of Model Checking","author":"Barrett","year":"2014"},{"key":"S1471068421000478_ref89","first-page":"2004","article-title":"Constraint logic programming approach to protein structure prediction","volume":"5","author":"Pal\u00f9","year":"2004","journal-title":"BMC Bioinformatics"},{"key":"S1471068421000478_ref49","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Kaminski, R. , K\u00f6nig, A. and Schaub, T. 2011. Advances in gringo series 3. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). Springer, 345\u2013351.","DOI":"10.1007\/978-3-642-20895-9_39"},{"key":"S1471068421000478_ref94","unstructured":"Robinson, N. , Gretton, C. , Pham, D.-N. and Sattar, A. 2010. Cost-optimal planning using weighted MaxSAT. In ICAPS 2010 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling (COPLAS10)."},{"key":"S1471068421000478_ref39","unstructured":"Dutertre, B. 2017. yices. URL: http:\/\/yices.csl.sri.com\/. [Accessed: 2018]."},{"key":"S1471068421000478_ref57","unstructured":"IBM 2009. IBM ILOG AMPL Version 12.1 User\u2019s Guide. IBM. URL: http:\/\/www.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/."},{"key":"S1471068421000478_ref74","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00186-8"},{"key":"S1471068421000478_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000138"},{"key":"S1471068421000478_ref32","author":"Clark","year":"1978"},{"key":"S1471068421000478_ref104","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000187"},{"key":"S1471068421000478_ref9","author":"Banbara","year":"2015"},{"key":"S1471068421000478_ref72","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000114"},{"key":"S1471068421000478_ref70","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-016-9257-7"},{"key":"S1471068421000478_ref56","doi-asserted-by":"publisher","DOI":"10.1007\/b101971"},{"key":"S1471068421000478_ref27","doi-asserted-by":"crossref","unstructured":"Calimeri, F. , Cozza, S. , Ianni, G. and Leone, N. 2008. Computable functions in ASP: theory and implementation. In Proceedings of International Conference on Logic Programming (ICLP), 407\u2013424.","DOI":"10.1007\/978-3-540-89982-2_37"},{"key":"S1471068421000478_ref51","doi-asserted-by":"crossref","unstructured":"Gebser, M. , K\u00f6nig, A. , Schaub, T. , Thiele, S. and Veber, P. 2010. The bioASP library: ASP solutions for systems biology. In 22nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2010. IEEE Computer Society, 383\u2013389.","DOI":"10.1109\/ICTAI.2010.62"},{"key":"S1471068421000478_ref58","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"S1471068421000478_ref101","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000494"},{"key":"S1471068421000478_ref88","unstructured":"Ostrowski, M. 2018. Modern Constraint Answer Set Solving. Ph.D. thesis, University of Potsdam."},{"key":"S1471068421000478_ref81","doi-asserted-by":"crossref","unstructured":"Nethercote, N. , Stuckey, P. , Becket, R. , Brand, S. , Duck, G. and Tack, G. 2007. MiniZinc: towards a standard cp modelling language. In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, 529\u2013543.","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"S1471068421000478_ref77","unstructured":"Lin, F. and Wang, Y. 2008. Answer set programming with functions. In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), 454\u2013465."},{"key":"S1471068421000478_ref31","unstructured":"Carlsson, M. and Fruehwirth, T. 2014. SICStus PROLOG User\u2019s Manual 4.3. Books On Demand - Proquest."},{"key":"S1471068421000478_ref50","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Kaufmann, B. , Neumann, A. and Schaub, T. 2007. Conflict-driven answer set enumeration. In Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning. LPNMR\u201907. Springer-Verlag, Berlin, Heidelberg, 136\u2013148.","DOI":"10.1007\/978-3-540-72200-7_13"},{"key":"S1471068421000478_ref55","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(07)03002-7"},{"key":"S1471068421000478_ref24","author":"Bromberger","year":"2015"},{"key":"S1471068421000478_ref97","unstructured":"Shen, D. and Lierler, Y. 2018a. SMT-based answer set solver CMODELS-DIFF (system description). In Proceedings of the 34th International Conference on Logic Programming (ICLP)."},{"key":"S1471068421000478_ref103","unstructured":"Wittocx, J. , Mari\u00ebn, M. and Denecker, M. 2008. The idp system: a model expansion system for an extension of classical logic. In Proceedings of Workshop on Logic and Search, Computation of Structures from Declarative Descriptions (LaSh). electronic, 153\u2013165. URL: https:\/\/lirias.kuleuven.be\/bitstream\/123456789\/229814\/1\/lash08.pdf."},{"key":"S1471068421000478_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000102"},{"key":"S1471068421000478_ref96","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(07)03004-0"},{"key":"S1471068421000478_ref1","doi-asserted-by":"crossref","unstructured":"Abels, D. , Jordi, J. , Ostrowski, M. , Schaub, T. , Toletti, A. and Wanko, P. 2019. Train scheduling with hybrid ASP. In Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Philadelphia, PA, USA, 3\u20137 June 2019, Proceedings, Balduccini, M. , Lierler, Y. and Woltran, S. , Eds. Lecture Notes in Computer Science, vol. 11481. Springer, 3\u201317.","DOI":"10.1007\/978-3-030-20528-7_1"},{"key":"S1471068421000478_ref30","doi-asserted-by":"crossref","unstructured":"Calimeri, F. , Ianni, G. , Ricca, F. , Alviano, M. , Bria, A. , Catalano, G. , Cozza, S. , Faber, W. , Febbraro, O. , Leone, N. , Manna, M. , Martello, A. , Panetta, C. , Perri, S. , Reale, K. , Santoro, M. C. , Sirianni, M. , Terracina, G. and Veltri, P. 2011. The third answer set programming competition: preliminary report of the system competition track. In Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). Springer-Verlag, Berlin, Heidelberg, 388\u2013403.","DOI":"10.1007\/978-3-642-20895-9_46"},{"key":"S1471068421000478_ref68","unstructured":"Lierler, Y. 2010. SAT-based Answer Set Programming. Ph.D. thesis, University of Texas at Austin."},{"key":"S1471068421000478_ref91","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-004-0183-4"},{"key":"S1471068421000478_ref53","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Ostrowski, M. and Schaub, T. 2009. Constraint answer set solving. In Proceedings of 25th International Conference on Logic Programming (ICLP). Springer-Verlag, 235\u2013249.","DOI":"10.1007\/978-3-642-02846-5_22"},{"key":"S1471068421000478_ref90","doi-asserted-by":"publisher","DOI":"10.1504\/IJDMB.2010.030964"},{"key":"S1471068421000478_ref4","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000343"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068421000478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T10:27:11Z","timestamp":1671013631000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068421000478\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,2]]},"references-count":105,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["S1471068421000478"],"URL":"https:\/\/doi.org\/10.1017\/s1471068421000478","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,2]]},"assertion":[{"value":"\u00a9 The Author(s), 2021. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}