{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:25:02Z","timestamp":1781281502690,"version":"3.54.1"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T00:00:00Z","timestamp":1691366400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Gobierno de Espa\u00f1a Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-CHIA-0013-01"],"award-info":[{"award-number":["ANR-19-CHIA-0013-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["PID2019-111544GB-C21"],"award-info":[{"award-number":["PID2019-111544GB-C21"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["TED2021-129319B-I00"],"award-info":[{"award-number":["TED2021-129319B-I00"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1016\/j.ijar.2023.109010","type":"journal-article","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T20:49:27Z","timestamp":1691614167000},"page":"109010","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["MaxSAT resolution for regular propositional logic"],"prefix":"10.1016","volume":"162","author":[{"given":"Jordi","family":"Coll","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chu-Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8366-1458","authenticated-orcid":false,"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elifnaz","family":"Yangin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ijar.2023.109010_br0010","first-page":"89","article-title":"Description and evaluation of a branch and bound Max-SAT solver","volume":"9","author":"Abram\u00e9","year":"2014","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"10.1016\/j.ijar.2023.109010_br0020","series-title":"Proceedings of the 37th International Symposium on Multiple-Valued Logic (ISMVL)","first-page":"22","article-title":"A complete resolution calculus for Signed Max-SAT","author":"Ans\u00f3tegui","year":"2007"},{"key":"10.1016\/j.ijar.2023.109010_br0030","series-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence","first-page":"32","article-title":"The logic behind weighted CSP","author":"Ans\u00f3tegui","year":"2007"},{"key":"10.1016\/j.ijar.2023.109010_br0040","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ins.2012.12.004","article-title":"Resolution procedures for multiple-valued optimization","volume":"227","author":"Ans\u00f3tegui","year":"2013","journal-title":"Inf. Sci."},{"issue":"1\u20134","key":"10.1016\/j.ijar.2023.109010_br0050","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10472-007-9062-5","article-title":"Exploiting multivalued knowledge in variable selection heuristics for SAT solvers","volume":"49","author":"Ans\u00f3tegui","year":"2007","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.ijar.2023.109010_br0060","series-title":"9th International Conference on Principles and Practice of Constraint Programming, CP-2003","first-page":"96","article-title":"Boosting Chaff's performance by incorporating CSP heuristics","volume":"vol. 2833","author":"Ans\u00f3tegui","year":"2003"},{"key":"10.1016\/j.ijar.2023.109010_br0070","series-title":"Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing (Revised Selected Papers)","first-page":"1","article-title":"Mapping problems with finite-domain variables into problems with Boolean variables","volume":"vol. 3542","author":"Ans\u00f3tegui","year":"2004"},{"issue":"4","key":"10.1016\/j.ijar.2023.109010_br0080","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10732-022-09495-3","article-title":"Incomplete MaxSAT approaches for combinatorial testing","volume":"28","author":"Ans\u00f3tegui","year":"2022","journal-title":"J. Heuristics"},{"key":"10.1016\/j.ijar.2023.109010_br0090","series-title":"Handbook of Satisfiability","first-page":"929","article-title":"Maximum satisfiability","author":"Bacchus","year":"2021"},{"key":"10.1016\/j.ijar.2023.109010_br0100","series-title":"Proceedings, 29th International Symposium on Multiple-Valued Logics (ISMVL)","first-page":"248","article-title":"Transformations between signed and classical clause logic","author":"Beckert","year":"1999"},{"key":"10.1016\/j.ijar.2023.109010_br0110","series-title":"Proceedings, 30th International Symposium on Multiple-Valued Logics (ISMVL)","first-page":"331","article-title":"The 2-SAT problem of regular signed CNF formulas","author":"Beckert","year":"2000"},{"key":"10.1016\/j.ijar.2023.109010_br0120","series-title":"Labelled Deduction","first-page":"61","article-title":"The SAT problem of signed CNF formulas","volume":"vol. 17","author":"Beckert","year":"2000"},{"key":"10.1016\/j.ijar.2023.109010_br0130","series-title":"Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning","first-page":"33","article-title":"Solving combinatorial problems with regular local search algorithms","volume":"vol. 1705","author":"B\u00e9jar","year":"1999"},{"key":"10.1016\/j.ijar.2023.109010_br0140","series-title":"7th International Conference on Principles and Practice of Constraint Programming, CP-2001","first-page":"137","article-title":"Capturing structure with satisfiability","volume":"vol. 2239","author":"B\u00e9jar","year":"2001"},{"key":"10.1016\/j.ijar.2023.109010_br0150","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1613\/jair.1.12670","article-title":"Constraint solving approaches to the business-to-business meeting scheduling problem","volume":"74","author":"Bofill","year":"2022","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.ijar.2023.109010_br0160","series-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence","first-page":"6565","article-title":"MaxSAT resolution with the dual rail encoding","author":"Bonet","year":"2018"},{"key":"10.1016\/j.ijar.2023.109010_br0170","series-title":"Proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing","first-page":"166","article-title":"Equivalence between systems stronger than resolution","volume":"vol. 12178","author":"Bonet","year":"2020"},{"issue":"8\u20139","key":"10.1016\/j.ijar.2023.109010_br0180","first-page":"240","article-title":"Resolution for Max-SAT","volume":"171","author":"Bonet","year":"2007","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ijar.2023.109010_br0190","series-title":"Proceedings of the IEEE 13th International Conference on Information Reuse & Integration","first-page":"33","article-title":"Model-based diagnosis with default information implemented through MAX-SAT technology","author":"D'Almeida","year":"2012"},{"issue":"3","key":"10.1016\/j.ijar.2023.109010_br0200","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1093\/jigpal\/jzab012","article-title":"New tableau characterizations for non-clausal MaxSAT problem","volume":"30","author":"Fiorino","year":"2022","journal-title":"Log. J. IGPL"},{"key":"10.1016\/j.ijar.2023.109010_br0210","article-title":"Automated Deduction in Multiple-Valued Logics","volume":"vol. 10","author":"H\u00e4hnle","year":"1994"},{"issue":"6","key":"10.1016\/j.ijar.2023.109010_br0220","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1093\/logcom\/4.6.905","article-title":"Short conjunctive normal forms in finitely-valued logics","volume":"4","author":"H\u00e4hnle","year":"1994","journal-title":"J. Log. Comput."},{"key":"10.1016\/j.ijar.2023.109010_br0230","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ijar.2023.109010_br0240","series-title":"Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing","first-page":"164","article-title":"On tackling the limits of resolution in SAT solving","volume":"vol. 10491","author":"Ignatiev","year":"2017"},{"key":"10.1016\/j.ijar.2023.109010_br0250","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0743-1066(92)90007-P","article-title":"Theory of generalized annotated logic programming and its applications","volume":"12","author":"Kifer","year":"1992","journal-title":"J. Log. Program."},{"issue":"2\u20133","key":"10.1016\/j.ijar.2023.109010_br0260","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.artint.2007.05.006","article-title":"A logical approach to efficient Max-SAT solving","volume":"172","author":"Larrosa","year":"2008","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ijar.2023.109010_br0270","series-title":"Proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing","first-page":"218","article-title":"Towards a better understanding of (partial weighted) MaxSAT proof systems","volume":"vol. 12178","author":"Larrosa","year":"2020"},{"key":"10.1016\/j.ijar.2023.109010_br0280","series-title":"Handbook of Satisfiability","first-page":"903","article-title":"MaxSAT, hard and soft constraints","author":"Li","year":"2021"},{"key":"10.1016\/j.ijar.2023.109010_br0290","series-title":"Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing","first-page":"467","article-title":"Exploiting cycle structures in Max-SAT","volume":"vol. 5584","author":"Li","year":"2009"},{"key":"10.1016\/j.ijar.2023.109010_br0300","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1613\/jair.2215","article-title":"New inference rules for Max-SAT","volume":"30","author":"Li","year":"2007","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.ijar.2023.109010_br0310","series-title":"Proceedings of the 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","first-page":"58","article-title":"A tableau calculus for non-clausal maximum satisfiability","volume":"vol. 11714","author":"Li","year":"2019"},{"key":"10.1016\/j.ijar.2023.109010_br0320","series-title":"Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming","first-page":"38:1","article-title":"Combining clause learning and branch and bound for MaxSAT","volume":"vol. 210","author":"Li","year":"2021"},{"issue":"4","key":"10.1016\/j.ijar.2023.109010_br0330","first-page":"307","article-title":"The 2-SAT problem in signed CNF formulas","volume":"5","author":"Many\u00e0","year":"2000","journal-title":"Mult.-Valued Log. Int. J."},{"issue":"1","key":"10.1016\/j.ijar.2023.109010_br0340","doi-asserted-by":"crossref","first-page":"83","DOI":"10.3233\/FI-2020-1933","article-title":"Solving the team composition problem in a classroom","volume":"174","author":"Many\u00e0","year":"2020","journal-title":"Fundam. Inform."},{"issue":"3\u20134","key":"10.1016\/j.ijar.2023.109010_br0350","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10472-011-9233-2","article-title":"Boolean lexicographic optimization: algorithms & applications","volume":"62","author":"Marques-Silva","year":"2011","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.ijar.2023.109010_br0360","series-title":"Proceedings of 7th International Conference on Formal Methods in Computer-Aided Design","first-page":"13","article-title":"Improved design debugging using maximum satisfiability","author":"Safarpour","year":"2007"},{"key":"10.1016\/j.ijar.2023.109010_br0370","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/s10601-008-9061-0","article-title":"Compiling finite linear CSP into SAT","volume":"14","author":"Tamura","year":"2009","journal-title":"Constraints"},{"key":"10.1016\/j.ijar.2023.109010_br0380","series-title":"Proceedings of the 26th AAAI Conference on Artificial Intelligence","first-page":"1846","article-title":"MAXSAT heuristics for cost optimal planning","author":"Zhang","year":"2012"}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X2300141X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X2300141X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:06:47Z","timestamp":1760162807000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X2300141X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":38,"alternative-id":["S0888613X2300141X"],"URL":"https:\/\/doi.org\/10.1016\/j.ijar.2023.109010","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[2023,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"MaxSAT resolution for regular propositional logic","name":"articletitle","label":"Article Title"},{"value":"International Journal of Approximate Reasoning","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ijar.2023.109010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"109010"}}