{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:27:02Z","timestamp":1725514022247},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540721994"},{"type":"electronic","value":"9783540722007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72200-7_30","type":"book-chapter","created":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T12:54:47Z","timestamp":1181048087000},"page":"303-308","source":"Crossref","is-referenced-by-count":0,"title":["On the Effectiveness of Looking Ahead in Search for Answer Sets"],"prefix":"10.1007","author":[{"given":"Guohua","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Culberson, J.: \n                    \n                      http:\/\/web.cs.ualberta.ca\/joe\/coloring\/index.html"},{"issue":"7","key":"30_CR2","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(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"30_CR3","unstructured":"Freeman, J.: Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania (1995)"},{"key":"30_CR4","unstructured":"Gebser, M., et al.: Conflict-driven answer set solving. In: Proc. IJCAI\u201907, pp. 386\u2013392 (2007)"},{"key":"30_CR5","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. 5th ICLP, pp. 1070\u20131080 (1988)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1007\/978-3-540-45193-8_64","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"E. Giunchiglia","year":"2003","unstructured":"Giunchiglia, E., Tacchella, A., Maratea, M. (In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 842\u2013846. Springer, Heidelberg (2003)"},{"key":"30_CR7","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: Proc. AAAI\u201992, pp. 459\u2013465 (1992)"},{"issue":"1-2","key":"30_CR8","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(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","first-page":"302","volume-title":"Logic Programming","author":"J. Ward","year":"2004","unstructured":"Ward, J., Schlipf, J.: Answer set programming with clause learning. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 302\u2013313. Springer, Heidelberg (2004)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/978-3-540-27775-0_22","volume-title":"Logic Programming","author":"J. You","year":"2004","unstructured":"You, J., Hou, G.: Arc consistency + unit propagation = lookahead. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 314\u2013328. Springer, Heidelberg (2004)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45657-0_2","volume-title":"Computer Aided Verification","author":"L. Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: The quest for efficient boolean satisfiability solvers. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 17\u201336. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72200-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:29:38Z","timestamp":1605745778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72200-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540721994","9783540722007"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72200-7_30","relation":{},"subject":[]}}