{"id":"https://openalex.org/W4393147842","doi":"https://doi.org/10.1609/aaai.v38i8.28628","title":"Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph","display_name":"Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph","publication_year":2024,"publication_date":"2024-03-24","ids":{"openalex":"https://openalex.org/W4393147842","doi":"https://doi.org/10.1609/aaai.v38i8.28628"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v38i8.28628","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1609/aaai.v38i8.28628","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/28628/29220","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/AAAI/article/download/28628/29220","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091833256","display_name":"Vasily Alferov","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vasily Alferov","raw_affiliation_strings":["Independent Researcher"],"affiliations":[{"raw_affiliation_string":"Independent Researcher","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064783288","display_name":"Ivan Bliznets","orcid":"https://orcid.org/0000-0003-2291-2556"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ivan Bliznets","raw_affiliation_strings":["University of Groningen"],"affiliations":[{"raw_affiliation_string":"University of Groningen","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5092277208","display_name":"Kirill Brilliantov","orcid":null},"institutions":[{"id":"https://openalex.org/I2801160905","display_name":"Steklov Mathematical Institute","ror":"https://ror.org/03zeg8w71","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2801160905","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Kirill Brilliantov","raw_affiliation_strings":["St. Petersburg Department of Steklov Mathematical Institute of the RAS"],"affiliations":[{"raw_affiliation_string":"St. Petersburg Department of Steklov Mathematical Institute of the RAS","institution_ids":["https://openalex.org/I2801160905"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091833256"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01472557,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"8","first_page":"7918","last_page":"7925"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9771999716758728,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9771999716758728,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9484999775886536,"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.9380000233650208,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6752781867980957},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5668942332267761},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5650972127914429},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5490333437919617},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4624803960323334},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.45631182193756104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3962821662425995},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3319637179374695},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28820058703422546},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.17715972661972046},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05441021919250488}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6752781867980957},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5668942332267761},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5650972127914429},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5490333437919617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4624803960323334},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.45631182193756104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3962821662425995},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3319637179374695},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28820058703422546},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.17715972661972046},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05441021919250488}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1609/aaai.v38i8.28628","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1609/aaai.v38i8.28628","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/28628/29220","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:pure.rug.nl:openaire/8b1d5c40-2b47-4b21-b3b5-2bbd144ca5fa","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/8b1d5c40-2b47-4b21-b3b5-2bbd144ca5fa","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Alferov, V, Bliznets, I & Brilliantov, K 2024, Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph. in Proceedings of the AAAI Conference on Artificial Intelligence. Proceedings of the AAAI Conference on Artificial Intelligence, no. 8, vol. 38, AAAI Press, pp. 7918-7925, 38th AAAI Conference on Artificial Intelligence, AAAI 2024, Vancouver, Canada, 20/02/2024. https://doi.org/10.1609/aaai.v38i8.28628","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.rug.nl:openaire_cris_publications/8b1d5c40-2b47-4b21-b3b5-2bbd144ca5fa","is_oa":true,"landing_page_url":"https://hdl.handle.net/11370/8b1d5c40-2b47-4b21-b3b5-2bbd144ca5fa","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alferov, V, Bliznets, I & Brilliantov, K 2024, Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph. in Proceedings of the AAAI Conference on Artificial Intelligence. Proceedings of the AAAI Conference on Artificial Intelligence, no. 8, vol. 38, AAAI Press, pp. 7918-7925, 38th AAAI Conference on Artificial Intelligence, AAAI 2024, Vancouver, Canada, 20/02/2024. https://doi.org/10.1609/aaai.v38i8.28628","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.rug.nl:publications/8b1d5c40-2b47-4b21-b3b5-2bbd144ca5fa","is_oa":true,"landing_page_url":"https://research.rug.nl/files/975558799/28628-Article_Text-32682-1-2-20240324.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alferov, V, Bliznets, I & Brilliantov, K 2024, Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph. in Proceedings of the AAAI Conference on Artificial Intelligence. Proceedings of the AAAI Conference on Artificial Intelligence, no. 8, vol. 38, AAAI Press, pp. 7918-7925, 38th AAAI Conference on Artificial Intelligence, AAAI 2024, Vancouver, Canada, 20/02/2024. https://doi.org/10.1609/aaai.v38i8.28628","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1609/aaai.v38i8.28628","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1609/aaai.v38i8.28628","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/28628/29220","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4393147842.pdf"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W576907608","https://openalex.org/W1490010027","https://openalex.org/W1813560150","https://openalex.org/W1896404939","https://openalex.org/W2006933117","https://openalex.org/W2148185803","https://openalex.org/W2157529519","https://openalex.org/W2185680923","https://openalex.org/W2241221468","https://openalex.org/W2504023209","https://openalex.org/W2585244063","https://openalex.org/W2914414140","https://openalex.org/W2965831370","https://openalex.org/W2989778209","https://openalex.org/W3117571851","https://openalex.org/W3173710770","https://openalex.org/W3194860598","https://openalex.org/W4206807714","https://openalex.org/W4226493398","https://openalex.org/W4230158058","https://openalex.org/W4288055121","https://openalex.org/W4382240227","https://openalex.org/W6616682776","https://openalex.org/W6630771534","https://openalex.org/W6634978047","https://openalex.org/W6639513864","https://openalex.org/W6654362726","https://openalex.org/W6686850924"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240","https://openalex.org/W2076399409","https://openalex.org/W2102364390"],"abstract_inverted_index":{"In":[0],"the":[1,5,9,20,24,33,49,58,72,81,101,126,136],"paper,":[2],"we":[3,17],"study":[4],"Maximum":[6,11,25,111],"Satisfiability":[7,12,26,112],"and":[8,67,75,96],"Partial":[10,110],"problems.":[13],"Using":[14],"Gallai\u2013Edmonds":[15],"decomposition,":[16],"significantly":[18,134],"improve":[19,89],"upper":[21,87,91],"bound":[22],"for":[23,71],"problem":[27],"parameterized":[28],"above":[29],"maximum":[30],"matching":[31],"in":[32,116],"variable-clause":[34],"graph.":[35],"Our":[36],"algorithm":[37,102],"operates":[38],"with":[39],"a":[40,44,139],"runtime":[41],"of":[42,84,109,128,138],"O*(2.83^k'),":[43],"substantial":[45],"improvement":[46],"compared":[47],"to":[48,94],"previous":[50],"approach":[51],"requiring":[52],"O*(4^k'":[53],"),":[54],"where":[55,78],"k'":[56],"denotes":[57],"relevant":[59],"parameter.":[60],"Moreover,":[61],"this":[62,121],"result":[63],"immediately":[64],"implies":[65],"O*(1.14977^m)":[66],"O*(1.27895^m)":[68],"time":[69],"algorithms":[70],"(n,":[73,76],"3)-MaxSAT":[74],"4)-MaxSAT":[77],"m":[79],"is":[80,122],"overall":[82],"number":[83],"clauses.":[85],"These":[86],"bounds":[88,92],"prior-known":[90],"equal":[93],"O*(1.1554^m)":[95],"O*(1.2872^m).":[97],"We":[98],"also":[99],"adapt":[100],"so":[103],"that":[104,120],"it":[105],"can":[106,133],"handle":[107],"instances":[108],"without":[113],"losing":[114],"performance":[115],"some":[117],"cases.":[118],"Note":[119],"somewhat":[123],"surprising,":[124],"as":[125],"existence":[127],"even":[129],"one":[130],"hard":[131],"clause":[132],"increase":[135],"hardness":[137],"problem.":[140]},"counts_by_year":[],"updated_date":"2026-03-04T09:10:02.777135","created_date":"2025-10-10T00:00:00"}