{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T06:43:36Z","timestamp":1725432216298},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"value":"9781643684482","type":"print"},{"value":"9781643684499","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:00:00Z","timestamp":1697673600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,10,19]]},"abstract":"<jats:p>We define a tableau calculus for solving the Maximum Satisfiability problem of regular propositional logic (Regular MaxSAT). Given a multiset of regular clauses \u03a6, we prove that the calculus is sound in the sense that if the minimum number of contradictions derived among the branches of a completed tableau for \u03a6 is m, then the minimum number of unsatisfied clauses in \u03a6 is m. We also prove that it is complete in the sense that if the minimum number of unsatisfied clauses in \u03a6 is m, then the minimum number of contradictions among the branches of any completed tableau for \u03a6 is m. Furthermore, we describe how to extend the proposed calculus to solve Regular MaxSAT in the case where we consider weighted formulas.<\/jats:p>","DOI":"10.3233\/faia230706","type":"book-chapter","created":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T08:15:22Z","timestamp":1698048922000},"source":"Crossref","is-referenced-by-count":1,"title":["A Complete Tableau Calculus for the Regular MaxSAT Problem"],"prefix":"10.3233","author":[{"given":"Jordi","family":"Coll","sequence":"first","affiliation":[{"name":"Artificial Intelligence Research Institute (IIIA), CSIC, Bellaterra, Spain"}]},{"given":"Chu-Min","family":"Li","sequence":"additional","affiliation":[{"name":"Aix Marseille Univ, Universit\u00e9 de Toulon, CNRS, LIS, Marseille, France"},{"name":"MIS, Universit\u00e9 de Picardie, Amiens, France"}]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Research Institute (IIIA), CSIC, Bellaterra, Spain"}]},{"given":"Elifnaz","family":"Yangin","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Research Institute (IIIA), CSIC, Bellaterra, Spain"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Artificial Intelligence Research and Development"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA230706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T08:15:23Z","timestamp":1698048923000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA230706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,19]]},"ISBN":["9781643684482","9781643684499"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia230706","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,19]]}}}