{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:29:56Z","timestamp":1763468996973,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"abstract":"<jats:p>Maximum Satisfiability (MaxSAT) is a well-known optimization version of Propositional Satisfiability (SAT), that finds a wide range of relevant practical applications. Despite the significant progress made in MaxSAT solving in recent years, many practically relevant problem instances require prohibitively large run times, and many cannot simply be solved with existing algorithms. One approach for solving MaxSAT is based on iterative SAT solving, which may optionally be guided by unsatisfiable cores. A difficulty with this class of algorithms is the possibly large number of times a SAT solver is called, e.g. for instances with very large clause weights. This paper proposes the use of geometric progressions to tackle this issue, thus allowing, for the vast majority of problem instances, to reduce the number of calls to the SAT solver. The new approach is also shown to be applicable to core-guided MaxSAT algorithms. Experimental results, obtained on a large number of problem instances, show gains when compared to state-of-the-art implementations of MaxSAT algorithms.<\/jats:p>","DOI":"10.3233\/978-1-61499-419-0-453","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T12:06:08Z","timestamp":1740053168000},"source":"Crossref","is-referenced-by-count":10,"title":["Progression in Maximum Satisfiability"],"prefix":"10.3233","author":[{"family":"Ignatiev A.","sequence":"additional","affiliation":[]},{"family":"Morgado A.","sequence":"additional","affiliation":[]},{"family":"Manquinho V.","sequence":"additional","affiliation":[]},{"family":"Lynce I.","sequence":"additional","affiliation":[]},{"family":"Marques-Silva J.","sequence":"additional","affiliation":[]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2014"],"original-title":[],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T12:22:09Z","timestamp":1740054129000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=0922-6389&volume=263&spage=453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-419-0-453","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2014]]}}}