{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:34:30Z","timestamp":1757543670310},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208942"},{"type":"electronic","value":"9783642208959"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20895-9_46","type":"book-chapter","created":{"date-parts":[[2011,4,25]],"date-time":"2011-04-25T04:40:34Z","timestamp":1303706434000},"page":"388-403","source":"Crossref","is-referenced-by-count":20,"title":["The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Calimeri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovambattista","family":"Ianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Alviano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annamaria","family":"Bria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gelsomina","family":"Catalano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanna","family":"Cozza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Faber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Onofrio","family":"Febbraro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Manna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandra","family":"Martello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Panetta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simona","family":"Perri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristian","family":"Reale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Carmela","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Sirianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Terracina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierfrancesco","family":"Veltri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"Contstraint Handling Rules, http:\/\/dtai.cs.kuleuven.be\/CHR\/"},{"key":"46_CR2","unstructured":"Core language for asp solver competitions. Minutes of the steering committee meeting at LPNMR (2004), https:\/\/www.mat.unical.it\/aspcomp2011\/files\/Corelang2004.pdf"},{"key":"46_CR3","unstructured":"The CADE ATP System Competition, http:\/\/www.cs.miami.edu\/~tptp\/CASC\/"},{"key":"46_CR4","unstructured":"The Satisfiability Modulo Theories Library, http:\/\/www.smtlib.org\/"},{"key":"46_CR5","unstructured":"Alviano, M., Faber, W., Greco, G., Leone, N.: Magic sets for disjunctive datalog programs. Tech. Report 09\/2009, Dipartimento di Matematica, Universit\u00e0 della Calabria, Italy (2009), http:\/\/www.wfaber.com\/research\/papers\/TRMAT092009.pdf"},{"key":"46_CR6","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":"46_CR7","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D.: Magic Sets and Other Strange Ways to Implement Logic Programs. In: PODS 1986, Cambridge, Massachusetts, pp. 1\u201315 (1986)","DOI":"10.1145\/6012.15399"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. In: CUP (2003)","DOI":"10.1017\/CBO9780511543357"},{"key":"46_CR9","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.S.: Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases. JACM\u00a041, 1178\u20131215 (1994)","journal-title":"JACM"},{"key":"46_CR10","first-page":"421","volume":"96","author":"R. Ben-Eliyahu-Zohary","year":"1997","unstructured":"Ben-Eliyahu-Zohary, R., Palopoli, L.: Reasoning with Minimal Models: Efficient Algorithms and Applications. AI\u00a096, 421\u2013449 (1997)","journal-title":"AI"},{"issue":"3","key":"46_CR11","first-page":"448","volume":"9","author":"M. Cadoli","year":"1997","unstructured":"Cadoli, M., Eiter, T., Gottlob, G.: Default Logic as a Query Language. IEEE TKDE\u00a09(3), 448\u2013463 (1997)","journal-title":"IEEE TKDE"},{"key":"46_CR12","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":"46_CR13","unstructured":"Calimeri, F., Ianni, G., Ricca, F., The Universit\u00e0 della Calabria Organizing Committee: The Third Answer Set Programming Competition homepage (2011), http:\/\/www.mat.unical.it\/aspcomp2011\/"},{"key":"46_CR14","unstructured":"Cumbo, C., Faber, W., Greco, G.: Improving Query Optimization for Disjunctive Datalog. In: Proceedings of the Joint Conference on Declarative Programming APPIA-GULP-PRODE 2003, pp. 252\u2013262 (2003)"},{"issue":"3","key":"46_CR15","doi-asserted-by":"crossref","first-page":"297","DOI":"10.3233\/FI-2009-180","volume":"96","author":"A.D. Pal\u00f9","year":"2009","unstructured":"Pal\u00f9, A.D., Dovier, A., Pontelli, E., Rossi, G.: GASP: Answer set programming with lazy grounding. FI\u00a096(3), 297\u2013322 (2009)","journal-title":"FI"},{"issue":"3","key":"46_CR16","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":"46_CR17","first-page":"60","volume-title":"12th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2010), Toronto, Canada","author":"M. Dao-Tran","year":"2010","unstructured":"Dao-Tran, M., Eiter, T., Fink, M., Krennwallner, T.: Distributed Nonmonotonic Multi-Context Systems. In: 12th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2010), Toronto, Canada, May 9-13, pp. 60\u201370. AAAI Press, Menlo Park (2010)"},{"key":"46_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"46_CR19","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)"},{"key":"46_CR20","first-page":"422","volume-title":"Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008)","author":"C. Drescher","year":"2008","unstructured":"Drescher, C., Gebser, M., Schaub, T.: Conflict-Driven Disjunctive Answer Set Solving. In: Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pp. 422\u2013432. AAAI Press, Sydney (2008)"},{"key":"46_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"46_CR22","doi-asserted-by":"crossref","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative Problem-Solving Using the DLV System. In: Logic-Based Artificial Intelligence, pp. 79\u2013103 (2000)","DOI":"10.1007\/978-1-4615-1567-8_4"},{"issue":"3","key":"46_CR23","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 TODS\u00a022(3), 364\u2013418 (1997)","journal-title":"ACM TODS"},{"key":"46_CR24","doi-asserted-by":"crossref","unstructured":"Eiter, T., Ianni, G., Krennwallner, T.: Answer Set Programming: A Primer. In: Reasoning Web. Semantic Technologies for Information Systems, 5th International Summer School - Tutorial Lectures, Brixen-Bressanone, Italy, August 2009, pp. 40\u2013110 (2009)","DOI":"10.1007\/978-3-642-03754-2_2"},{"key":"46_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-642-04238-6_47","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"E. Ellguth","year":"2009","unstructured":"Ellguth, E., Gebser, M., Gusowski, M., Kaufmann, B., Kaminski, R., Liske, S., Schaub, T., Schneidenbach, L., Schnor, B.: A simple distributed conflict-driven answer set solver. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 490\u2013495. Springer, Heidelberg (2009)"},{"key":"46_CR26","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":"46_CR27","volume-title":"Database System Implementation","author":"H. Garcia-Molina","year":"2000","unstructured":"Garcia-Molina, H., Ullman, J.D., Widom, J.: Database System Implementation. Prentice-Hall, Englewood Cliffs (2000)"},{"key":"46_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-642-04238-6_50","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2009","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: The conflict-driven answer set solver clasp: Progress report. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 509\u2013514. Springer, Heidelberg (2009)"},{"issue":"2","key":"46_CR29","first-page":"1","volume":"11","author":"M. Gebser","year":"2011","unstructured":"Gebser, M., Schaub, T., Thiele, S., Veber, P.: Detecting Inconsistencies in Large Biological Networks with Answer Set Programming. TPLP\u00a011(2), 1\u201338 (2011)","journal-title":"TPLP"},{"key":"46_CR30","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 386\u2013392 (2007)"},{"key":"46_CR31","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)"},{"key":"46_CR32","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-72200-7_24","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Schaub, T., Thiele, S.: grinGo: A new grounder for answer set programming. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 266\u2013271. Springer, Heidelberg (2007)"},{"issue":"1-2","key":"46_CR33","first-page":"3","volume":"138","author":"M. Gelfond","year":"2002","unstructured":"Gelfond, M., Leone, N.: Logic Programming and Knowledge Representation \u2013 the A-Prolog perspective. AI\u00a0138(1-2), 3\u201338 (2002)","journal-title":"AI"},{"key":"46_CR34","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. NGC\u00a09, 365\u2013385 (1991)","journal-title":"NGC"},{"key":"46_CR35","unstructured":"Gerevini, A., Long, D.: Plan constraints and preferences in PDDL3 - the language of the fifth international planning competition. Technical report (2005), http:\/\/cs-www.cs.yale.edu\/homes\/dvm\/papers\/pddl-ipc5.pdf"},{"key":"46_CR36","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)"},{"issue":"1-2","key":"46_CR37","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3166\/jancl.16.35-86","volume":"16","author":"T. Janhunen","year":"2006","unstructured":"Janhunen, T.: Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics\u00a016(1-2), 35\u201386 (2006)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"46_CR38","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-24609-1_29","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Janhunen","year":"2003","unstructured":"Janhunen, T., Niemel\u00e4, I.: GNT \u2014 A solver for disjunctive logic programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 331\u2013335. Springer, Heidelberg (2003)"},{"issue":"1","key":"46_CR39","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 TOCL\u00a07(1), 1\u201337 (2006)","journal-title":"ACM TOCL"},{"key":"46_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04238-6_14","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Janhunen","year":"2009","unstructured":"Janhunen, T., Niemel\u00e4, I., Sevalnev, M.: Computing Stable Models via Reductions to Difference Logic. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 142\u2013154. Springer, Heidelberg (2009), doi:10.1007\/978-3-642-04238-6_14"},{"key":"46_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":"46_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 TOCL\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM TOCL"},{"key":"46_CR43","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/11546207_44","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y. Lierler","year":"2005","unstructured":"Lierler, Y.: Disjunctive Answer Set Programming via Satisfiability. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 447\u2013451. Springer, Heidelberg (2005)"},{"key":"46_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-89982-2_35","volume-title":"Logic Programming","author":"Y. Lierler","year":"2008","unstructured":"Lierler, Y.: Abstract Answer Set Solvers. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 377\u2013391. Springer, Heidelberg (2008)"},{"key":"46_CR45","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-24609-1_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y. Lierler","year":"2003","unstructured":"Lierler, Y., Maratea, M.: Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 346\u2013350. Springer, Heidelberg (2003)"},{"key":"46_CR46","unstructured":"Lifschitz, V.: Answer Set Planning. In: ICLP 1999, Las Cruces, New, Mexico, USA, pp. 23\u201337 (1999)"},{"issue":"1-2","key":"46_CR47","first-page":"115","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. AI\u00a0157(1-2), 115\u2013137 (2004)","journal-title":"AI"},{"key":"46_CR48","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm \u2013 A 25-Year Perspective, pp. 375\u2013398 (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"46_CR49","unstructured":"Niemel\u00e4, I., Simons, P., Syrj\u00e4nen, T.: Smodels: A System for Answer Set Programming. In: Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, NMR 2000 (2000), http:\/\/xxx.lanl.gov\/abs\/cs\/0003033v1"},{"key":"46_CR50","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"46_CR51","first-page":"181","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. AI\u00a0138, 181\u2013234 (2002)","journal-title":"AI"},{"issue":"3","key":"46_CR52","first-page":"362","volume":"7","author":"V.S. Subrahmanian","year":"1995","unstructured":"Subrahmanian, V.S., Nau, D., Vago, C.: WFS + Branch and Bound = Stable Models. IEEE TKDE\u00a07(3), 362\u2013377 (1995)","journal-title":"IEEE TKDE"},{"key":"46_CR53","unstructured":"Wittocx, J., Mari\u00ebn, M., Denecker, M.: The idp system: a model expansion system for an extension of classical logic. In: Logic and Search, Computation of Structures from Declarative Descriptions, LaSh 2008, Leuven, Belgium, pp. 153\u2013165 (2008)"},{"key":"46_CR54","unstructured":"Ziller, S., Gebser, M., Kaufmann, B., Schaub, T.: An Introduction to claspfolio. Institute of Computer Science, University of Potsdam, Germany (2010), http:\/\/www.cs.uni-potsdam.de\/claspfolio\/manual.pdf"}],"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-20895-9_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T16:01:43Z","timestamp":1592496103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20895-9_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208942","9783642208959"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20895-9_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}