{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:30:17Z","timestamp":1768447817443,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642405631","type":"print"},{"value":"9783642405648","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40564-8_6","type":"book-chapter","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T07:21:30Z","timestamp":1378970490000},"page":"54-66","source":"Crossref","is-referenced-by-count":52,"title":["WASP: A Native ASP Solver Based on Constraint Learning"],"prefix":"10.1007","author":[{"given":"Mario","family":"Alviano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Dodaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Faber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","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"},{"key":"6_CR2","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, 364\u2013418 (1997)","journal-title":"ACM Transactions on Database Systems"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-24206-9_17","volume-title":"Datalog Reloaded","author":"M. Alviano","year":"2011","unstructured":"Alviano, M., Faber, W., Leone, N., Perri, S., Pfeifer, G., Terracina, G.: The disjunctive datalog system DLV. In: de Moor, O., Gottlob, G., Furche, T., Sellers, A. (eds.) Datalog 2010. LNCS, vol.\u00a06702, pp. 282\u2013301. Springer, Heidelberg (2011)"},{"key":"6_CR4","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. Morgan Kaufmann Publishers (2007)"},{"key":"6_CR5","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":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-642-04238-6_63","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"G. Grasso","year":"2009","unstructured":"Grasso, G., Iiritano, S., Leone, N., Ricca, F.: Some DLV applications for knowledge management. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 591\u2013597. Springer, Heidelberg (2009)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S147106841100007X","volume":"12","author":"F. Ricca","year":"2012","unstructured":"Ricca, F., Grasso, G., Alviano, M., Manna, M., Lio, V., Iiritano, S., Leone, N.: Team-building with answer set programming in the gioia-tauro seaport. Theory and Practice of Logic Programming\u00a012, 361\u2013381 (2012)","journal-title":"Theory and Practice of Logic Programming"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-28148-8_5","volume-title":"Transactions on Large-Scale Data- and Knowledge-Centered Systems V","author":"M. Manna","year":"2012","unstructured":"Manna, M., Oro, E., Ruffolo, M., Alviano, M., Leone, N.: The HiLeX system for semantic information extraction. In: Hameurlain, A., K\u00fcng, J., Wagner, R. (eds.) TLDKS V. LNCS, vol.\u00a07100, pp. 91\u2013125. Springer, Heidelberg (2012)"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3233\/FI-2010-357","volume":"105","author":"F. Ricca","year":"2010","unstructured":"Ricca, F., Alviano, M., Dimasi, A., Grasso, G., Ielpa, S.M., Iiritano, S., Manna, M., Leone, N.: A Logic-Based System for e-Tourism. Fundamenta Informaticae\u00a0105, 35\u201355 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-20895-9_46","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"F. Calimeri","year":"2011","unstructured":"Calimeri, F., et al.: The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol.\u00a06645, pp. 388\u2013403. Springer, Heidelberg (2011)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem Proving. Communications of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"6_CR12","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient Conflict Driven Learning in Boolean Satisfiability Solver. In: Proceedings of ICCAD 2001, pp. 279\u2013285 (2001)"},{"key":"6_CR13","unstructured":"Gaschnig, J.: Performance measurement and analysis of certain search algorithms. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA (1979) TR CMU-CS-79-124"},{"key":"6_CR14","unstructured":"Gomes, C.P., Selman, B., Kautz, H.A.: Boosting Combinatorial Search Through Randomization. In: Proceedings of AAAI\/IAAI 1998, pp. 431\u2013437. AAAI Press (1998)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of DAC 2001, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"6_CR16","unstructured":"Goldberg, E., Novikov, Y.: BerkMin: A Fast and Robust Sat-Solver. In: Design, Automation and Test in Europe Conference and Exposition, DATE 2002, Paris, France, pp. 142\u2013149. IEEE Computer Society (2002)"},{"key":"6_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-46767-X_13","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"W. Faber","year":"1999","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Pushing Goal Derivation in DLP Computations. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol.\u00a01730, pp. 177\u2013191. Springer, Heidelberg (1999)"},{"key":"6_CR18","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"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0004-3702(03)00078-X","volume":"15","author":"C. Koch","year":"2003","unstructured":"Koch, C., Leone, N., Pfeifer, G.: Enhancing Disjunctive Logic Programming Systems by SAT Checkers. Artificial Intelligence\u00a015, 177\u2013212 (2003)","journal-title":"Artificial Intelligence"},{"key":"6_CR20","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":"6_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01530761","volume":"12","author":"R. Ben-Eliyahu","year":"1994","unstructured":"Ben-Eliyahu, R., Dechter, R.: Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence\u00a012, 53\u201387 (1994)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M. Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of las vegas algorithms. Inf. Process. Lett.\u00a047, 173\u2013180 (1993)","journal-title":"Inf. Process. Lett."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1016\/j.dam.2006.10.007","volume":"155","author":"E. Goldberg","year":"2007","unstructured":"Goldberg, E., Novikov, Y.: Berkmin: A fast and robust sat-solver. Discrete Appl. Math.\u00a0155, 1549\u20131561 (2007)","journal-title":"Discrete Appl. Math."},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11799573_4","volume-title":"Logic Programming","author":"M. Gebser","year":"2006","unstructured":"Gebser, M., Schaub, T.: Tableau calculi for answer set programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 11\u201325. Springer, Heidelberg (2006)"},{"key":"6_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-24609-1_26","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J. Ward","year":"2003","unstructured":"Ward, J., Schlipf, J.: Answer Set Programming with Clause Learning. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 302\u2013313. Springer, Heidelberg (2003)"},{"key":"6_CR26","first-page":"155","volume":"19","author":"F. Ricca","year":"2006","unstructured":"Ricca, F., Faber, W., Leone, N.: A Backjumping Technique for Disjunctive Logic Programming. AI Communications\u00a019, 155\u2013172 (2006)","journal-title":"AI Communications"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T18:43:54Z","timestamp":1596480234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40564-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405631","9783642405648"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40564-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}