{"id":"https://openalex.org/W2272616495","doi":"https://doi.org/10.1145/2837614.2837658","title":"Query-guided maximum satisfiability","display_name":"Query-guided maximum satisfiability","publication_year":2016,"publication_date":"2016-01-07","ids":{"openalex":"https://openalex.org/W2272616495","doi":"https://doi.org/10.1145/2837614.2837658","mag":"2272616495"},"language":"en","primary_location":{"id":"doi:10.1145/2837614.2837658","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2837614.2837658","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-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/A5087502184","display_name":"Xin Zhang","orcid":"https://orcid.org/0000-0001-5250-1657"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xin Zhang","raw_affiliation_strings":["Georgia Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002052018","display_name":"Ravi Mangal","orcid":"https://orcid.org/0000-0001-6267-6995"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravi Mangal","raw_affiliation_strings":["Georgia Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111937381","display_name":"Aditya V. Nori","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Aditya V. Nori","raw_affiliation_strings":["Microsoft Research, UK"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075879790","display_name":"Mayur Naik","orcid":"https://orcid.org/0000-0003-1348-8618"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mayur Naik","raw_affiliation_strings":["Georgia Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5087502184"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":1.0454,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78380043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"109","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9975000023841858,"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/T10142","display_name":"Formal Methods in Verification","score":0.9975000023841858,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9968000054359436,"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/T10260","display_name":"Software Engineering Research","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9771771430969238},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7130184769630432},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5628082752227783},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5446481108665466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5206843614578247},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4932979941368103},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4753432273864746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3846202492713928},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3322598338127136},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29161641001701355},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.07021081447601318}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.9771771430969238},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7130184769630432},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5628082752227783},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5446481108665466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5206843614578247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4932979941368103},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4753432273864746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3846202492713928},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3322598338127136},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29161641001701355},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.07021081447601318}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2837614.2837658","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2837614.2837658","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5124456847","display_name":null,"funder_award_id":"#FA8750-15-2-0009","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G6151041591","display_name":null,"funder_award_id":"#1253867, #1526270","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":73,"referenced_works":["https://openalex.org/W37002918","https://openalex.org/W87126228","https://openalex.org/W92973652","https://openalex.org/W121830907","https://openalex.org/W134459671","https://openalex.org/W156009831","https://openalex.org/W193459320","https://openalex.org/W1496468608","https://openalex.org/W1508638970","https://openalex.org/W1538211826","https://openalex.org/W1585529040","https://openalex.org/W1586099086","https://openalex.org/W1596552075","https://openalex.org/W1627230931","https://openalex.org/W1860880244","https://openalex.org/W1868868480","https://openalex.org/W1883733964","https://openalex.org/W1907086563","https://openalex.org/W1977970897","https://openalex.org/W2017112612","https://openalex.org/W2024113144","https://openalex.org/W2028806953","https://openalex.org/W2029958553","https://openalex.org/W2036265926","https://openalex.org/W2040900440","https://openalex.org/W2050680750","https://openalex.org/W2052059088","https://openalex.org/W2071319337","https://openalex.org/W2079877139","https://openalex.org/W2082000355","https://openalex.org/W2098984274","https://openalex.org/W2107356010","https://openalex.org/W2110833886","https://openalex.org/W2123757087","https://openalex.org/W2126446661","https://openalex.org/W2127574686","https://openalex.org/W2133497528","https://openalex.org/W2133662847","https://openalex.org/W2135209143","https://openalex.org/W2145001295","https://openalex.org/W2152791745","https://openalex.org/W2157056800","https://openalex.org/W2163267264","https://openalex.org/W2164456230","https://openalex.org/W2166091242","https://openalex.org/W2199687903","https://openalex.org/W2253971087","https://openalex.org/W2278445211","https://openalex.org/W2284951589","https://openalex.org/W2295061292","https://openalex.org/W2406837904","https://openalex.org/W2406910562","https://openalex.org/W2611804663","https://openalex.org/W2912206496","https://openalex.org/W2998050925","https://openalex.org/W3045954188","https://openalex.org/W3104044769","https://openalex.org/W4213009134","https://openalex.org/W4235421007","https://openalex.org/W4240558819","https://openalex.org/W4243644740","https://openalex.org/W4247632680","https://openalex.org/W4300076045","https://openalex.org/W4300810260","https://openalex.org/W6603669155","https://openalex.org/W6636526798","https://openalex.org/W6687767793","https://openalex.org/W6694557836","https://openalex.org/W6713688368","https://openalex.org/W6713809205","https://openalex.org/W6785456720","https://openalex.org/W6844382842","https://openalex.org/W6990023262"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W2480084299","https://openalex.org/W2394616262","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W2408080066","https://openalex.org/W2406837904","https://openalex.org/W2571882453","https://openalex.org/W4211028879","https://openalex.org/W3120153087"],"abstract_inverted_index":{"We":[0,70],"propose":[1],"a":[2,38,84,94,105,121],"new":[3,122],"optimization":[4,62],"problem":[5],"\"Q-MaxSAT\",":[6],"an":[7,25,35,72],"extension":[8],"of":[9,41,124],"the":[10,31,46,81,90,100,108,112,115,118,130],"well-known":[11],"Maximum":[12],"Satisfiability":[13],"or":[14],"MaxSAT":[15,151],"problem.":[16,110],"In":[17,78],"contrast":[18],"to":[19,23,27,37,89,97,107,129],"MaxSAT,":[20],"which":[21],"aims":[22],"find":[24],"assignment":[26,36,102],"all":[28],"variables":[29,42],"in":[30,45,51,144,161],"formula,":[32],"Q-MaxSAT":[33,68,109,138,155],"computes":[34],"desired":[39],"subset":[40],"(or":[43],"queries)":[44],"formula.":[47],"Indeed,":[48],"many":[49],"problems":[50,160],"diverse":[52],"domains":[53],"such":[54],"as":[55,67,127],"program":[56,162],"reasoning,":[57],"information":[58,165],"retrieval,":[59],"and":[60,92,146,164],"mathematical":[61],"can":[63],"be":[64],"naturally":[65],"encoded":[66],"instances.":[69],"describe":[71],"iterative":[73],"algorithm":[74,82,116],"for":[75],"solving":[76],"Q-MaxSAT.":[77],"each":[79],"iteration,":[80],"solves":[83],"subproblem":[85,119],"that":[86,136],"is":[87,104],"relevant":[88,128],"queries,":[91],"applies":[93],"novel":[95],"technique":[96],"check":[98,113],"whether":[99],"partial":[101],"found":[103],"solution":[106],"If":[111],"fails,":[114],"grows":[117],"with":[120],"set":[123],"clauses":[125],"identified":[126],"queries.":[131],"Our":[132],"empirical":[133],"evaluation":[134],"shows":[135],"our":[137],"solver":[139],"Pilot":[140],"achieves":[141],"significant":[142],"improvements":[143],"runtime":[145],"memory":[147],"consumption":[148],"over":[149],"conventional":[150],"solvers":[152],"on":[153],"several":[154],"instances":[156],"generated":[157],"from":[158],"real-world":[159],"analysis":[163],"retrieval.":[166]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}