{"id":"https://openalex.org/W4416437636","doi":"https://doi.org/10.1093/jigpal/jzaf058","title":"New tableau characterizations for non-clausal regular MinSAT and MaxSAT problems","display_name":"New tableau characterizations for non-clausal regular MinSAT and MaxSAT problems","publication_year":2025,"publication_date":"2025-07-17","ids":{"openalex":"https://openalex.org/W4416437636","doi":"https://doi.org/10.1093/jigpal/jzaf058"},"language":"en","primary_location":{"id":"doi:10.1093/jigpal/jzaf058","is_oa":false,"landing_page_url":"https://doi.org/10.1093/jigpal/jzaf058","pdf_url":null,"source":{"id":"https://openalex.org/S2734381524","display_name":"Logic Journal of IGPL","issn_l":"1367-0751","issn":["1367-0751","1368-9894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Journal of the IGPL","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090594213","display_name":"Guido Fiorino","orcid":"https://orcid.org/0000-0002-0556-0723"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Guido Fiorino","raw_affiliation_strings":["DISCO , Univ. degli Studi di Milano-Bicocca, Viale Sarca, 336, 20126, Milano, Italy"],"affiliations":[{"raw_affiliation_string":"DISCO , Univ. degli Studi di Milano-Bicocca, Viale Sarca, 336, 20126, Milano, Italy","institution_ids":["https://openalex.org/I66752286"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090594213"],"corresponding_institution_ids":["https://openalex.org/I66752286"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.37568975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"6","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.35499998927116394,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.35499998927116394,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.14800000190734863,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.14429999887943268,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.8722000122070312},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7128999829292297},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.6284000277519226},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5626000165939331},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.3984000086784363}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.8722000122070312},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7128999829292297},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.6284000277519226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5935999751091003},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5626000165939331},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4805000126361847},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.462799996137619},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4456999897956848},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.3984000086784363},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37940001487731934},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.3644999861717224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.358599990606308},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.3091999888420105},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2671999931335449}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/jigpal/jzaf058","is_oa":false,"landing_page_url":"https://doi.org/10.1093/jigpal/jzaf058","pdf_url":null,"source":{"id":"https://openalex.org/S2734381524","display_name":"Logic Journal of IGPL","issn_l":"1367-0751","issn":["1367-0751","1368-9894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Journal of the IGPL","raw_type":"journal-article"},{"id":"pmh:oai:boa.unimib.it:10281/584281","is_oa":false,"landing_page_url":"https://hdl.handle.net/10281/584281","pdf_url":null,"source":{"id":"https://openalex.org/S4306401259","display_name":"BOA (University of Milano-Bicocca)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W39510960","https://openalex.org/W1577536563","https://openalex.org/W1978050007","https://openalex.org/W1981934782","https://openalex.org/W2009689138","https://openalex.org/W2043433560","https://openalex.org/W2969747068","https://openalex.org/W3134776246","https://openalex.org/W3137140266","https://openalex.org/W3141991053","https://openalex.org/W3164993596","https://openalex.org/W4281633131","https://openalex.org/W4385688167","https://openalex.org/W4401752760","https://openalex.org/W4406142828"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"paper":[3],"we":[4],"provide":[5],"a":[6],"new":[7],"tableau":[8],"characterization":[9,34],"for":[10,55],"the":[11,27,36,53,56,73],"Weighted":[12,17],"Partial":[13,18],"Regular":[14,19],"MinSat":[15],"and":[16,29],"MaxSat":[20],"problems,":[21],"which":[22],"are,":[23],"respectively,":[24],"variants":[25],"of":[26,38,58,76],"Minimum":[28],"Maximum":[30],"Satisfiability":[31],"problems.":[32,78],"Our":[33],"has":[35],"advantage":[37],"constructing":[39],"tableaux":[40],"with":[41,48],"fewer":[42],"nodes":[43],"compared":[44],"to":[45,72],"those":[46],"built":[47],"known":[49],"characterizations.":[50],"We":[51,63],"address":[52],"problems":[54],"case":[57],"formulas":[59],"in":[60],"non-clausal":[61],"form.":[62],"also":[64],"discuss":[65],"how":[66],"our":[67],"results":[68],"can":[69],"be":[70],"adapted":[71],"other":[74],"versions":[75],"these":[77]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-11-23T00:00:00"}