{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:59:19Z","timestamp":1725638359632},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258312"},{"type":"electronic","value":"9783642258329"}],"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-25832-9_51","type":"book-chapter","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T23:27:59Z","timestamp":1322868479000},"page":"501-510","source":"Crossref","is-referenced-by-count":0,"title":["From Approximate Clausal Reasoning to Problem Hardness"],"prefix":"10.1007","author":[{"given":"David","family":"Rajaratnam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Pagnucco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","series-title":"LNAI","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60058-2","volume-title":"Tractable Reasoning in Aritificial Intelligence","author":"M. Cadoli","year":"1995","unstructured":"Cadoli, M.: Tractable Reasoning in Aritificial Intelligence. LNCS (LNAI), vol.\u00a0941. Springer, Heidelberg (1995)"},{"key":"51_CR2","unstructured":"Chopra, S., Parikh, R., Wassermann, R.: Approximate belief revision. In: Proc. of the Workshop on Language, Logic and Information, WoLLIC (2000)"},{"issue":"7","key":"51_CR3","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. CACM\u00a05(7), 394\u2013397 (1962)","journal-title":"CACM"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Finger, M.: Polynomial approximations of full propositional logic via limited bivalence. In: Proc. 9th European Conf. on Logics in AI, pp. 526\u2013538 (2004)","DOI":"10.1007\/978-3-540-30227-8_44"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Finger, M.: Towards polynomial approximations of full propositional logic. In: 17th Brazilian Symposium on AI, pp. 11\u201320 (2004)","DOI":"10.1007\/978-3-540-28645-5_2"},{"key":"51_CR6","unstructured":"Finger, M., Wassermann, R.: Tableaux for approximate reasoning. In: Proceedings of the IJCAI 2001 Workshop on Inconsistency in Data and Knowledge, Seattle, WA, USA, August 6-10, pp. 71\u201379 (2001)"},{"issue":"4","key":"51_CR7","first-page":"373","volume":"44","author":"M. J\u00e4rvisalo","year":"2005","unstructured":"J\u00e4rvisalo, M., Junttila, T.A., Niemel\u00e4, I.: Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Math. and AI\u00a044(4), 373\u2013399 (2005)","journal-title":"Annals of Math. and AI"},{"key":"51_CR8","unstructured":"Kilby, P., Slaney, J.K., Thi\u00e9baux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: Proc. 20th Nat. Conf. on AI, pp. 1368\u20131373 (2005)"},{"issue":"2","key":"51_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(99)00088-5","volume":"71","author":"C.M. Li","year":"1999","unstructured":"Li, C.M.: A constraint-based approach to narrow search trees for satisfiability. Information Processing Letters\u00a071(2), 75\u201380 (1999)","journal-title":"Information Processing Letters"},{"issue":"1","key":"51_CR10","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/1119439.1119442","volume":"7","author":"P. Liberatore","year":"2006","unstructured":"Liberatore, P.: Complexity results on DPLL and resolution. ACM Trans. on Computational Logic\u00a07(1), 84\u2013107 (2006)","journal-title":"ACM Trans. on Computational Logic"},{"key":"51_CR11","unstructured":"Mondadori, M.: Classical analytical deduction. Tech. rep., Annali dell\u2019 Universit\u00e0 di Ferrara, Nuova Serie, sezione III, Filosofia, Paper, n. 1 (1988)"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Riani, J., Wassermann, R.: Using relevance to speed up inference. some empirical results. In: 17th Brazilian Symposium on AI, pp. 21\u201330 (2004)","DOI":"10.1007\/978-3-540-28645-5_3"},{"key":"51_CR13","unstructured":"Ruan, Y., Kautz, H.A., Horvitz, E.: The backdoor key: A path to understanding problem hardness. In: Proc. 19th Nat. Conf. on AI, pp. 124\u2013130 (2004)"},{"issue":"1-3","key":"51_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10817-005-9007-9","volume":"35","author":"S. Szeider","year":"2005","unstructured":"Szeider, S.: Backdoor sets for DLL subsolvers. J. of Automated Reasoning\u00a035(1-3), 73\u201388 (2005)","journal-title":"J. of Automated Reasoning"},{"key":"51_CR15","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: Proc. 18th Int. Joint Conf. on AI, pp. 1173\u20131178 (2003)"}],"container-title":["Lecture Notes in Computer Science","AI 2011: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25832-9_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T02:26:35Z","timestamp":1560997595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25832-9_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258312","9783642258329"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25832-9_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}