{"id":"https://openalex.org/W1572578702","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-102","title":"Minimization for generalized Boolean formulas","display_name":"Minimization for generalized Boolean formulas","publication_year":2011,"publication_date":"2011-07-16","ids":{"openalex":"https://openalex.org/W1572578702","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-102","mag":"1572578702"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.208.4209","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.4209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ijcai.org/papers11/Papers/IJCAI11-102.pdf","raw_type":"text"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1104.2312","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071803397","display_name":"Edith Hemaspaandra","orcid":"https://orcid.org/0000-0002-7115-626X"},"institutions":[{"id":"https://openalex.org/I155173764","display_name":"Rochester Institute of Technology","ror":"https://ror.org/00v4yb702","country_code":"US","type":"education","lineage":["https://openalex.org/I155173764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edith Hemaspaandra","raw_affiliation_strings":["Dept. of Comput. Science, Rochester Institute of Technology, Rochester, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Science, Rochester Institute of Technology, Rochester, NY","institution_ids":["https://openalex.org/I155173764"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109427518","display_name":"Henning Schnoor","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Schnoor","raw_affiliation_strings":["Institute for Computer Science, Christian-Albrechts-Universit\u00e4t zu Kiel, Kiel, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science, Christian-Albrechts-Universit\u00e4t zu Kiel, Kiel, Germany#TAB#","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.05057784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"566","last_page":"571"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9990000128746033,"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/T11567","display_name":"semigroups and automata theory","score":0.9990000128746033,"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.9983999729156494,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.995199978351593,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.615199625492096},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5908483862876892},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5590436458587646},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5499000549316406},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.511394202709198},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.47507280111312866},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4494193196296692},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44369035959243774},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44101956486701965},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4381019175052643},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.43473339080810547},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4304933547973633},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4174472689628601},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41549259424209595},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.3761548697948456},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33008772134780884},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24413272738456726},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22961515188217163},{"id":"https://openalex.org/keywords/intermediate-logic","display_name":"Intermediate logic","score":0.08934628963470459},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08226203918457031},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.0780239999294281}],"concepts":[{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.615199625492096},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5908483862876892},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5590436458587646},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5499000549316406},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.511394202709198},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.47507280111312866},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4494193196296692},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44369035959243774},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44101956486701965},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4381019175052643},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.43473339080810547},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4304933547973633},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4174472689628601},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41549259424209595},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.3761548697948456},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33008772134780884},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24413272738456726},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22961515188217163},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.08934628963470459},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08226203918457031},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0780239999294281},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.208.4209","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.4209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ijcai.org/papers11/Papers/IJCAI11-102.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.766.7812","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.766.7812","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1104.2312.pdf","raw_type":"text"},{"id":"mag:1572578702","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1104.2312","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"mag:1572578702","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1104.2312","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W157911545","https://openalex.org/W753254759","https://openalex.org/W1511747486","https://openalex.org/W1554715854","https://openalex.org/W1571873445","https://openalex.org/W1589711670","https://openalex.org/W1618174268","https://openalex.org/W1634527695","https://openalex.org/W1997649256","https://openalex.org/W2001101327","https://openalex.org/W2007464118","https://openalex.org/W2046132190","https://openalex.org/W2052936500","https://openalex.org/W2070023605","https://openalex.org/W2082723133","https://openalex.org/W2083810385","https://openalex.org/W2090224436","https://openalex.org/W2091470957","https://openalex.org/W2104025390","https://openalex.org/W2110920860","https://openalex.org/W2116407296","https://openalex.org/W2130402533","https://openalex.org/W2133260738","https://openalex.org/W2153037302","https://openalex.org/W2166566648","https://openalex.org/W2167906337","https://openalex.org/W2335478831","https://openalex.org/W2398485441","https://openalex.org/W2950285192","https://openalex.org/W2963363254"],"related_works":["https://openalex.org/W1488847221","https://openalex.org/W1584711551","https://openalex.org/W2066362579","https://openalex.org/W2902429830","https://openalex.org/W2118547316","https://openalex.org/W1979792874","https://openalex.org/W3046459465","https://openalex.org/W2903921318","https://openalex.org/W2924313066","https://openalex.org/W2168241470","https://openalex.org/W3005006418","https://openalex.org/W2023364974","https://openalex.org/W2487593933","https://openalex.org/W1969865855","https://openalex.org/W1548701279","https://openalex.org/W2053226073","https://openalex.org/W2020701847","https://openalex.org/W1638821902","https://openalex.org/W2063454654","https://openalex.org/W2090073529"],"abstract_inverted_index":{"The":[0,51],"minimization":[1,40,103],"problem":[2,10,22],"for":[3,41,47,105],"propositional":[4,49],"formulas":[5,42,57],"is":[6,23,83],"an":[7],"important":[8],"optimization":[9],"in":[11,43,85],"the":[12,16,21,37,65,74],"second":[13],"level":[14],"of":[15,39,61,70,109],"polynomial":[17,86],"hierarchy.":[18],"In":[19,73],"general,":[20],"\u03a3":[24],"p":[25],"2-complete":[26],"under":[27],"Turing":[28],"reductions,":[29],"but":[30],"restricted":[31,48],"versions":[32],"are":[33],"tractable.":[34],"We":[35],"study":[36],"complexity":[38],"two":[44],"established":[45],"frameworks":[46],"logic:":[50],"Post":[52,75],"framework":[53],"allowing":[54,68],"arbitrarily":[55],"nested":[56],"over":[58],"a":[59,79,106],"set":[60],"Boolean":[62,95],"connectors,":[63],"and":[64,111],"constraint":[66],"setting,":[67],"generalizations":[69],"CNF":[71,98],"formulas.":[72],"case,":[76],"we":[77,100,116],"obtain":[78,101],"dichotomy":[80],"result:":[81],"Minimization":[82],"solvable":[84],"time":[87],"or":[88],"coNP-hard.":[89],"This":[90],"result":[91],"also":[92],"applies":[93],"to":[94],"circuits.":[96],"For":[97],"formulas,":[99,110],"new":[102],"algorithms":[104],"large":[107],"class":[108],"give":[112],"strong":[113],"evidence":[114],"that":[115],"have":[117],"covered":[118],"all":[119],"polynomial-time":[120],"cases.":[121]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}