{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:17:42Z","timestamp":1725520662137},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540894384"},{"type":"electronic","value":"9783540894391"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89439-1_1","type":"book-chapter","created":{"date-parts":[[2008,11,14]],"date-time":"2008-11-14T22:03:10Z","timestamp":1226700190000},"page":"1-15","source":"Crossref","is-referenced-by-count":3,"title":["Symmetry Breaking for Maximum Satisfiability"],"prefix":"10.1007","author":[{"given":"Joao","family":"Marques-Silva","sequence":"first","affiliation":[]},{"given":"In\u00eas","family":"Lynce","sequence":"additional","affiliation":[]},{"given":"Vasco","family":"Manquinho","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Aloul, F., Sakallah, K.A., Markov, I.: Efficient symmetry breaking for boolean satisfiability. In: International Joint Conference on Artificial Intelligence, pp. 271\u2013276 (August 2003)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: ShatterPB: symmetry-breaking for pseudo-Boolean formulas. In: Asian and South-Pacific Design Automation Conference, pp. 883\u2013886 (2004)","DOI":"10.1145\/775832.776042"},{"key":"1_CR3","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F., Planes, J.: MaxSAT evaluation (May 2007), www.maxsat07.udl.es"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Benhamou, B., Sais, L.: Theoretical study of symmetries in propositional calculus and applications. In: Eleventh International Conference on Automated Deduction, pp. 281\u2013294 (1992)","DOI":"10.1007\/3-540-55602-8_172"},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009725216438","volume":"2","author":"B. Borchers","year":"1998","unstructured":"Borchers, B., Furman, J.: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. Journal of Combinatorial Optimization\u00a02(4), 299\u2013306 (1998)","journal-title":"Journal of Combinatorial Optimization"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, D.A., Jeavons, P., Jefferson, C., Petrie, K.E., Smith, B.M.: Symmetry definitions for constraint satisfaction problems. In: International Conference on Principles and Practice of Constraint Programming, pp. 17\u201331 (2005)","DOI":"10.1007\/11564751_5"},{"key":"1_CR7","unstructured":"Crawford, J.M., Ginsberg, M.L., Luks, E., Roy, A.: Symmetry-breaking predicates for search problems. In: International Conference on Principles of Knowledge Representation and Reasoning, pp. 148\u2013159 (1996)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for CNF. In: Design Automation Conference, pp. 530\u2013534 (June 2004)","DOI":"10.1145\/996566.996712"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Darga, P.T., Sakallah, K.A., Markov, I.L.: Faster symmetry discovery using sparsity of symmetries. In: Design Automation Conference, pp. 149\u2013154 (June 2008)","DOI":"10.1145\/1391469.1391509"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Kelsey, T., Linton, S., McDonald, I., Miguel, I., Smith, B.M.: Conditional symmetry breaking. In: International Conference on Principles and Practice of Constraint Programming, pp. 256\u2013270 (2005)","DOI":"10.1007\/11564751_21"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S1574-6526(06)80014-3","volume-title":"Handbook of Constraint Programming","author":"I.P. Gent","year":"2006","unstructured":"Gent, I.P., Petrie, K.E., Puget, J.-F.: Symmetry in Constraint Programming. In: Handbook of Constraint Programming, pp. 329\u2013376. Elsevier, Amsterdam (2006)"},{"key":"1_CR12","unstructured":"Gent, I.P., Smith, B.M.: Symmetry breaking in constraint programming. In: European Conference on Artificial Intelligence, pp. 599\u2013603 (2000)"},{"key":"1_CR13","unstructured":"Heras, F., Larrosa, J.: New inference rules for efficient Max-SAT solving. In: AAAI Conference on Artificial Intelligence (2006)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSat: a new weighted Max-SAT solver. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 41\u201355 (May 2007)","DOI":"10.1007\/978-3-540-72788-0_8"},{"issue":"3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF00265682","volume":"22","author":"B. Krishnamurthy","year":"1985","unstructured":"Krishnamurthy, B.: Short proofs for tricky formulas. Acta Informatica\u00a022(3), 253\u2013275 (1985)","journal-title":"Acta Informatica"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers. In: International Conference on Principles and Practice of Constraint Programming, pp. 403\u2013414 (2005)","DOI":"10.1007\/11564751_31"},{"key":"1_CR17","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In: AAAI Conference on Artificial Intelligence (July 2006)"},{"key":"1_CR18","unstructured":"Lin, H., Su, K.: Exploiting inference rules to compute lower bounds for MAX-SAT solving. In: International Joint Conference on Artificial Intelligence, pp. 2334\u20132339 (2007)"},{"key":"1_CR19","unstructured":"Marques-Silva, J., Lynce, I., Manquinho, V.: Symmetry breaking for maximum satisfiability. Computing Research Repository, abs\/0804.0599 (April 2008), http:\/\/arxiv.org\/abs\/0804.0599"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Manquinho, V.M.: Towards more effective unsatisfiability-based maximum satisfiability algorithms. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 225\u2013230 (2008)","DOI":"10.1007\/978-3-540-79719-7_21"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Planes, J.: Algorithms for maximum satisfiability using unsatisfiable cores. In: Design, Automation and Testing in Europe Conference, pp. 408\u2013413 (March 2008)","DOI":"10.1145\/1403375.1403474"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Puget, J.-F.: On the satisfiability of symmetrical constrained satisfaction problems. In: International Symposium on Methodologies for Intelligent Systems, pp. 350\u2013361 (1993)","DOI":"10.1007\/3-540-56804-2_33"},{"key":"1_CR23","unstructured":"Smith, B.M.: Reducing symmetry in a combinatorial design problem. Technical Report 2001.01, School of Computing, University of Leeds (January 2001) (Presented at the CP-AI-OR Workshop April 2001)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Smith, B.M., Bistarelli, S., O\u2019Sullivan, B.: Constraint symmetry for the soft CSP. In: International Conference on Principles and Practice of Constraint Programming, pp. 872\u2013879 (September 2007)","DOI":"10.1007\/978-3-540-74970-7_66"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Wallace, R., Freuder, E.: Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. In: Johnson, D., Trick, M. (eds.) Cliques, Coloring and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026, pp. 587\u2013615. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026\/28"},{"issue":"1-2","key":"1_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.artint.2005.01.004","volume":"164","author":"Z. Xing","year":"2005","unstructured":"Xing, Z., Zhang, W.: MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence\u00a0164(1-2), 47\u201380 (2005)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89439-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T23:01:40Z","timestamp":1684623700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89439-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540894384","9783540894391"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89439-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}