{"id":"https://openalex.org/W4289549925","doi":"https://doi.org/10.1017/s147106842200014x","title":"Efficient Knowledge Compilation Beyond Weighted Model Counting","display_name":"Efficient Knowledge Compilation Beyond Weighted Model Counting","publication_year":2022,"publication_date":"2022-07-01","ids":{"openalex":"https://openalex.org/W4289549925","doi":"https://doi.org/10.1017/s147106842200014x"},"language":"en","primary_location":{"id":"doi:10.1017/s147106842200014x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s147106842200014x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B85D8CC591869EF970780E94C8B92D1B/S147106842200014Xa.pdf/div-class-title-efficient-knowledge-compilation-beyond-weighted-model-counting-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B85D8CC591869EF970780E94C8B92D1B/S147106842200014Xa.pdf/div-class-title-efficient-knowledge-compilation-beyond-weighted-model-counting-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076600441","display_name":"Rafael Kiesel","orcid":"https://orcid.org/0000-0002-8866-3452"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"RAFAEL KIESEL","raw_affiliation_strings":["TU Wien, Vienna, Austria (e-mail:","TU Wien, Vienna, Austria (e-mail: rafael.kiesel@web.de)"],"raw_orcid":"https://orcid.org/0000-0002-8866-3452","affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria (e-mail:","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"TU Wien, Vienna, Austria (e-mail: rafael.kiesel@web.de)","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002459496","display_name":"Pietro Totis","orcid":"https://orcid.org/0000-0001-5845-6914"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"PIETRO TOTIS","raw_affiliation_strings":["KU Leuven, Leuven, Belgium (e-mails:"],"raw_orcid":"https://orcid.org/0000-0001-5845-6914","affiliations":[{"raw_affiliation_string":"KU Leuven, Leuven, Belgium (e-mails:","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023203721","display_name":"Angelika Kimmig","orcid":"https://orcid.org/0000-0002-6742-4057"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"ANGELIKA KIMMIG","raw_affiliation_strings":["KU Leuven, Leuven, Belgium (e-mails:"],"raw_orcid":"https://orcid.org/0000-0002-6742-4057","affiliations":[{"raw_affiliation_string":"KU Leuven, Leuven, Belgium (e-mails:","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0497,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.80350163,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"22","issue":"4","first_page":"505","last_page":"522"},"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.998199999332428,"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.998199999332428,"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.9961000084877014,"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/T10142","display_name":"Formal Methods in Verification","score":0.9950000047683716,"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/computer-science","display_name":"Computer science","score":0.8313459157943726},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5616679787635803},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.5305564403533936},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5138164162635803},{"id":"https://openalex.org/keywords/normalization","display_name":"Normalization (sociology)","score":0.5085633993148804},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4941411316394806},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.4886088967323303},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43243151903152466},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4230383038520813},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.40525978803634644},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3603439927101135},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.29525354504585266},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16725176572799683}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8313459157943726},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5616679787635803},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.5305564403533936},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5138164162635803},{"id":"https://openalex.org/C136886441","wikidata":"https://www.wikidata.org/wiki/Q926129","display_name":"Normalization (sociology)","level":2,"score":0.5085633993148804},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4941411316394806},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.4886088967323303},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43243151903152466},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4230383038520813},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.40525978803634644},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3603439927101135},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29525354504585266},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16725176572799683},{"id":"https://openalex.org/C19165224","wikidata":"https://www.wikidata.org/wiki/Q23404","display_name":"Anthropology","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s147106842200014x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s147106842200014x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B85D8CC591869EF970780E94C8B92D1B/S147106842200014Xa.pdf/div-class-title-efficient-knowledge-compilation-beyond-weighted-model-counting-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:20.500.12942/702112","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/bitstream/20.500.12942/702112/2/Improving_Constrained_Knowledge_Compilation_by_Leveraging_Definability.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","issn_l":null,"issn":null,"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":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Theory And Practice Of Logic Programming, vol. 22 (4), Art.No. PII S147106842200014X, (505-522)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1017/s147106842200014x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s147106842200014x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B85D8CC591869EF970780E94C8B92D1B/S147106842200014Xa.pdf/div-class-title-efficient-knowledge-compilation-beyond-weighted-model-counting-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4289549925.pdf"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1824971879","https://openalex.org/W1836582804","https://openalex.org/W1856314200","https://openalex.org/W1873912000","https://openalex.org/W1983128223","https://openalex.org/W2018934112","https://openalex.org/W2161403060","https://openalex.org/W2253548355","https://openalex.org/W2402839980","https://openalex.org/W2576217799","https://openalex.org/W2604156327","https://openalex.org/W2952585167","https://openalex.org/W3035758390","https://openalex.org/W3089520130","https://openalex.org/W3102093522","https://openalex.org/W3104376605","https://openalex.org/W3201750412","https://openalex.org/W3202204722","https://openalex.org/W3205771332","https://openalex.org/W3206345580","https://openalex.org/W4298084898","https://openalex.org/W6609974614","https://openalex.org/W6639236657","https://openalex.org/W6646413461","https://openalex.org/W6680306594","https://openalex.org/W6691356458","https://openalex.org/W6732624674","https://openalex.org/W6751691560","https://openalex.org/W6779872152","https://openalex.org/W6783493918","https://openalex.org/W6785617965","https://openalex.org/W6785734557","https://openalex.org/W6802251631","https://openalex.org/W6802498209","https://openalex.org/W7074718265"],"related_works":["https://openalex.org/W1511336005","https://openalex.org/W1903938722","https://openalex.org/W4231236017","https://openalex.org/W2304178603","https://openalex.org/W1875972884","https://openalex.org/W34858115","https://openalex.org/W1988877409","https://openalex.org/W1575307414","https://openalex.org/W2076569795","https://openalex.org/W3088092049"],"abstract_inverted_index":{"Abstract":[0],"Quantitative":[1],"extensions":[2],"of":[3,10,32,48,71,130,142,149,169,179],"logic":[4,50],"programming":[5,51],"often":[6],"require":[7],"the":[8,40,53,113,122,128,139,154,177],"solution":[9],"so":[11],"called":[12],"second":[13],"level":[14,93],"inference":[15],"tasks,":[16],"that":[17,20,135,190],"is,":[18],"problems":[19],"involve":[21],"a":[22,65,143,162,166,173],"third":[23],"operation,":[24],"such":[25,131],"as":[26,64],"maximization":[27],"or":[28,43],"normalization,":[29],"on":[30,96,112,184],"top":[31],"addition":[33],"and":[34,36,125,160,187],"multiplication,":[35],"thus":[37,126,152],"go":[38],"beyond":[39],"well-known":[41],"weighted":[42],"algebraic":[44],"model":[45,78],"counting":[46,79],"setting":[47],"probabilistic":[49],"under":[52],"distribution":[54],"semantics.":[55],"We":[56,133],"introduce":[57,159],"Second":[58],"Level":[59],"Algebraic":[60],"Model":[61],"Counting":[62],"(2AMC)":[63],"generic":[66],"framework":[67],"for":[68,103,176],"these":[69,150],"kinds":[70],"problems.":[72],"As":[73],"2AMC":[74,105,144],"is":[75,82,87],"to":[76,83,90,146,164],"(algebraic)":[77],"what":[80],"forall-exists-SAT":[81],"propositional":[84],"satisfiability,":[85],"it":[86],"notoriously":[88],"hard":[89],"solve.":[91],"First":[92],"techniques":[94],"based":[95],"Knowledge":[97],"Compilation":[98],"(KC)":[99],"have":[100],"been":[101],"adapted":[102],"specific":[104],"instances":[106],"by":[107],"imposing":[108],"variable":[109],"order":[110],"constraints":[111,118,170],"resulting":[114],"circuit.":[115],"However,":[116],"those":[117],"can":[119,137,194],"severely":[120],"increase":[121],"circuit":[123],"size":[124],"decrease":[127],"efficiency":[129],"approaches.":[132],"show":[134],"we":[136,158],"exploit":[138],"logical":[140],"structure":[141],"problem":[145],"omit":[147],"parts":[148],"constraints,":[151],"limiting":[153],"negative":[155],"effect.":[156],"Furthermore,":[157],"implement":[161],"strategy":[163],"generate":[165],"sufficient":[167],"set":[168],"statically,":[171],"with":[172],"priori":[174],"guarantees":[175],"performance":[178],"KC.":[180],"Our":[181],"empirical":[182],"evaluation":[183],"several":[185],"benchmarks":[186],"tasks":[188],"confirms":[189],"our":[191],"theoretical":[192],"results":[193],"translate":[195],"into":[196],"more":[197],"efficient":[198],"solving":[199],"in":[200],"practice.":[201]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4}],"updated_date":"2026-05-22T06:13:13.366637","created_date":"2025-10-10T00:00:00"}