{"id":"https://openalex.org/W2560168938","doi":"https://doi.org/10.7936/k7bk19qq","title":"An Efficient Algorithm for Maximum Boolean Satisfiability Based on Unit Propagation, Linear Programming, and Dynamic Weighting","display_name":"An Efficient Algorithm for Maximum Boolean Satisfiability Based on Unit Propagation, Linear Programming, and Dynamic Weighting","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2560168938","doi":"https://doi.org/10.7936/k7bk19qq","mag":"2560168938"},"language":"en","primary_location":{"id":"pmh:oai:openscholarship.wustl.edu:cse_research-1989","doi":null,"is_oa":false,"landing_page_url":"https://openscholarship.wustl.edu/cse_research/988","pdf_url":null,"source":{"id":"https://openalex.org/S4377196400","display_name":"Open Scholarship Institutional Repository (Washington University in St. Louis)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I204465549","host_organization_name":"Washington University in St. Louis","host_organization_lineage":["https://openalex.org/I204465549"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"All Computer Science and Engineering Research","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.7936/k7bk19qq","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101871074","display_name":"Zhao Xing","orcid":"https://orcid.org/0000-0001-8616-840X","observed_orcids":["https://orcid.org/0000-0001-8616-840X"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xing, Zhao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5101871074"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5763,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69475366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.0003000000142492354,"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/T10142","display_name":"Formal Methods in Verification","score":0.0003000000142492354,"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/maxsat","display_name":"MaxSAT","score":0.8809999823570251},{"id":"https://openalex.org/keywords/unit-propagation","display_name":"unit propagation","score":0.9629999995231628},{"id":"https://openalex.org/keywords/linear-programming-heuristic","display_name":"linear programming heuristic","score":0.9300000071525574},{"id":"https://openalex.org/keywords/dynamic-variable-ordering","display_name":"dynamic variable ordering","score":0.8259999752044678},{"id":"https://openalex.org/keywords/dynamic-weighting","display_name":"dynamic weighting","score":0.6930000185966492},{"id":"https://openalex.org/keywords/branching-rules","display_name":"branching rules","score":0.6890000104904175}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6997004747390747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5711929798126221},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.5589743256568909},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5238922834396362},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4951612055301666},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4880777597427368},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4871234893798828},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43488407135009766},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4185831844806671},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.20646154880523682},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C126838900","wikidata":"https://www.wikidata.org/wiki/Q77604","display_name":"Radiology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:openscholarship.wustl.edu:cse_research-1989","doi":null,"is_oa":false,"landing_page_url":"https://openscholarship.wustl.edu/cse_research/988","pdf_url":null,"source":{"id":"https://openalex.org/S4377196400","display_name":"Open Scholarship Institutional Repository (Washington University in St. Louis)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I204465549","host_organization_name":"Washington University in St. Louis","host_organization_lineage":["https://openalex.org/I204465549"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"All Computer Science and Engineering Research","raw_type":"text"},{"id":"mag:2560168938","doi":null,"is_oa":false,"landing_page_url":"https://openscholarship.wustl.edu/cgi/viewcontent.cgi?article=1989&context=cse_research","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"doi:10.7936/k7bk19qq","doi":"https://doi.org/10.7936/k7bk19qq","is_oa":true,"landing_page_url":"https://doi.org/10.7936/k7bk19qq","pdf_url":null,"source":{"id":"https://openalex.org/S7407053377","display_name":"Washington University in St. Louis Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.7936/k7bk19qq","doi":"https://doi.org/10.7936/k7bk19qq","is_oa":true,"landing_page_url":"https://doi.org/10.7936/k7bk19qq","pdf_url":null,"source":{"id":"https://openalex.org/S7407053377","display_name":"Washington University in St. Louis Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W14839205","https://openalex.org/W15803339","https://openalex.org/W18004407","https://openalex.org/W1506775176","https://openalex.org/W1548160868","https://openalex.org/W1556434751","https://openalex.org/W1561608403","https://openalex.org/W1581661059","https://openalex.org/W1980985059","https://openalex.org/W1993837454","https://openalex.org/W2017351350","https://openalex.org/W2036265926","https://openalex.org/W2040924621","https://openalex.org/W2062897452","https://openalex.org/W2067241820","https://openalex.org/W2106440199","https://openalex.org/W2142785340","https://openalex.org/W2144599263","https://openalex.org/W2154474334","https://openalex.org/W2569549435","https://openalex.org/W2776836749","https://openalex.org/W3202531429"],"related_works":["https://openalex.org/W2029688740","https://openalex.org/W1581890749","https://openalex.org/W7098397860","https://openalex.org/W2055714959","https://openalex.org/W7101130478","https://openalex.org/W1569133313","https://openalex.org/W7096046081","https://openalex.org/W1516863390","https://openalex.org/W2301405299","https://openalex.org/W7099779949"],"abstract_inverted_index":{"Maximum":[0],"Boolean":[1,9],"satis\ufb01ability":[2,10],"(max-SAT)":[3],"is":[4,17,39,67,79,109,137,143,170],"the":[5,21,35,42,99,121,129,157,190,200],"optimization":[6],"counterpart":[7],"of":[8,24,41,59,70,101,131,149,159,199,207,209],"(SAT),":[11],"in":[12,26,211],"which":[13,142],"a":[14,27,57,68,80,138,146],"variable":[15,140],"assignment":[16],"sought":[18],"to":[19,93,172,177],"satisfy":[20],"maximum":[22],"number":[23,58,130],"clauses":[25,132],"logical":[28],"formula.":[29],"A":[30],"branch-and-bound":[31],"algorithm":[32],"based":[33,114,144],"on":[34,115,145,156,183],"Davis-Putnam-Logemann-Loveland":[36],"procedure":[37],"(DPLL)":[38],"one":[40],"most":[43,198],"ef\ufb01cient":[44,82],"complete":[45],"algorithms":[46],"for":[47,62,74,84],"solving":[48],"max-SAT.":[49,63,75],"In":[50],"this":[51],"paper,":[52],"We":[53,118],"propose":[54],"and":[55,95,186],"investigate":[56],"new":[60,195],"strategies":[61,175],"Our":[64,106,134,180],"\ufb01rst":[65],"strategy":[66,83,108,136],"set":[69],"unit":[71,77],"propagation":[72],"rules":[73],"As":[76],"propaga-tion":[78],"very":[81],"SAT,":[85],"we":[86,162],"show":[87,119,192],"that":[88,120,169,193],"it":[89],"can":[90,96,124],"be":[91,125],"extended":[92,103],"max-SAT,":[94],"greatly":[97],"improve":[98],"performance":[100],"an":[102,110,164],"DPLL-based":[104],"algorithm.":[105],"second":[107],"effective":[111,127],"lookahead":[112],"heuristic":[113,123],"linear":[116],"programming.":[117],"LP":[122],"made":[126],"as":[128],"increases.":[133],"third":[135],"dynamic-weight":[139],"ordering,":[141],"thorough":[147],"analysis":[148,158],"two":[150],"well-known":[151],"existing":[152,201],"branching":[153],"rules.":[154],"Based":[155],"these":[160],"strategies,":[161],"develop":[163],"integrated,":[165],"constrainedness-sensitive":[166],"max-SAT":[167,185,203],"solver":[168,196],"able":[171],"dynamically":[173],"adjust":[174],"ac-cording":[176],"problem":[178],"characteristics.":[179],"experimental":[181],"results":[182],"random":[184],"some":[187],"instances":[188],"from":[189],"SATLIB":[191],"our":[194],"outperforms":[197],"com-plete":[202],"solvers,":[204],"with":[205],"orders":[206],"magnitude":[208],"improvement":[210],"many":[212],"cases.":[213]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2016-12-16T00:00:00"}