{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T00:50:30Z","timestamp":1763686230272},"reference-count":16,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T00:00:00Z","timestamp":1615161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,21]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In this paper, we provide non-clausal tableau calculi for the maximum satisfiability problem and its variants. We discuss both basic calculi to characterize the problem and their modifications to reduce the proof size.<\/jats:p>","DOI":"10.1093\/jigpal\/jzab012","type":"journal-article","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T17:40:21Z","timestamp":1611855621000},"page":"422-436","source":"Crossref","is-referenced-by-count":8,"title":["New Tableau Characterizations for Non-clausal <scp>MaxSAT<\/scp> Problem"],"prefix":"10.1093","volume":"30","author":[{"given":"Guido","family":"Fiorino","sequence":"first","affiliation":[{"name":"DISCO, Universit\u00e0 degli Studi di Milano-Bicocca, Viale Sarca, 336, 20126 Milano, Italy"}]}],"member":"286","published-online":{"date-parts":[[2021,3,8]]},"reference":[{"key":"2022052312303874900_ref1","first-page":"151","article-title":"SMT technology for many-valued logics","volume":"24","author":"Ans\u00f3tegui","year":"2015","journal-title":"Multiple-Valued Logic and Soft Computing"},{"key":"2022052312303874900_ref2","first-page":"133","article-title":"MinSAT versus maxSAT for optimization Problems","volume-title":"19th International Conference on Principles and Practice of Constraint Programming, CP 2013","author":"Argelich","year":"2013"},{"key":"2022052312303874900_ref3","first-page":"32","article-title":"Many-valued minSAT solving","volume-title":"IEEE 44th International Symposium on Multiple-Valued Logic, ISMVL 2014","author":"Argelich","year":"2014"},{"key":"2022052312303874900_ref4","doi-asserted-by":"crossref","DOI":"10.1093\/jigpal\/jzz025","article-title":"Clause tableaux for maximum and minimum satisfiability","volume":"29","author":"Argelich","year":"2021","journal-title":"Logic Journal of the IGPL"},{"key":"2022052312303874900_ref5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","article-title":"Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition","volume":"41","author":"Dechter","year":"1990","journal-title":"Artificial Intelligence"},{"key":"2022052312303874900_ref6","first-page":"294","article-title":"fCube: An efficient prover for intuitionistic propositional logic","volume-title":"LPAR-17","author":"Ferrari","year":"2010"},{"key":"2022052312303874900_ref7","article-title":"A non-clausal tableau calculus for minSAT","author":"Fiorino","year":"2020"},{"key":"2022052312303874900_ref8","volume-title":"Intuitionistic Logic, Model Theory and Forcing","author":"Fitting","year":"1969"},{"key":"2022052312303874900_ref9","first-page":"633","article-title":"Model counting","volume-title":"Handbook of Satisfiability","author":"Gomes","year":"2009"},{"key":"2022052312303874900_ref10","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/ISMVL.2019.00031","article-title":"Clausal form transformation in maxSAT","volume-title":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","author":"Li","year":"2019"},{"key":"2022052312303874900_ref11","first-page":"58","article-title":"A tableau calculus for non-clausal maximum satisfiability","volume-title":"28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2019","author":"Li","year":"2019"},{"key":"2022052312303874900_ref12","first-page":"28","article-title":"A resolution calculus for minSAT","volume":"10","author":"Li","year":"2019","journal-title":"Logic Journal of the IGPL"},{"key":"2022052312303874900_ref13","first-page":"605","article-title":"Minimum satisfiability and its applications","volume-title":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011","author":"Li","year":"2011"},{"key":"2022052312303874900_ref14","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.artint.2012.05.004","article-title":"Optimizing with minimum satisfiability","volume":"190","author":"Li","year":"2012","journal-title":"Artificial Intelligence"},{"key":"2022052312303874900_ref15","first-page":"217","article-title":"Simplification: A general constraint propagation technique for propositional and modal tableaux","volume-title":"TABLEAUX \u201898","author":"Massacci","year":"1998"},{"key":"2022052312303874900_ref16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86718-7","volume-title":"First-Order Logic","author":"Smullyan","year":"1968"}],"container-title":["Logic Journal of the IGPL"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/30\/3\/422\/43781592\/jzab012.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/30\/3\/422\/43781592\/jzab012.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T12:31:01Z","timestamp":1653309061000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jigpal\/article\/30\/3\/422\/6161554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,8]]},"references-count":16,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2021,3,8]]},"published-print":{"date-parts":[[2022,5,21]]}},"URL":"https:\/\/doi.org\/10.1093\/jigpal\/jzab012","relation":{},"ISSN":["1367-0751","1368-9894"],"issn-type":[{"value":"1367-0751","type":"print"},{"value":"1368-9894","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,6]]},"published":{"date-parts":[[2021,3,8]]}}}