{"id":"https://openalex.org/W1767868015","doi":"https://doi.org/10.3233/fi-2015-1159","title":"Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting","display_name":"Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1767868015","doi":"https://doi.org/10.3233/fi-2015-1159","mag":"1767868015"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2015-1159","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2015-1159","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5090333344","display_name":"Nadia Creignou","orcid":"https://orcid.org/0009-0005-6522-6363"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Nadia Creignou","raw_affiliation_strings":["Aix-Marseille Universit\u00e9, CNRS, LIF UMR 7279, 13288, Marseille, France. creignou@lif.univ-mrs.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aix-Marseille Universit\u00e9, CNRS, LIF UMR 7279, 13288, Marseille, France. creignou@lif.univ-mrs.fr","institution_ids":["https://openalex.org/I21491767","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008982209","display_name":"Heribert Vollmer","orcid":"https://orcid.org/0000-0002-9292-1960"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Heribert Vollmer","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstr. 4, 30167 Hannover, Germany. vollmer@thi.uni-hannover.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstr. 4, 30167 Hannover, Germany. vollmer@thi.uni-hannover.de","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090333344"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I21491767"],"apc_list":null,"apc_paid":null,"fwci":0.7268,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73051071,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"136","issue":"4","first_page":"297","last_page":"316"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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.9921000003814697,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9335610866546631},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.9313457012176514},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7731109857559204},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.6373605728149414},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6120737195014954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5717995166778564},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4504384696483612},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44027912616729736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4014788269996643},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3760087192058563},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33871978521347046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27682629227638245}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9335610866546631},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.9313457012176514},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7731109857559204},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.6373605728149414},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6120737195014954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5717995166778564},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4504384696483612},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44027912616729736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4014788269996643},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3760087192058563},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33871978521347046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27682629227638245}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/fi-2015-1159","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2015-1159","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01192908v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01192908","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fundamenta Informaticae, 2015, 136 (4), pp.297-316","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.8399999737739563}],"awards":[{"id":"https://openalex.org/G3274108881","display_name":null,"funder_award_id":"EP/G055114/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W41330591","https://openalex.org/W1490189322","https://openalex.org/W1517036688","https://openalex.org/W1589711670","https://openalex.org/W1859310323","https://openalex.org/W1876800908","https://openalex.org/W1983207144","https://openalex.org/W2018964411","https://openalex.org/W2023364974","https://openalex.org/W2044558209","https://openalex.org/W2061768978","https://openalex.org/W2082723133","https://openalex.org/W2107918022","https://openalex.org/W2137874581","https://openalex.org/W2404324099","https://openalex.org/W2748846180","https://openalex.org/W2913688336","https://openalex.org/W2951449870","https://openalex.org/W2963063357"],"related_works":["https://openalex.org/W1539502146","https://openalex.org/W1787069340","https://openalex.org/W2108136433","https://openalex.org/W3083527377","https://openalex.org/W2918521033","https://openalex.org/W2137874581","https://openalex.org/W1865369187","https://openalex.org/W2997249752","https://openalex.org/W2523981875","https://openalex.org/W2563912921"],"abstract_inverted_index":{"We":[0,26,90,118],"consider":[1,67,120],"the":[2,13,19,28,40,46,62,102,121],"weighted":[3,103],"satisfiability":[4,104],"problem":[5],"for":[6,98],"Boolean":[7,88],"circuits":[8,74],"and":[9,34,54,124],"propositional":[10],"formul\u00e6,":[11],"where":[12],"weight":[14],"of":[15,21,31,39,42,58,87],"an":[16],"assignment":[17],"is":[18],"number":[20],"variables":[22],"set":[23,85],"to":[24,56,77],"true.":[25],"study":[27,38],"parameterized":[29],"complexity":[30,41,60],"these":[32],"problems":[33,105],"initiate":[35],"a":[36,83,92],"systematic":[37],"its":[43],"fragments.":[44],"Only":[45],"monotone":[47],"fragment":[48],"has":[49],"been":[50],"considered":[51],"so":[52],"far":[53],"proven":[55],"be":[57],"same":[59],"as":[61],"unrestricted":[63],"problems.":[64,126],"Here,":[65],"we":[66],"all":[68],"fragments":[69],"obtained":[70],"by":[71,95],"semantically":[72],"restricting":[73],"or":[75,111,115],"formul\u00e6":[76],"contain":[78],"only":[79],"gates":[80],"(connectives)":[81],"from":[82],"fixed":[84],"B":[86],"functions.":[89],"obtain":[91],"dichotomy":[93],"result":[94],"showing":[96],"that":[97],"each":[99],"such":[100],"B,":[101],"are":[106],"either":[107],"W[P]-complete":[108],"(for":[109,113],"circuits)":[110],"W[SAT]-complete":[112],"formul\u00e6)":[114],"efficiently":[116],"solvable.":[117],"also":[119],"related":[122],"enumeration":[123],"counting":[125]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-05-02T06:04:40.494371","created_date":"2025-10-10T00:00:00"}