{"id":"https://openalex.org/W3185633566","doi":"https://doi.org/10.1007/978-3-030-80223-3_12","title":"Efficient All-UIP Learned Clause Minimization","display_name":"Efficient All-UIP Learned Clause Minimization","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3185633566","doi":"https://doi.org/10.1007/978-3-030-80223-3_12","mag":"3185633566"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-80223-3_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-80223-3_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://resolver.obvsg.at/urn:nbn:at:at-ubl:3-6935","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086520801","display_name":"Mathias Fleury","orcid":"https://orcid.org/0000-0002-1705-3083"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Mathias Fleury","raw_affiliation_strings":["Johannes Kepler University Linz, Linz, Austria"],"raw_orcid":"https://orcid.org/0000-0002-1705-3083","affiliations":[{"raw_affiliation_string":"Johannes Kepler University Linz, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082596567","display_name":"Armin Biere","orcid":"https://orcid.org/0000-0001-7170-9242"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Armin Biere","raw_affiliation_strings":["Johannes Kepler University Linz, Linz, Austria"],"raw_orcid":"https://orcid.org/0000-0001-7170-9242","affiliations":[{"raw_affiliation_string":"Johannes Kepler University Linz, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086520801"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8097,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66061453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9983000159263611,"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.9983000159263611,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9901000261306763,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9828000068664551,"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/computer-science","display_name":"Computer science","score":0.7752326726913452},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6976901292800903},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6634132266044617},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47917142510414124},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4357638955116272},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43010973930358887},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4261942505836487},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4036295413970947},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3808673322200775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1461527943611145},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08665797114372253}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7752326726913452},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6976901292800903},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6634132266044617},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47917142510414124},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4357638955116272},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43010973930358887},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4261942505836487},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4036295413970947},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3808673322200775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1461527943611145},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08665797114372253},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-030-80223-3_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-80223-3_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:epub.jku.at/:6134601","is_oa":true,"landing_page_url":"https://resolver.obvsg.at/urn:nbn:at:at-ubl:3-6935","pdf_url":"https://resolver.obvsg.at/urn:nbn:at:at-ubl:3-6935","source":{"id":"https://openalex.org/S4306401788","display_name":"University Library Linz repository (Johannes Kepler Universitat Linz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121883995","host_organization_name":"Johannes Kepler University of Linz","host_organization_lineage":["https://openalex.org/I121883995"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book"},{"id":"doi:10.35011/fmvtr.2021-3","is_oa":true,"landing_page_url":"https://doi.org/10.35011/fmvtr.2021-3","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:epub.jku.at/:6134601","is_oa":true,"landing_page_url":"https://resolver.obvsg.at/urn:nbn:at:at-ubl:3-6935","pdf_url":"https://resolver.obvsg.at/urn:nbn:at:at-ubl:3-6935","source":{"id":"https://openalex.org/S4306401788","display_name":"University Library Linz repository (Johannes Kepler Universitat Linz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121883995","host_organization_name":"Johannes Kepler University of Linz","host_organization_lineage":["https://openalex.org/I121883995"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book"},"sustainable_development_goals":[{"score":0.5899999737739563,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G4072464608","display_name":null,"funder_award_id":"NFN S11408-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8488583251","display_name":null,"funder_award_id":"S11408-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3185633566.pdf","grobid_xml":"https://content.openalex.org/works/W3185633566.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W16528894","https://openalex.org/W128869332","https://openalex.org/W1480459634","https://openalex.org/W1510557644","https://openalex.org/W1518705996","https://openalex.org/W1978757752","https://openalex.org/W2011992362","https://openalex.org/W2282536569","https://openalex.org/W3040594194","https://openalex.org/W4243217271","https://openalex.org/W4246783757","https://openalex.org/W4251625379"],"related_works":["https://openalex.org/W1495042958","https://openalex.org/W2494338568","https://openalex.org/W2122678784","https://openalex.org/W2282510344","https://openalex.org/W139987158","https://openalex.org/W2183994405","https://openalex.org/W4234013965","https://openalex.org/W2349023125","https://openalex.org/W4253006236","https://openalex.org/W1971979548"],"abstract_inverted_index":{"In":[0],"2020":[1],"Feng":[2],"&":[3],"Bacchus":[4],"revisited":[5],"variants":[6],"of":[7,16,19,58,83,103],"the":[8,23,56,59,92,101],"all-UIP":[9],"learning":[10],"strategy,":[11],"which":[12],"considerably":[13],"improved":[14],"performance":[15],"their":[17,35],"version":[18,82],"CaDiCaL":[20],"submitted":[21],"to":[22,66],"SAT":[24,94],"Competition":[25],"2020,":[26],"particularly":[27],"on":[28,34],"large":[29],"planning":[30],"instances.":[31],"We":[32,73],"improve":[33],"algorithm":[36,51],"by":[37],"tightly":[38],"integrating":[39],"this":[40],"idea":[41],"with":[42,52,91],"learned":[43,69],"clause":[44],"minimization.":[45],"This":[46],"yields":[47],"a":[48],"clean":[49],"shrinking":[50,84],"complexity":[53],"linear":[54],"in":[55],"size":[57],"implication":[60],"graph.":[61],"It":[62],"is":[63],"fast":[64],"enough":[65],"unconditionally":[67],"shrink":[68],"clauses":[70],"until":[71],"completion.":[72],"further":[74],"define":[75],"trail":[76],"redundancy":[77],"and":[78,98],"show":[79],"that":[80],"our":[81,104],"removes":[85],"all":[86],"redundant":[87],"literals.":[88],"Independent":[89],"experiments":[90],"three":[93],"solvers":[95],"CaDiCaL,":[96],"Kissat,":[97],"Satch":[99],"confirm":[100],"effectiveness":[102],"approach.":[105]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}