{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:09:06Z","timestamp":1709813346669},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2006,9,1]],"date-time":"2006-09-01T00:00:00Z","timestamp":1157068800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10732-006-7234-9","type":"journal-article","created":{"date-parts":[[2006,5,7]],"date-time":"2006-05-07T16:42:05Z","timestamp":1147020125000},"page":"375-392","source":"Crossref","is-referenced-by-count":22,"title":["Exact Max-SAT solvers for over-constrained problems"],"prefix":"10.1007","volume":"12","author":[{"given":"Josep","family":"Argelich","sequence":"first","affiliation":[]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7234_CR1","unstructured":"Alber, J., J. Gramm, and R. Niedermeier. (1998). \u201cFaster Exact Algorithms for Hard Problems: A Parameterized Point of View.\u201d In 25th Conf. on Current Trends in Theory and Practice of Informatics, LNCS, Springer-Verlag, pp. 168\u2013185."},{"key":"7234_CR2","unstructured":"Alsinet, T., F. Many\u00e0, and J. Planes. (2003). \u201cImproved Branch and Bound Algorithms for Max-SAT.\u201d In Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing."},{"key":"7234_CR3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1009725216438","volume":"2","author":"B. Borchers","year":"1999","unstructured":"Borchers, B. and J. Furman. (1999). \u201cA Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems.\u201d Journal of Combinatorial Optimization 2, 299\u2013306.","journal-title":"Journal of Combinatorial Optimization"},{"key":"7234_CR4","unstructured":"Cha, B., K. Iwama, Y. Kambayashi, and S. Miyazaki. (1997). \u201cLocal Search Algorithms for Partial MAXSAT.\u201d In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'97, Providence\/RI, USA, AAAI Press, pp. 263\u2013268."},{"key":"7234_CR5","unstructured":"Culberson, J. (1995). \u201cGraph Coloring Page: The Flat Graph Generator.\u201d See http:\/\/web.cs.ualberta.ca\/\u02dcjoe\/ Coloring\/Generators\/flat.html."},{"key":"7234_CR6","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., G. Logemann, and D. Loveland. (1962). \u201cA Machine Program for Theorem-Proving.\u201d Communications of the ACM 5, 394\u2013397.","journal-title":"Communications of the ACM"},{"key":"7234_CR7","doi-asserted-by":"crossref","unstructured":"de Givry, S., J. Larrosa, P. Meseguer, and T. Schiex. (2003). \u201cSolving Max-SAT as Weighted CSP.\u201d In 9th International Conference on Principles and Practice of Constraint Programming, CP-2003, Kinsale, Ireland, Springer LNCS 2833, pp. 363\u2013376.","DOI":"10.1007\/978-3-540-45193-8_25"},{"key":"7234_CR8","unstructured":"Gent, I. P. (2002). \u201cArc Consistency in SAT.\u201d In Proceedings of the 15th European Conference on Artificial Intelligence (ECAI), Lyon, France, pp. 121\u2013125."},{"key":"7234_CR9","unstructured":"Gomes, C. P. and B. Selman. (1997). \u201cProblem Structure in the Presence of Perturbations.\u201d In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'97, Providence\/RI, USA, AAAI Press, pp. 221\u2013226."},{"key":"7234_CR10","unstructured":"Hwang, J. and D. G. Mitchell. (2005). \u201c2-way vs. d-way Branching for CSP.\u201d In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, CP-2005, Sitges, Spain, Springer LNCS 3709, pp. 343\u2013357."},{"key":"7234_CR11","unstructured":"Jiang, Y., H. Kautz, and B. Selman. (1995). \u201cSolving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for Max-SAT.\u201d In Proceedings of the 1st International Workshop on Artificial Intelligence and Operations Research."},{"key":"7234_CR12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0004-3702(90)90009-O","volume":"45","author":"S. Kasif","year":"1990","unstructured":"Kasif, S. (1990). \u201cOn the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks.\u201d Artificial Intelligence 45, 275\u2013286.","journal-title":"Artificial Intelligence"},{"key":"7234_CR13","doi-asserted-by":"crossref","unstructured":"Larrosa, J. and P. Meseguer. (1999). \u201cPartition-based Lower Bound for Max-CSP.\u201d In 5th International Conference on Principles and Practice of Constraint Programming, CP'99, Alexandria, USA, Springer LNCS 1713, pp. 303\u2013315.","DOI":"10.1007\/978-3-540-48085-3_22"},{"key":"7234_CR14","unstructured":"Larrosa, J. and T. Schiex. (2003). \u201cIn the Quest of the Best form of Local Consistency for Weighted CSP.\u201d In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'03, Acapulco, M\u00e9xico, pp. 239\u2013244."},{"key":"7234_CR15","doi-asserted-by":"crossref","unstructured":"Li, C. M., F. Many\u00e0, and J. Planes. (2005). \u201cExploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.\u201d In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, CP-2005, Sitges, Spain, Springer LNCS 3709, pp. 403\u2013414.","DOI":"10.1007\/11564751_31"},{"key":"7234_CR16","unstructured":"Loveland, D. W. (1978). Automated Theorem Proving. A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North-Holland."},{"issue":"1","key":"7234_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1021902812784","volume":"8","author":"P. Meseguer","year":"2003","unstructured":"Meseguer, P., N. Bouhmala, T. Bouzoubaa, M. Irgens, and M. S\u00e1nchez. (2003). \u201cCurrent Approaches for Solving Over-Constrained Problems.\u201d Constraints 8(1), 9\u201339.","journal-title":"Constraints"},{"key":"7234_CR18","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., C. Madigan, Y. Zhao, L. Zhang, and S. Malik. (2001). \u201cChaff: Engineering an Efficient Sat Solver.\u201d In 39th Design Automation Conference.","DOI":"10.1145\/378239.379017"},{"key":"7234_CR19","unstructured":"Selman, B., H. Levesque, and D. Mitchell. (1992). \u201cA New Method for Solving Hard Satisfiability Problems.\u201d In Proceedings of the 10th National Conference on Artificial Intelligence, AAAI'92, San Jose\/CA, USA, AAAI Press, pp. 440\u2013446."},{"key":"7234_CR20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","volume":"81","author":"B. Smith","year":"1996","unstructured":"Smith, B. and M. Dyer. (1996). \u201cLocating the Phase Transition in Binary Constraint Satisfaction Problems.\u201d Artificial Intelligence 81, 155\u2013181.","journal-title":"Artificial Intelligence"},{"key":"7234_CR21","doi-asserted-by":"crossref","unstructured":"Wallace, R. and E. Freuder. (1996). \u201cComparative Studies of Constraint Satisfaction and Davis-Putnam Algorithms for Maximum Satisfiability Problems.\u201d In D. Johnson and M. Trick, editors, Cliques, Coloring and Satisfiability, volume 26, pp. 587\u2013615.","DOI":"10.1090\/dimacs\/026\/28"},{"issue":"(1-2)","key":"7234_CR22","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.artint.2005.01.004","volume":"164","author":"Z. Xing","year":"2005","unstructured":"Xing, Z. and W. Zhang. (2005). \u201cMaxSolver: An Efficient Exact Algorithm for (Weighted) Maximum Satisfiability.\u201d Artificial Intelligence 164(1-2), 47\u201380.","journal-title":"Artificial Intelligence"},{"key":"7234_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, H., H. Shen, and F. Manya. (2003). \u201cExact Algorithms for Max-SAT.\u201d In 4th Int. Workshop on First order Theorem Proving, June.","DOI":"10.1016\/S1571-0661(04)80663-7"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-006-7234-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-006-7234-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-006-7234-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:27Z","timestamp":1559256867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-006-7234-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9]]},"references-count":23,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["7234"],"URL":"http:\/\/dx.doi.org\/10.1007\/s10732-006-7234-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9]]}}}
