{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:54Z","timestamp":1725549714841},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290414"},{"type":"electronic","value":"9783540317333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11558590_13","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T12:53:11Z","timestamp":1128516791000},"page":"122-134","source":"Crossref","is-referenced-by-count":2,"title":["Evaluating Search Strategies and Heuristics for Efficient Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Enrico","family":"Giunchiglia","sequence":"first","affiliation":[]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"203","volume-title":"Proceedings of AAAI 1997","author":"R.J. Bayardo Jr.","year":"1997","unstructured":"Bayardo Jr., R.J., Schrag, R.C.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of AAAI 1997, pp. 203\u2013208. AAAI Press, Menlo Park (1997)"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. Clark","year":"1978","unstructured":"Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293\u2013322. Plenum Press, New York (1978)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Journal of the ACM\u00a05(7) (1962)","DOI":"10.1145\/368273.368557"},{"key":"13_CR4","unstructured":"Esra, E.: Theory and applications of answer set programming. PhD thesis, University of Texas at Austin, PhD thesis (2002)"},{"key":"13_CR5","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. Journal of Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"13_CR6","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Experimenting with heuristics for asp. In: Proc. IJCAI (2001)"},{"key":"13_CR7","unstructured":"Freeman, J.W.: Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania (1995)"},{"key":"13_CR8","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Logic Programming: Proc.\u00a0Fifth Int\u2019l Conf.\u00a0and Symp., pp. 1070\u20131080 (1988)"},{"key":"13_CR9","unstructured":"Giunchiglia, E., Maratea, M.: On the relation between sat and asp procedures. In: AAAI 2005 (2005) (Submitted to)"},{"key":"13_CR10","unstructured":"Giunchiglia, E., Maratea, M., Lierler, Y.: SAT-based answer set programming. In: American Association for Artificial Intelligence (2004)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Maratea, M., Tacchella, A. (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":"13_CR12","first-page":"366","volume-title":"Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997)","author":"C.M. Li","year":"1997","unstructured":"Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 366\u2013371. Morgan Kaufmann Publishers, San Francisco (1997)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"LeBerre, D., Simon, L.: Fifty-five solvers in vancouver: The sat 2004 competition. In: 8th International Conference on Theory an Applications of Satisfiability Testing. Selected Revised Papers. LNCS, Springer, Heidelberg (2005) (to appear)","DOI":"10.1007\/11527695_25"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Lin, F., Zhao, Y.: Asp phase transition: A study on randomly generated programs. In: Proc.\u00a0ICLP 2003 (2003)","DOI":"10.1007\/978-3-540-24599-5_17"},{"key":"13_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 the 38th Design Automation Conference (DAC 2001) (June 2001)","DOI":"10.1145\/378239.379017"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"The Logic Programming Paradigm: a 25.Years perspective","author":"V. Marek","year":"1999","unstructured":"Marek, V., Truszczynski, M.: Stable models as an alternative programming paradigm. In: The Logic Programming Paradigm: a 25.Years perspective. LNCS, Springer, Heidelberg (1999)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence\u00a025, 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence\u00a09(3), 268\u2013299 (1993)","journal-title":"Computational Intelligence"},{"key":"13_CR19","unstructured":"Simons, P.: Extending and implementing the stable model semantics. PhD thesis, Helsinky University, PhD thesis (2000)"},{"key":"13_CR20","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP - a new search algorithm for satisfiability. Technical report, University of Michigan (1996)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: ICCAD (2001)","DOI":"10.1145\/774572.774637"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2005: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558590_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:48:45Z","timestamp":1605642525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558590_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290414","9783540317333"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11558590_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}