{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:28:54Z","timestamp":1725496134606},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540769262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76928-6_24","type":"book-chapter","created":{"date-parts":[[2007,11,22]],"date-time":"2007-11-22T11:05:04Z","timestamp":1195729504000},"page":"223-233","source":"Crossref","is-referenced-by-count":13,"title":["Clone: Solving Weighted Max-SAT\u00a0in a Reduced Search Space"],"prefix":"10.1007","author":[{"given":"Knot","family":"Pipatsrisawat","sequence":"first","affiliation":[]},{"given":"Adnan","family":"Darwiche","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11814948_25","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"Z. Fu","year":"2006","unstructured":"Fu, Z., Malik, S.: On solving the partial max-sat problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, Springer, Heidelberg (2006)"},{"key":"24_CR2","unstructured":"Le Berre, D.: Sat4j project homepage, http:\/\/www.sat4j.org\/"},{"key":"24_CR3","unstructured":"Argelich, J., Li, C.M., Manya, F., Planes, J.: First evaluation of max-sat solvers, http:\/\/www.iiia.csic.es\/~maxsat06\/"},{"key":"24_CR4","unstructured":"Argelich, J., Li, C.M., Manya, F., Planes, J.: Second evaluation of max-sat solvers, http:\/\/www.maxsat07.udl.es\/"},{"key":"24_CR5","unstructured":"Larrosa, J., Heras, F., de Givry, S.: A Logical Approach to Efficient Max-SAT solving. ArXiv Computer Science e-prints (November 2006)"},{"key":"24_CR6","unstructured":"de Givry, S., Heras, F., Zytnicki, M., Larrosa, J.: Existential arc consistency: Getting closer to full arc consistency in weighted csps. In: IJCAI, pp. 84\u201389 (2005)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Alsinet, T., Manya, F., Planes, J.: A max-sat solver with lazy data structures. In: Proc. of 9th Ibero-American Conf. on Artificial Intelligence (2004)","DOI":"10.1007\/978-3-540-30498-2_34"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Li, C.M., Manya, F., Planes, J.: New inference rules for max-sat. JAIR (2007)","DOI":"10.1613\/jair.2215"},{"key":"24_CR9","unstructured":"Viaga, F.H., Larrosa, J., Oliveras, A.: Minimaxsat: a new weighted max-sat solver. In: Proceedings of SAT 2007 (2007)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b103174","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C.M. Li","year":"2005","unstructured":"Li, C.M., Manya, F., Planes, J.: Exploiting unit propagation to compute lower bounds in branch anb bound max-sat solvers. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, Springer, Heidelberg (2005)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Ram\u00edrez, M., Geffner, H.: Structural relaxations by variable renaming and their compilation for solving mincostsat. In: Proceedings of CP 2007. LNCS, vol.\u00a04741, Springer, Heidelberg (to appear, 2007)","DOI":"10.1007\/978-3-540-74970-7_43"},{"key":"24_CR12","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 knowlege compilation map. Journal of Artificial Intelligence Research\u00a017, 229\u2013264 (2002)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"24_CR13","unstructured":"Darwiche, A.: New advances in compiling CNF to decomposable negational normal form. In: Proceedings of European Conference on Artificial Intelligence (2004)"},{"issue":"1-2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.artint.2004.04.005","volume":"157","author":"A. Darwiche","year":"2004","unstructured":"Darwiche, A., Marquis, P.: Compiling propositional weighted bases. Artificial Intelligence\u00a0157(1-2), 81\u2013113 (2004)","journal-title":"Artificial Intelligence"},{"key":"24_CR15","unstructured":"Choi, A., Chavira, M., Darwiche, A.: Node splitting: A scheme for generating upper bounds in bayesian networks. In: Proceedings of UAI\u201907 (2007)"},{"key":"24_CR16","unstructured":"Darwiche, A.: The c2d compiler. Available at http:\/\/reasoning.cs.ucla.edu\/c2d\/"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Stallman, R., Sussman, G.: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intel.\u00a09 (1977)","DOI":"10.1016\/0004-3702(77)90029-7"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"5","author":"J. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J., Sakallah, K.: Grasp: A search algorithm for propositional satisfiability. IEEE Trans. Computers\u00a05, 506\u2013521 (1999)","journal-title":"IEEE Trans. Computers"},{"key":"24_CR19","unstructured":"Bayardo, R.J.J., Schrag, R.C.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of AAAI\u201997, pp. 203\u2013208 (1997)"},{"key":"24_CR20","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD, pp. 279\u2013285 (2001)"},{"key":"24_CR21","volume-title":"Efficient Algorithms for Clause-Learning SAT Solvers","author":"L. Ryan","year":"2004","unstructured":"Ryan, L.: Efficient Algorithms for Clause-Learning SAT Solvers. Master\u2019s thesis, Simon Fraser University (2004)"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Argelich, J., Manya, F.: Partial max-sat solvers with clause learning. In: Proceedings of SAT\u201907, pp. 28\u201340 (2007)","DOI":"10.1007\/978-3-540-72788-0_7"},{"key":"24_CR23","unstructured":"Larrosa, J., Heras, F.: Resolution in max-sat and its relation to local consistency in weighted csps. In: Proc. of the Intnl. Jnt. Conf. on Artfcl. Intel., pp. 193\u2013198 (2005)"},{"key":"24_CR24","unstructured":"Selman, B., Kautz, H.: Walksat home page, http:\/\/www.cs.rochester.edu\/u\/"},{"key":"24_CR25","unstructured":"Wang, J.: A branching heuristic for testing propositional satisfiability. In: Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century, IEEE International Conference, pp. 4236\u20134238 (1995)"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: 39th Design Automation Conference (DAC) (2001)","DOI":"10.1145\/378239.379017"}],"container-title":["Lecture Notes in Computer Science","AI 2007: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76928-6_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:47:08Z","timestamp":1619506028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76928-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540769262"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76928-6_24","relation":{},"subject":[]}}