{"id":"https://openalex.org/W4404053489","doi":"https://doi.org/10.3233/sat-231507","title":"Proof Complexity of Propositional Model Counting","display_name":"Proof Complexity of Propositional Model Counting","publication_year":2024,"publication_date":"2024-11-05","ids":{"openalex":"https://openalex.org/W4404053489","doi":"https://doi.org/10.3233/sat-231507"},"language":"en","primary_location":{"id":"doi:10.3233/sat-231507","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat-231507","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat231507?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat231507","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"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":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat231507?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat231507","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042128349","display_name":"Olaf Beyersdorff","orcid":"https://orcid.org/0000-0002-2870-1648"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Olaf Beyersdorff","raw_affiliation_strings":["Friedrich Schiller University Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Friedrich Schiller University Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111161799","display_name":"Tim Hoffmann","orcid":"https://orcid.org/0009-0004-0230-6115"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tim Hoffmann","raw_affiliation_strings":["Friedrich Schiller University Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Friedrich Schiller University Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114520986","display_name":"Luc N. Spachmann","orcid":null},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Luc N. Spachmann","raw_affiliation_strings":["Friedrich Schiller University Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Friedrich Schiller University Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042128349"],"corresponding_institution_ids":["https://openalex.org/I76198965"],"apc_list":null,"apc_paid":null,"fwci":0.3616,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68674796,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"1","first_page":"27","last_page":"59"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9980000257492065,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9980000257492065,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.994700014591217,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.992900013923645,"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/proof-complexity","display_name":"Proof complexity","score":0.46624723076820374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4649236500263214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43259960412979126},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3342527747154236},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.08509206771850586},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.051859378814697266},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.04814442992210388}],"concepts":[{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.46624723076820374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4649236500263214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43259960412979126},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3342527747154236},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.08509206771850586},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.051859378814697266},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.04814442992210388},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3233/sat-231507","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat-231507","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat231507?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat231507","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"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":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:18464","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol271-sat2023/LIPIcs.SAT.2023.2/LIPIcs.SAT.2023.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},{"id":"doi:10.4230/lipics.sat.2023.2","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sat.2023.2","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.3233/sat-231507","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat-231507","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat231507?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat231507","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"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":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7900000214576721,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G8131174901","display_name":null,"funder_award_id":"BE 4209/3-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8330397625","display_name":null,"funder_award_id":"Funding","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4404053489.pdf"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W134339645","https://openalex.org/W1537730723","https://openalex.org/W1986660301","https://openalex.org/W1988083342","https://openalex.org/W2036265926","https://openalex.org/W2069767473","https://openalex.org/W2114267503","https://openalex.org/W2121015471","https://openalex.org/W2131455536","https://openalex.org/W2131550405","https://openalex.org/W2137407595","https://openalex.org/W2215982992","https://openalex.org/W2547601025","https://openalex.org/W2729091742","https://openalex.org/W2741061345","https://openalex.org/W2921519656","https://openalex.org/W2954910840","https://openalex.org/W2997580674","https://openalex.org/W3003697368","https://openalex.org/W3005807947","https://openalex.org/W3081335478","https://openalex.org/W3126185111","https://openalex.org/W3128482754","https://openalex.org/W3174643737","https://openalex.org/W3186139236","https://openalex.org/W3204797423","https://openalex.org/W4206807714","https://openalex.org/W4285602404"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"Recently,":[0],"the":[1,6,25,50,75],"proof":[2,32,78],"system":[3,26],"MICE":[4,27,53],"for":[5,31,34,74,89],"model":[7],"counting":[8],"problem":[9],"#SAT":[10,36],"was":[11],"introduced":[12],"by":[13,21],"Fichte,":[14],"Hecher":[15],"and":[16,54,106],"Roland":[17],"(SAT\u201922).":[18],"As":[19],"demonstrated":[20],"Fichte":[22],"et":[23],"al.,":[24],"can":[28],"be":[29],"used":[30],"logging":[33],"state-of-the-art":[35],"solvers.":[37],"We":[38,67,95],"perform":[39],"a":[40,56,90,98],"proof-complexity":[41],"study":[42],"of":[43,52,77,93],"MICE.":[44,66],"For":[45],"this":[46],"we":[47],"first":[48],"simplify":[49],"rules":[51],"obtain":[55],"calculus":[57],"MIC":[58,81,102],"E":[59,82,103],"\u2032":[60,83,104],"that":[61],"is":[62],"polynomially":[63],"equivalent":[64],"to":[65],"then":[68],"establish":[69],"an":[70],"exponential":[71],"lower":[72],"bound":[73],"number":[76],"steps":[79],"in":[80,87],"(and":[84],"hence":[85],"also":[86,96],"MICE)":[88],"specific":[91],"family":[92],"CNFs.":[94],"explain":[97],"tight":[99],"connection":[100],"between":[101],"proofs":[105],"decision":[107],"DNNFs.":[108]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}