{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:23:50Z","timestamp":1725708230724},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642351006"},{"type":"electronic","value":"9783642351013"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35101-3_17","type":"book-chapter","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T11:40:16Z","timestamp":1354189216000},"page":"194-205","source":"Crossref","is-referenced-by-count":0,"title":["On the Violation of Circuits in Decomposable Negation Normal Form"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Bordeaux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Narodytska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ic.2008.12.001","volume":"207","author":"M. \u00c5gren","year":"2009","unstructured":"\u00c5gren, M., Flener, P., Pearson, J.: Revisiting constraint-directed search. Information and Computation\u00a0207(3), 438\u2013457 (2009)","journal-title":"Information and Computation"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-02777-2_25","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"A. Belov","year":"2009","unstructured":"Belov, A., Stachniak, Z.: Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 258\u2013264. Springer, Heidelberg (2009)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-14186-7_24","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"A. Belov","year":"2010","unstructured":"Belov, A., Stachniak, Z.: Improved Local Search for Circuit Satisfiability. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 293\u2013299. Springer, Heidelberg (2010)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Darwiche, A.: Decomposable negation normal form. J. ACM\u00a048(4) (2001)","DOI":"10.1145\/502090.502091"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A. Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. J. of Artif. Intel. Research (JAIR)\u00a017, 229\u2013264 (2002)","journal-title":"J. of Artif. Intel. Research (JAIR)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"He, J., Flener, P., Pearson, J.: Toward an automaton constraint for local search. In: Workshop on LS Techniques for Constraint Satisfaction, pp. 13\u201325 (2009)","DOI":"10.4204\/EPTCS.5.2"},{"key":"17_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-89439-1_3","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. J\u00e4rvisalo","year":"2008","unstructured":"J\u00e4rvisalo, M., Junttila, T.A., Niemel\u00e4, I.: Justification-Based Local Search with Adaptive Noise Strategies. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 31\u201346. Springer, Heidelberg (2008)"},{"key":"17_CR8","unstructured":"J\u00e4rvisalo, M., Junttila, T.A., Niemel\u00e4, I.: Justification-based non-clausal local search for SAT. In: Euro. Conf. on Artif. Intel. (ECAI), pp. 535\u2013539 (2008)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: The NP-completeness column: Finding needles in haystacks. ACM Trans. on Algorithms (TALG)\u00a03(2) (2004)","DOI":"10.1145\/1240233.1240247"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. of Computer and System Sciences\u00a037(1), 79\u2013100 (1988)","journal-title":"J. of Computer and System Sciences"},{"key":"17_CR11","unstructured":"Jung, J.-C., Barahona, P., Katsirelos, G., Walsh, T.: Two encodings of DNNF theories. In: ECAI Workshop on Inference Methods Based on Graphical Structures of Knowledge (2008)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: The weighted grammar constraint. Annals of Operations Research (2010) (to appear)","DOI":"10.1007\/s10479-010-0697-y"},{"key":"17_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-36668-3_15","volume-title":"PRICAI 2006: Trends in Artificial Intelligence","author":"R. Muhammad","year":"2006","unstructured":"Muhammad, R., Stuckey, P.J.: A Stochastic Non-CNF SAT Solver. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS (LNAI), vol.\u00a04099, pp. 120\u2013129. Springer, Heidelberg (2006)"},{"key":"17_CR14","unstructured":"Pham, D.N., Thornton, J., Sattar, A.: Building structure into local search for SAT. In: Int. Joint. Conf. on Artif. Intel. (IJCAI), pp. 2359\u20132364 (2007)"},{"key":"17_CR15","unstructured":"Pham, D.N., Thornton, J., Sattar, A.: Efficiently exploiting dependencies in local search for sat. In: AAAI Conf. on Artif. Intel. (AAAI), pp. 1476\u20131478 (2008)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-540-74970-7_42","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"C.-G. Quimper","year":"2007","unstructured":"Quimper, C.-G., Walsh, T.: Decomposing Global Grammar Constraints. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 590\u2013604. Springer, Heidelberg (2007)"},{"key":"17_CR17","unstructured":"Stachniak, Z.: Going non-clausal. In: Conf. on Theory and Applications of Satisfiability Testing (SAT), pp. 316\u2013322 (2002)"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-79719-7_24","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"Z. Stachniak","year":"2008","unstructured":"Stachniak, Z., Belov, A.: Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 257\u2013270. Springer, Heidelberg (2008)"},{"key":"17_CR19","unstructured":"Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press (2005)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"van Hoeve, W.-J.: Over-constrained problems. In: Hybrid optimization: the 10 Years of CPAIOR, ch.\u00a06 (2010) (to appear)","DOI":"10.1007\/978-1-4419-1644-0_6"}],"container-title":["Lecture Notes in Computer Science","AI 2012: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35101-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T06:27:40Z","timestamp":1557383260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35101-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642351006","9783642351013"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35101-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}