{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:10:35Z","timestamp":1725570635408},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175107"},{"type":"electronic","value":"9783642175114"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17511-4_2","type":"book-chapter","created":{"date-parts":[[2010,12,7]],"date-time":"2010-12-07T06:24:40Z","timestamp":1291703080000},"page":"13-26","source":"Crossref","is-referenced-by-count":1,"title":["Speed-Up Techniques for Negation in Grounding"],"prefix":"10.1007","author":[{"given":"Amir","family":"Aavani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahab","family":"Tasharrofi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gulay","family":"Unel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugenia","family":"Ternovska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"The Asparagus Library of Examples for ASP Programs, \n                  \n                    http:\/\/asparagus.cs.uni-potsdam.de\/"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.artint.2004.01.006","volume":"162","author":"M. Cadoli","year":"2005","unstructured":"Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. Artificial Intelligence\u00a0162, 89\u2013120 (2005)","journal-title":"Artificial Intelligence"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-58907-4_6","volume-title":"Database Theory - ICDT \u201995","author":"S. Cluet","year":"1995","unstructured":"Cluet, S., Moerkotte, G.: On the complexity of generating optimal left-deep processing trees with cross products. In: Y. Vardi, M., Gottlob, G. (eds.) ICDT 1995. LNCS, vol.\u00a0893, pp. 54\u201367. Springer, Heidelberg (1995)"},{"key":"2_CR4","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: SIAM-AMC Proceedings of Complexity of Computation, vol.\u00a07, pp. 43\u201373 (1974)"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s10601-008-9047-y","volume":"13","author":"A.M. Frisch","year":"2008","unstructured":"Frisch, A.M., Harvey, W., Jefferson, C., Hern\u00e1ndez, B.M., Miguel, I.: Essence: A constraint language for specifying combinatorial problems. Constraints\u00a013(3), 268\u2013306 (2008)","journal-title":"Constraints"},{"key":"2_CR6","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":"3","key":"2_CR7","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 Trans. Comput. Log.\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"2_CR8","unstructured":"Mohebali, R.: A method for solving np search based on model expansion and grounding. Master\u2019s thesis, Simon Fraser University (2006)"},{"key":"2_CR9","unstructured":"Patterson, M., Liu, Y., Ternovska, E., Gupta, A.: Grounding for model expansion in k-guarded formulas with inductive definitions. In: Proc. IJCAI 2007, pp. 161\u2013166 (2007)"},{"key":"2_CR10","unstructured":"Wittocx, J., Mari\u00ebn, M., Denecker, M.: Grounding with bounds. In: Proc. AAAI 2008, pp. 572\u2013577 (2008)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17511-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T18:16:27Z","timestamp":1553278587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17511-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175107","9783642175114"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17511-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}