{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:12:41Z","timestamp":1757542361419,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405631"},{"type":"electronic","value":"9783642405648"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40564-8_5","type":"book-chapter","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T11:21:30Z","timestamp":1378984890000},"page":"42-53","source":"Crossref","is-referenced-by-count":19,"title":["The Fourth Answer Set Programming Competition: Preliminary Report"],"prefix":"10.1007","author":[{"given":"Mario","family":"Alviano","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Calimeri","sequence":"additional","affiliation":[]},{"given":"G\u00fcnther","family":"Charwat","sequence":"additional","affiliation":[]},{"given":"Minh","family":"Dao-Tran","sequence":"additional","affiliation":[]},{"given":"Carmine","family":"Dodaro","sequence":"additional","affiliation":[]},{"given":"Giovambattista","family":"Ianni","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Krennwallner","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Kronegger","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"Oetsch","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Pfandler","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg","family":"P\u00fchrer","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Redl","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[]},{"given":"Patrik","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Schwengerer","sequence":"additional","affiliation":[]},{"given":"Lara Katharina","family":"Spendier","sequence":"additional","affiliation":[]},{"given":"Johannes Peter","family":"Wallner","sequence":"additional","affiliation":[]},{"given":"Guohui","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-28717-6_4","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Aavani","year":"2012","unstructured":"Aavani, A., Wu, X(N.), Tasharrofi, S., Ternovska, E., Mitchell, D.: Enfragmo: A system for modelling and solving search problems with logic. In: Bj\u00f8rner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol.\u00a07180, pp. 15\u201322. Springer, Heidelberg (2012)"},{"key":"5_CR2","series-title":"LNCS","first-page":"55","volume-title":"LPNMR 2013","author":"M. Alviano","year":"2013","unstructured":"Alviano, M., Dodaro, C., Faber, W., Leone, N., Ricca, F.: WASP: A native ASP solver based on constraint learning. In: Cabalar, P., Corunna, Son, T.C. (eds.) LPNMR 2013. LNCS, vol.\u00a08148, pp. 55\u201367. Springer, Heidelberg (2013)"},{"key":"5_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11591191_8","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"C. Anger","year":"2005","unstructured":"Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ Approach to Answer Set Solving. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 95\u2013109. Springer, Heidelberg (2005)"},{"key":"5_CR4","unstructured":"4th ASP Competition Organizing\u00a0Committee, T.: Official Problem Suite (2013), https:\/\/www.mat.unical.it\/aspcomp2013\/OfficialProblemSuite"},{"key":"5_CR5","unstructured":"4th ASP Competition Organizing\u00a0Committee, T.: Rules and Scoring (2013), https:\/\/www.mat.unical.it\/aspcomp2013\/ParticipationRules"},{"key":"5_CR6","unstructured":"Core language for ASP solver competitions, minutes of the steering committee meeting at LPNMR 2004 (2004), https:\/\/www.mat.unical.it\/aspcomp2011\/files\/Corelang2004.pdf"},{"key":"5_CR7","unstructured":"Balduccini, M.: Representing Constraint Satisfaction Problems in Answer Set Programming. In: ICLP 2009 Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2009) (July 2009)"},{"key":"5_CR8","unstructured":"Balduccini, M.: An Answer Set Solver for non-Herbrand Programs: Progress Report. In: Costa, V.S., Dovier, A. (eds.) Technical Communications of the 28th International Conference on Logic Programming (ICLP 2012). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2012)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511543357"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1145\/195613.195637","volume":"41","author":"C. Bell","year":"1994","unstructured":"Bell, C., Nerode, A., Ng, R.T., Subrahmanian, V.: Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases. Journal of the ACM\u00a041, 1178\u20131215 (1994)","journal-title":"Journal of the ACM"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Enhancing asp by functions: Decidable classes and implementation techniques. In: Fox, M., Poole, D. (eds.) AAAI. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7702"},{"key":"5_CR12","unstructured":"Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., Schaub, T.: ASP-Core-2: 4th ASP Competition Official Input Language Format (2013), http:\/\/www.mat.unical.it\/aspcomp2013\/files\/ASP-CORE-2.01c.pdf"},{"key":"5_CR13","unstructured":"Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., Schaub, T.: ASP Standardization Activity (2013), http:\/\/www.mat.unical.it\/aspcomp2013\/ASPStandardization\/"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Calimeri, F., Ianni, G., Krenwallner, T., Ricca, F.: The 4th ASP Competition Organizing Committee: The Fourth Answer Set Programming Competition homepage (2013), http:\/\/www.mat.unical.it\/aspcomp2013\/","DOI":"10.1609\/aimag.v33i4.2448"},{"key":"5_CR15","unstructured":"Calimeri, F., Ianni, G., Ricca, F.: Third ASP Competition, File and language formats (2011), http:\/\/www.mat.unical.it\/aspcomp2011\/files\/LanguageSpecifications.pdf"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Calimeri, F., Ianni, G., Ricca, F.: The third open answer set programming competition. Theory and Practice of Logic Programming FirstView, 1\u201319 (2012), http:\/\/dx.doi.org\/10.1017\/S1471068412000105","DOI":"10.1017\/S1471068412000105"},{"key":"5_CR17","series-title":"LNAI","first-page":"233","volume-title":"LPNMR 2013","author":"G. Charwat","year":"2013","unstructured":"Charwat, G., Ianni, G., Krennwallner, T., Kronegger, M., Pfandler, A., Redl, C., Schwengerer, M., Spendier, L., Wallner, J.P., Xiao, G.: VCWC: A versioning competition workflow compiler. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol.\u00a08148, pp. 233\u2013238. Springer, Heidelberg (2013), http:\/\/www.kr.tuwien.ac.at\/staff\/tkren\/pub\/2013\/lpnmr2013-vcwc.pdf"},{"issue":"3","key":"5_CR18","doi-asserted-by":"crossref","first-page":"297","DOI":"10.3233\/FI-2009-180","volume":"96","author":"A. Pal\u00f9 Dal","year":"2009","unstructured":"Dal Pal\u00f9, A., Dovier, A., Pontelli, E., Rossi, G.: GASP: Answer set programming with lazy grounding. Fundamenta Informaticae\u00a096(3), 297\u2013322 (2009)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E. Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming. ACM Computing Surveys\u00a033(3), 374\u2013425 (2001)","journal-title":"ACM Computing Surveys"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-04238-6_75","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Denecker","year":"2009","unstructured":"Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczy\u0144ski, M.: The Second Answer Set Programming Competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 637\u2013654. Springer, Heidelberg (2009)"},{"issue":"4-6","key":"5_CR21","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1017\/S1471068410000220","volume":"10","author":"C. Drescher","year":"2010","unstructured":"Drescher, C., Walsh, T.: A translational approach to constraint answer set solving. Theory and Practice of Logic Programming\u00a010(4-6), 465\u2013480 (2010)","journal-title":"Theory and Practice of Logic Programming"},{"key":"5_CR22","unstructured":"Drescher, C., Walsh, T.: Answer set solving with lazy nogood generation. In: Dovier, A., Costa, V.S. (eds.) ICLP (Technical Communications). LIPIcs, vol.\u00a017, pp. 188\u2013200. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative Problem-Solving Using the DLV System. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 79\u2013103. Kluwer Academic Publishers (2000)","DOI":"10.1007\/978-1-4615-1567-8_4"},{"issue":"3","key":"5_CR24","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/261124.261126","volume":"22","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM Transactions on Database Systems\u00a022(3), 364\u2013418 (1997)","journal-title":"ACM Transactions on Database Systems"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-03754-2_2","volume-title":"Reasoning Web. Semantic Technologies for Information Systems","author":"T. Eiter","year":"2009","unstructured":"Eiter, T., Ianni, G., Krennwallner, T.: Answer Set Programming: A Primer. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web 2009. LNCS, vol.\u00a05689, pp. 40\u2013110. Springer, Heidelberg (2009)"},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"W. Faber","year":"2011","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence\u00a0175(1), 278\u2013298 (2011)","journal-title":"Artificial Intelligence"},{"key":"5_CR27","unstructured":"Falkner, A., Haselb\u00f6ck, A., Schenner, G.: Modeling Technical Product Configuration Problems. In: Proceedings of ECAI 2010 Workshop on Configuration, Lisbon, Portugal, pp. 40\u201346 (2010)"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-89982-2_23","volume-title":"Logic Programming","author":"M. Gebser","year":"2008","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: Engineering an incremental ASP solver. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 190\u2013205. Springer, Heidelberg (2008)"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-20895-9_40","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M.T., Ziller, S.: A portfolio solver for answer set programming: Preliminary report. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol.\u00a06645, pp. 352\u2013357. Springer, Heidelberg (2011)"},{"issue":"4-5","key":"5_CR30","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1017\/S1471068412000166","volume":"12","author":"M. Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Multi-threaded ASP solving with clasp. Theory and Practice of Logic Programming\u00a012(4-5), 525\u2013545 (2012)","journal-title":"Theory and Practice of Logic Programming"},{"key":"5_CR31","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Advanced conflict-driven disjunctive answer set solving. In: Rossi, F. (ed.) Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI 2013). IJCAI\/AAAI (to appear, 2013)"},{"issue":"2","key":"5_CR32","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M. Gebser","year":"2011","unstructured":"Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.T.: Potassco: The Potsdam Answer Set Solving Collection. AI Communications\u00a024(2), 107\u2013124 (2011)","journal-title":"AI Communications"},{"key":"5_CR33","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187-188","author":"M. Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187-188, 52\u201389 (2012)","journal-title":"Artificial Intelligence"},{"key":"5_CR34","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-72200-7_3","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczy\u0144ski, M.: The first answer set programming system competition. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 3\u201317. Springer, Heidelberg (2007)"},{"issue":"1-2","key":"5_CR35","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0004-3702(02)00207-2","volume":"138","author":"M. Gelfond","year":"2002","unstructured":"Gelfond, M., Leone, N.: Logic Programming and Knowledge Representation \u2013 the A-Prolog perspective. Artificial Intelligence\u00a0138(1-2), 3\u201338 (2002)","journal-title":"Artificial Intelligence"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"issue":"4","key":"5_CR37","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10817-006-9033-2","volume":"36","author":"E. Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning\u00a036(4), 345\u2013377 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"5_CR38","volume-title":"The stable marriage problem: structure and algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The stable marriage problem: structure and algorithms. MIT Press, Cambridge (1989)"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-20832-4_8","volume-title":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning","author":"T. Janhunen","year":"2011","unstructured":"Janhunen, T., Niemel\u00e4, I.: Compact translations of non-disjunctive answer set programs to propositional clauses. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol.\u00a06565, pp. 111\u2013130. Springer, Heidelberg (2011)"},{"issue":"1","key":"5_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1119439.1119440","volume":"7","author":"T. Janhunen","year":"2006","unstructured":"Janhunen, T., Niemel\u00e4, I., Seipel, D., Simons, P., You, J.H.: Unfolding Partiality and Disjunctions in Stable Model Semantics. ACM Transactions on Computational Logic\u00a07(1), 1\u201337 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/978-3-642-04238-6_52","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C. Lef\u00e8vre","year":"2009","unstructured":"Lef\u00e8vre, C., Nicolas, P.: The first version of a new ASP solver: ASPeRiX. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 522\u2013527. Springer, Heidelberg (2009)"},{"issue":"3","key":"5_CR42","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM Transactions on Computational Logic\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"5_CR43","first-page":"23","volume-title":"Proceedings of the 16th International Conference on Logic Programming (ICLP 1999)","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V.: Answer Set Planning. In: Schreye, D.D. (ed.) Proceedings of the 16th International Conference on Logic Programming (ICLP 1999), pp. 23\u201337. The MIT Press, Las Cruces (1999)"},{"issue":"1-2","key":"5_CR44","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. Artificial Intelligence\u00a0157(1-2), 115\u2013137 (2004)","journal-title":"Artificial Intelligence"},{"key":"5_CR45","unstructured":"Liu, G., Janhunen, T., Niemel\u00e4, I.: Answer set programming via mixed integer programming. In: 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), pp. 32\u201342 (2012)"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: Apt, K.R., Marek, V.W., Truszczy\u0144ski, M., Warren, D.S. (eds.) The Logic Programming Paradigm \u2013 A 25-Year Perspective, pp. 375\u2013398. Springer (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"5_CR47","unstructured":"Nguyen, M., Janhunen, T., Niemel\u00e4, I.: Translating answer-set programs into bit-vector logic. CoRR abs\/1108.5837 (2011)"},{"key":"5_CR48","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"key":"5_CR49","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence\u00a0138, 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"5_CR50","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/69.390244","volume":"7","author":"V. Subrahmanian","year":"1995","unstructured":"Subrahmanian, V., Nau, D., Vago, C.: WFS + Branch and Bound = Stable Models. IEEE Transactions on Knowledge and Data Engineering\u00a07(3), 362\u2013377 (1995)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2-4","key":"5_CR51","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/cpe.938","volume":"17","author":"D. Thain","year":"2005","unstructured":"Thain, D., Tannenbaum, T., Livny, M.: Distributed computing in practice: the Condor experience. Concurrency and Computation: Practice and Experience\u00a017(2-4), 323\u2013356 (2005)","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"5_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-39071-5_10","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"S. Wieringa","year":"2013","unstructured":"Wieringa, S., Heljanko, K.: Concurrent clause strengthening. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol.\u00a07962, pp. 116\u2013132. Springer, Heidelberg (2013)"},{"key":"5_CR53","unstructured":"Wittocx, J., Mari\u00ebn, M., Denecker, M.: The idp system: a model expansion system for an extension of classical logic. In: Denecker, M. (ed.) International Workshop on Logic and Search (Lash), pp. 153\u2013165 (2008)"},{"issue":"1-2","key":"5_CR54","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1017\/S1471068411000445","volume":"12","author":"N.F. Zhou","year":"2012","unstructured":"Zhou, N.F.: The language features and architecture of B-Prolog. Theory and Practice of Logic Programming\u00a012(1-2), 189\u2013218 (2012)","journal-title":"Theory and Practice of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40564-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T14:40:45Z","timestamp":1688481645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40564-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405631","9783642405648"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40564-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}