{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T01:31:55Z","timestamp":1785202315624,"version":"3.55.0"},"reference-count":102,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2012,9,6]],"date-time":"2012-09-06T00:00:00Z","timestamp":1346889600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2014,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Answer Set Programming (ASP) is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL and many others. Since its first informal editions, ASP systems have been compared in the now well-established ASP Competition. The Third (Open) ASP Competition, as the sequel to the ASP Competitions Series held at the University of Potsdam in Germany (2006\u20132007) and at the University of Leuven in Belgium in 2009, took place at the University of Calabria (Italy) in the first half of 2011. Participants competed on a pre-selected collection of benchmark problems, taken from a variety of domains as well as real world applications. The Competition ran on two tracks: the Model and Solve (M&amp;S) Track, based on an open problem encoding, and open language, and open to any kind of system based on a declarative specification paradigm; and the System Track, run on the basis of fixed, public problem encodings, written in a standard ASP language. This paper discusses the format of the competition and the rationale behind it, then reports the results for both tracks. Comparison with the second ASP competition and state-of-the-art solutions for some of the benchmark domains is eventually discussed.<\/jats:p>","DOI":"10.1017\/s1471068412000105","type":"journal-article","created":{"date-parts":[[2012,9,6]],"date-time":"2012-09-06T12:50:32Z","timestamp":1346935832000},"page":"117-135","source":"Crossref","is-referenced-by-count":26,"title":["The third open answer set programming competition"],"prefix":"10.1017","volume":"14","author":[{"given":"FRANCESCO","family":"CALIMERI","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"GIOVAMBATTISTA","family":"IANNI","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"FRANCESCO","family":"RICCA","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2012,9,6]]},"reference":[{"key":"S1471068412000105_ref99","unstructured":"Xu K. since 2004. BHOSLIB: Benchmarks with hidden optimum solutions for graph problems. http:\/\/www.nlsde.buaa.edu.cn\/~kexu\/benchmarks\/graph-benchmarks.htm."},{"key":"S1471068412000105_ref37","first-page":"51","article-title":"Consistency of Clark's completion and existence of stable models","volume":"1","author":"Fages","year":"1994","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"S1471068412000105_ref91","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3233\/FI-2010-357","article-title":"A logic-based system for e-Tourism","volume":"105","author":"Ricca","year":"2010","journal-title":"FI"},{"key":"S1471068412000105_ref21","doi-asserted-by":"publisher","DOI":"10.1145\/227595.227597"},{"key":"S1471068412000105_ref6","unstructured":"Balduccini M. , Gelfond M. , Watson R. and Nogeira M. 2001. The USA-Advisor: A case study in answer set planning. In LPNMR 2001. LNCS 2173, 439\u2013442."},{"key":"S1471068412000105_ref20","unstructured":"Calimeri F. , Ianni G. , Ricca F. et al. 2011. The third answer set programming competition: Preliminary report of the system competition track. In LPNMR 2011. LNCS 6645, 388\u2013403."},{"key":"S1471068412000105_ref59","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"Gusfield","year":"1989"},{"key":"S1471068412000105_ref13","first-page":"421","article-title":"Reasoning with minimal models: Efficient algorithms and applications","volume":"96","author":"Ben-Eliyahu-Zohary","year":"1997","journal-title":"AI"},{"key":"S1471068412000105_ref93","unstructured":"smt-lib-web . 2011. The satisfiability modulo theories library. http:\/\/www.smtlib.org\/."},{"key":"S1471068412000105_ref69","unstructured":"J\u00fcnger M. , Lee E. K. , Mutzel P. and Odenthal T. 1997. A polyhedral approach to the multi-layer crossing minimization problem. In International Symposium on Graph Drawing. LNCS 1353, 13\u201324."},{"key":"S1471068412000105_ref64","doi-asserted-by":"crossref","unstructured":"Jaffar J. and Lassez J. 1987. Constraint logic programming. In POPL 1987. 111\u2013119.","DOI":"10.1145\/41625.41635"},{"key":"S1471068412000105_ref42","unstructured":"Friedrich G. and Ivanchenko V. 2008. Diagnosis from First Principles for Workflow Executions. Technical rep. ISBI research group, Alpen-Adria-Universit\u00e4t Klagenfurt. http:\/\/proserver3-iwas.uni-klu.ac.at\/download_area\/Technical-Reports\/technical_report_2008_02.pdf."},{"key":"S1471068412000105_ref5","unstructured":"Balduccini M. 2009c. Representing constraint satisfaction problems in answer set programming. In ASPOCP Workshop at ICLP 2009."},{"key":"S1471068412000105_ref58","volume-title":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning","author":"Grasso","year":"2010"},{"key":"S1471068412000105_ref65","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.16.35-86"},{"key":"S1471068412000105_ref97","unstructured":"Wittocx J. , Mari\u00ebn M. and Denecker M. 2008. The idp system: A model expansion system for an extension of classical logic. In Logic and Search (LaSh 2008). 153\u2013165."},{"key":"S1471068412000105_ref96","unstructured":"Wittocx J. , Mari\u00ebn M. and Denecker M. 2008. GidL: A grounder for FO+. In NMR 2008."},{"key":"S1471068412000105_ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1342991.1342998"},{"key":"S1471068412000105_ref94","first-page":"362","article-title":"WFS + Branch and Bound = Stable Models","volume":"7","author":"Subrahmanian","year":"1995","journal-title":"IEEE TKDE"},{"key":"S1471068412000105_ref84","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217859"},{"key":"S1471068412000105_ref30","doi-asserted-by":"crossref","first-page":"113","DOI":"10.3233\/IA-2011-0013","article-title":"Recent constraint\/logic programming based advances in the solution of the protein folding problem","volume":"5","author":"Dovier","year":"2011","journal-title":"Intelligenza Artificiale"},{"key":"S1471068412000105_ref87","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"S1471068412000105_ref18","doi-asserted-by":"crossref","unstructured":"Calimeri F. , Ianni G. , Ricca F. et al. 2010. The third answer set programming competition homepage. http:\/\/www.mat.unical.it\/aspcomp2011\/.","DOI":"10.1609\/aimag.v33i4.2448"},{"key":"S1471068412000105_ref53","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068412000105_ref33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","article-title":"Translating Pseudo-Boolean constraints into sat","volume":"2","author":"E\u00e9n","year":"2006","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"S1471068412000105_ref38","unstructured":"Falkner A. , Haselb\u00f6ck A. and Schenner G. 2010. Modeling technical product configuration problems. In ECAI 2010 Workshop on Configuration. 40\u201346."},{"key":"S1471068412000105_ref17","first-page":"448","article-title":"Default logic as a query language","volume":"9","author":"Cadoli","year":"1997","journal-title":"IEEE TKDE"},{"key":"S1471068412000105_ref72","unstructured":"Lef\u00e8vre C. and Nicolas P. 2009b. The first version of a new asp solver: Asperix. In LPNMR 2009. LNCS 5753, 522\u2013527."},{"key":"S1471068412000105_ref60","first-page":"389","volume-title":"Handbook of Graph Theory","author":"Gutin","year":"2004"},{"key":"S1471068412000105_ref41","doi-asserted-by":"crossref","unstructured":"Franconi E. , Palma A. L. , Leone N. et al. 2001. Census data repair: A challenging application of disjunctive logic programming. In LPAR 2001. LNCS 2250, 561\u2013578.","DOI":"10.1007\/3-540-45653-8_39"},{"key":"S1471068412000105_ref90","unstructured":"PDDL 3.1 2008. Changes in PDDL 3.1. http:\/\/ipc.informatik.uni-freiburg.de\/PddlExtension."},{"key":"S1471068412000105_ref51","first-page":"323","article-title":"Detecting inconsistencies in large biological networks with answer set programming","volume":"11","author":"Gebser","year":"2011","journal-title":"TPLP"},{"key":"S1471068412000105_ref63","first-page":"224","volume-title":"Constraint Satisfaction in Logic Programming","author":"Hentenryck","year":"1989"},{"key":"S1471068412000105_ref89","volume-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"S1471068412000105_ref31","first-page":"422","volume-title":"KR 2008","author":"Drescher","year":"2008"},{"key":"S1471068412000105_ref9","unstructured":"Baral C. and Gelfond M. 2000. Reasoning agents in dynamic domains. Logic-Based Artificial Intelligence, 257\u2013279."},{"key":"S1471068412000105_ref46","unstructured":"Gebser M. , Kaufmann B. , Kaminski R. , Ostrowski M. , Schaub T. and Schneider M. since 2007. Potassco, the Potsdam answer set solving collection - homepage. http:\/\/potassco.sourceforge.net\/."},{"key":"S1471068412000105_ref95","unstructured":"WASP. Wasp showcase. Since 2003. http:\/\/www.kr.tuwien.ac.at\/research\/projects\/WASP\/showcase.html."},{"key":"S1471068412000105_ref66","unstructured":"Janhunen T. and Niemel\u00e4 I. 2004. Gnt - A solver for disjunctive logic programs. In LPNMR 2004. LNAI 2923, 331\u2013335."},{"key":"S1471068412000105_ref25","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502810"},{"key":"S1471068412000105_ref56","unstructured":"Graphviz 2011. Graphviz - Graph Visualization Software. http:\/\/www.graphviz.org\/."},{"key":"S1471068412000105_ref4","unstructured":"Balduccini M. 2009a. A general method to solve complex problems by combining multiple answer set programs. In ASPOCP Workshop at ICLP 2009)."},{"key":"S1471068412000105_ref57","doi-asserted-by":"crossref","unstructured":"Grasso G. , Iiritano S. , Leone N. and Ricca F. 2009. Some DLV applications for knowledge management. In LPNMR 2009. LNCS 5753, 591\u2013597.","DOI":"10.1007\/978-3-642-04238-6_63"},{"key":"S1471068412000105_ref88","doi-asserted-by":"crossref","unstructured":"Palopoli L. , Rombo S. E. and Terracina G. 2005. Flexible pattern discovery with (extended) disjunctive logic programming. In ISMIS 2005. 504\u2013513.","DOI":"10.1007\/11425274_52"},{"key":"S1471068412000105_ref50","doi-asserted-by":"crossref","unstructured":"Gebser M. , Schaub T. and Thiele S. GrinGo : A new grounder for answer set programming. In LPNMR 2007. LNCS 4483, 266\u2013271.","DOI":"10.1007\/978-3-540-72200-7_24"},{"key":"S1471068412000105_ref75","doi-asserted-by":"crossref","unstructured":"Lierler Y. 2008. Abstract answer set solvers. In ICLP 2008. LNCS 5366, 377\u2013391.","DOI":"10.1007\/978-3-540-89982-2_35"},{"key":"S1471068412000105_ref82","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"S1471068412000105_ref62","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1613\/jair.1705","article-title":"The fast downward planning system","volume":"26","author":"Helmert","year":"2006","journal-title":"JAIR"},{"key":"S1471068412000105_ref19","unstructured":"Calimeri F. , Ianni G. and Ricca F. 2011. 3rd ASP Competition, file and language formats. http:\/\/www.mat.unical.it\/aspcomp2011\/files\/LanguageSpecifications.pdf."},{"key":"S1471068412000105_ref35","doi-asserted-by":"crossref","unstructured":"Ellguth E. , Gebser M. , Gusowski M. , Kaminski R. , Kaufmann B. , Liske S. , Schaub T. , Schneidenbach L. and Schnor B. 2009. A simple distributed conflict-driven answer set solver. In LPNMR 2009. LNAI 5753, 490\u2013495.","DOI":"10.1007\/978-3-642-04238-6_47"},{"key":"S1471068412000105_ref43","doi-asserted-by":"crossref","unstructured":"Gange G. , Stuckey P. J. and Marriott K. 2010. Optimal k-level planarization and crossing minimization. In Graph Drawing. LNCS, vol. 6502. 238\u2013249.","DOI":"10.1007\/978-3-642-18469-7_22"},{"key":"S1471068412000105_ref86","unstructured":"Nogueira M. , Balduccini M. , Gelfond M. , Watson R. and Barry M. 2001 An A-Prolog decision support system for the space shuttle. In PADL 2001. LNCS 1990, 169\u2013183."},{"key":"S1471068412000105_ref92","first-page":"181","article-title":"Extending and implementing the stable model semantics","volume":"138","author":"Simons","year":"2002","journal-title":"AI"},{"key":"S1471068412000105_ref73","doi-asserted-by":"crossref","unstructured":"Leone N. , Greco G. , Ianni G. , Lio V. , Terracina G. , Eiter T. , Faber W. , Fink M. , Gottlob G. , Rosati R. , Lembo D. , Lenzerini M. , Ruzzi M. , Kalka E. , Nowicki B. and Staniszkis W. 2005. The INFOMIX system for advanced integration of incomplete and inconsistent data. In SIGMOD 2005. 915\u2013917.","DOI":"10.1145\/1066157.1066286"},{"key":"S1471068412000105_ref78","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"S1471068412000105_ref7","doi-asserted-by":"crossref","unstructured":"Bancilhon F. , Maier D. , Sagiv Y. and Ullman J. D. 1986. Magic sets and other strange ways to implement logic programs. In PODS 1986. 1\u201315.","DOI":"10.1145\/6012.15399"},{"key":"S1471068412000105_ref80","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.datak.2010.01.005","article-title":"The consistency extractor system: Answer set programs for consistent query answering in databases","volume":"69","author":"Marileo","year":"2010","journal-title":"DKE"},{"key":"S1471068412000105_ref2","unstructured":"Anger C. , Gebser M. , Linke T. , Neumann A. and Schaub T. 2005. The nomore++ approach to answer set solving. In LPAR 2005. LNCS 3835, 95\u2013109."},{"key":"S1471068412000105_ref70","doi-asserted-by":"crossref","unstructured":"Lee J. and Lifschitz V. 2003. Loop formulas for disjunctive logic programs. In ICLP 2003. 451\u2013465.","DOI":"10.1007\/978-3-540-24599-5_31"},{"key":"S1471068412000105_ref27","unstructured":"de Moura L. M. and Bj\u00f8rner N. 2008. Z3: An efficient SMT solver. In TACAS. LNCS 4963, 337\u2013340."},{"key":"S1471068412000105_ref61","doi-asserted-by":"crossref","unstructured":"Healy P. and Kuusik A. 1999. The vertex-exchange graph: A new concept for multi-level crossing minimisation. In Graph Drawing. LNCS 1731, 205\u2013216.","DOI":"10.1007\/3-540-46648-7_21"},{"key":"S1471068412000105_ref24","doi-asserted-by":"crossref","first-page":"297","DOI":"10.3233\/FI-2009-180","article-title":"GASP: Answer set programming with lazy grounding","volume":"96","author":"Dal","year":"2009","journal-title":"FI"},{"key":"S1471068412000105_ref16","unstructured":"CADE-ATP 2011. The CADE ATP System Competition. http:\/\/www.cs.miami.edu\/~tptp\/CASC."},{"key":"S1471068412000105_ref71","unstructured":"Lef\u00e8vre C. and Nicolas P. 2009a. A first order forward chaining approach for answer set computing. In LPNMR 2009. LNCS 5753, 196\u2013208."},{"key":"S1471068412000105_ref10","doi-asserted-by":"crossref","unstructured":"Baral C. and Uyan C. 2001. Declarative specification and solution of combinatorial auctions using logic programming. In LPNMR 2001. LNAI 2173, 186\u2013199.","DOI":"10.1007\/3-540-45402-0_14"},{"key":"#cr-split#-S1471068412000105_ref83.1","unstructured":"39. Nieuwenhuis R. and Oliveras A. 2005. DPLL"},{"key":"#cr-split#-S1471068412000105_ref83.2","doi-asserted-by":"crossref","unstructured":"40. (T) with exhaustive theory propagation and its application to difference logic. In CAV 2005. LNCS 3576, 321-334.","DOI":"10.1007\/11513988_33"},{"key":"S1471068412000105_ref12","doi-asserted-by":"publisher","DOI":"10.1145\/195613.195637"},{"key":"S1471068412000105_ref34","doi-asserted-by":"crossref","unstructured":"Eiter T. , Ianni G. and Krennwallner T. 2009. Answer set programming: A primer. In Reasoning Web. LNCS 5689, 40\u2013110.","DOI":"10.1007\/978-3-642-03754-2_2"},{"key":"S1471068412000105_ref44","volume-title":"Database System Implementation","author":"Garcia-Molina","year":"2000"},{"key":"S1471068412000105_ref49","unstructured":"Gebser M. , Liu L. , Namasivayam G. , Neumann A. , Schaub T. and Truszczy\u0144ski M. 2007. The first answer set programming system competition. In LPNMR 2007. LNCS 4483, 3\u201317."},{"key":"S1471068412000105_ref52","unstructured":"GECODE 2011. GECODE - An open, free, efficient constraint solving toolkit - Homepage. http:\/\/www.gecode.org\/."},{"key":"#cr-split#-S1471068412000105_ref79.1","unstructured":"44. Mari??n M., Wittocx J., Denecker M. and Bruynooghe M. 2008. SAT"},{"key":"#cr-split#-S1471068412000105_ref79.2","unstructured":"45. (ID): Satisfiability of propositional logic extended with inductive definitions. In SAT 2008. LNCS 4996, 211-224."},{"key":"S1471068412000105_ref48","unstructured":"Gebser M. , Kaufmann B. and Schaub T. 2009. The conflict-driven answer set solver clasp: Progress report. In LPNMR 2009. LNCS 5753, 509\u2013514."},{"key":"S1471068412000105_ref32","unstructured":"E\u00e9n N. and S\u00f6rensson N. 2003. An extensible SAT-solver. In SAT. LNCS 2919, 502\u2013518."},{"key":"S1471068412000105_ref67","unstructured":"Janhunen T. , Niemel\u00e4 I. and Sevalnev M. 2009. Computing stable models via reductions to difference logic. In LPNMR 2009. LNCS 5753, 142\u2013154."},{"key":"S1471068412000105_ref36","unstructured":"Faber W. , Leone N. and Pfeifer G. 2004. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In JELIA 2004. LNAI 3229, 200\u2013212."},{"key":"S1471068412000105_ref54","unstructured":"Gerevini A. and Long D. 2005. Plan Constraints and Preferences in PDDL3 - The Language of the Fifth International Planning Competition. Technical rep. http:\/\/cs-www.cs.yale.edu\/homes\/dvm\/papers\/pddl-ipc5.pdf."},{"key":"S1471068412000105_ref74","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068412000105_ref55","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.3.754"},{"key":"S1471068412000105_ref14","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"Bomze","year":"1999"},{"key":"S1471068412000105_ref77","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"S1471068412000105_ref81","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623498334013"},{"key":"S1471068412000105_ref47","unstructured":"Gebser M. , Kaufmann B. , Neumann A. and Schaub T. 2007. Conflict-driven answer set solving. In IJCAI 2007, 386\u2013392."},{"key":"S1471068412000105_ref40","unstructured":"Fodor P. , Liang S. and Kifer M. 2011. OpenRuleBench: Report 2011. Computing, 1\u201314."},{"key":"S1471068412000105_ref68","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026"},{"key":"S1471068412000105_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068412000105_ref3","unstructured":"ASP-Draft 2004. Core language for ASP solver competitions. Steering committee meeting at LPNMR 2004. https:\/\/www.mat.unical.it\/aspcomp2011\/files\/Corelang2004.pdf."},{"key":"S1471068412000105_ref22","unstructured":"CHR 2004. Constraint handling rules. Since 2004. http:\/\/dtai.cs.kuleuven.be\/CHR\/."},{"key":"S1471068412000105_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01994876"},{"key":"S1471068412000105_ref39","doi-asserted-by":"publisher","DOI":"10.1137\/S089548010240415X"},{"key":"S1471068412000105_ref45","unstructured":"Gebser M. , Kaminski R. , Kaufmann B. , Schaub T. , Schneider M. T. and Ziller S. 2011. A portfolio solver for answer set programming: Preliminary report. In LPNMR 2011. LNCS 6645, 352\u2013357."},{"key":"S1471068412000105_ref29","doi-asserted-by":"crossref","unstructured":"Denecker M. , Vennekens J. , Bond S. , Gebser M. and Truszczynski M. 2009. The second answer set programming competition. In LPNMR 2009. LNCS 5753, 637\u2013654.","DOI":"10.1007\/978-3-642-04238-6_75"},{"key":"S1471068412000105_ref85","unstructured":"Niskanen S. since 2003. Cliquer Homepage. http:\/\/users.tkk.fi\/pat\/cliquer.html."},{"key":"S1471068412000105_ref1","unstructured":"Aclasp 2011. Aclasp Sources. https:\/\/potassco.svn.sourceforge.net\/svnroot\/potassco\/branches\/adaptive-restarts\/adapt-to-avgdl."},{"key":"S1471068412000105_ref23","unstructured":"CPLEX 2011. IBM ILOG CPLEX. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/."},{"key":"S1471068412000105_ref76","unstructured":"Lierler Y. and Maratea M. 2004. Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In LPNMR 2004. LNAI 2923, 346\u2013350."},{"key":"S1471068412000105_ref26","first-page":"60","volume-title":"KR 2010","author":"Dao-Tran","year":"2010"},{"key":"S1471068412000105_ref98","unstructured":"XSB. 2011. The Home of XSB. http:\/\/xsb.sourceforge.net\/."},{"key":"S1471068412000105_ref11","doi-asserted-by":"crossref","unstructured":"Bardadym V. A. 1996. Computer-aided school and university Timetabling: The new wave. In Practice and Theory of Automated Timetabling. LNCS, vol. 1153. 22\u201345.","DOI":"10.1007\/3-540-61794-9_50"},{"key":"S1471068412000105_ref100","doi-asserted-by":"crossref","unstructured":"Zhou N.-F. 2011. The language features and architecture of B-Prolog. arXiv:1103.0812v1. Submitted to TPLP Special Issue on Prolog Systems.","DOI":"10.1017\/S1471068411000445"}],"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\/S1471068412000105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T10:40:33Z","timestamp":1643366433000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068412000105\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,6]]},"references-count":102,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["S1471068412000105"],"URL":"https:\/\/doi.org\/10.1017\/s1471068412000105","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,6]]}}}