{"id":"https://openalex.org/W4385438527","doi":"https://doi.org/10.24963/kr.2023/34","title":"The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits","display_name":"The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits","publication_year":2023,"publication_date":"2023-07-31","ids":{"openalex":"https://openalex.org/W4385438527","doi":"https://doi.org/10.24963/kr.2023/34"},"language":"en","primary_location":{"id":"doi:10.24963/kr.2023/34","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2023/34","pdf_url":"https://proceedings.kr.org/2023/34/kr2023-0034-hecher-et-al.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://proceedings.kr.org/2023/34/kr2023-0034-hecher-et-al.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056989280","display_name":"Markus Hecher","orcid":"https://orcid.org/0000-0003-0131-6771"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Markus Hecher","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, United States","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","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":["Vienna University of Technology, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1586,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51785877,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"344","last_page":"354"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994000196456909,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9847999811172485,"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.9801999926567078,"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/treewidth","display_name":"Treewidth","score":0.8874540328979492},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7466446161270142},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.5840789079666138},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.5828284621238708},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.567872941493988},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5491880178451538},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5179089903831482},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.49513402581214905},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4681931436061859},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4618277847766876},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.42704692482948303},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.41269657015800476},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41137757897377014},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3956672251224518},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3824668824672699},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37158524990081787},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1309734582901001},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11654862761497498},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.11194023489952087},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.09943312406539917}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8874540328979492},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7466446161270142},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.5840789079666138},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.5828284621238708},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.567872941493988},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5491880178451538},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5179089903831482},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.49513402581214905},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4681931436061859},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4618277847766876},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.42704692482948303},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.41269657015800476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41137757897377014},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3956672251224518},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3824668824672699},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37158524990081787},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1309734582901001},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11654862761497498},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.11194023489952087},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.09943312406539917},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/kr.2023/34","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2023/34","pdf_url":"https://proceedings.kr.org/2023/34/kr2023-0034-hecher-et-al.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/kr.2023/34","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2023/34","pdf_url":"https://proceedings.kr.org/2023/34/kr2023-0034-hecher-et-al.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1975729292","display_name":null,"funder_award_id":"W1255-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G29884786","display_name":"Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI","funder_award_id":"ICT19-065","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G6483656518","display_name":null,"funder_award_id":"ICT19-065","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8680849391","display_name":"Logical Methods in Computer Science","funder_award_id":"W1255","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8951755804","display_name":"HYPAR - Hybrid Parameterized Problem Solving in Practice","funder_award_id":"P32830","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385438527.pdf"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W9945751","https://openalex.org/W89328955","https://openalex.org/W98741451","https://openalex.org/W143512583","https://openalex.org/W202248608","https://openalex.org/W1487043773","https://openalex.org/W1537730723","https://openalex.org/W1537956083","https://openalex.org/W1633347946","https://openalex.org/W1672891595","https://openalex.org/W1824971879","https://openalex.org/W2004414305","https://openalex.org/W2029448190","https://openalex.org/W2079430756","https://openalex.org/W2087432892","https://openalex.org/W2313886575","https://openalex.org/W2399343913","https://openalex.org/W2604156327","https://openalex.org/W2741061345","https://openalex.org/W2758822314","https://openalex.org/W2804796373","https://openalex.org/W2966185954","https://openalex.org/W2984546510","https://openalex.org/W3010041377","https://openalex.org/W3035758390","https://openalex.org/W3099451540","https://openalex.org/W3177280612","https://openalex.org/W3202204722","https://openalex.org/W3204797423","https://openalex.org/W3206345580","https://openalex.org/W3207807568","https://openalex.org/W4226051860","https://openalex.org/W4286901315","https://openalex.org/W4286908393","https://openalex.org/W4289791219","https://openalex.org/W4293180278","https://openalex.org/W4297970684","https://openalex.org/W4298084898","https://openalex.org/W4307419862","https://openalex.org/W6600411887","https://openalex.org/W6604026378","https://openalex.org/W6608145652","https://openalex.org/W6632453066","https://openalex.org/W6636646056","https://openalex.org/W6637298476","https://openalex.org/W6642206136","https://openalex.org/W6667971289","https://openalex.org/W6699108833","https://openalex.org/W6735690607","https://openalex.org/W6742172080","https://openalex.org/W6744888229","https://openalex.org/W6750289833","https://openalex.org/W6774655685","https://openalex.org/W6785305666","https://openalex.org/W6786726591"],"related_works":["https://openalex.org/W2963321374","https://openalex.org/W2504339508","https://openalex.org/W2610304232","https://openalex.org/W4324324081","https://openalex.org/W149544036","https://openalex.org/W2741679812","https://openalex.org/W4301514548","https://openalex.org/W4390306923","https://openalex.org/W4296193292","https://openalex.org/W4385438527"],"abstract_inverted_index":{"Answer":[0],"Set":[1],"Programming":[2],"is":[3,111],"a":[4,72,180,216],"widely":[5],"used":[6],"paradigm":[7],"in":[8,24,68,105,129,132,199],"knowledge":[9],"representation":[10],"and":[11,37],"reasoning,":[12],"which":[13,142],"strongly":[14],"relates":[15],"to":[16,77,82,113,146,163],"the":[17,25,29,69,95,133,208],"satisfiability":[18],"(SAT)":[19],"of":[20,27,32,71,108,124,166,201],"propositional":[21],"formulas.":[22],"While":[23,188],"area":[26],"SAT":[28,78,167],"last":[30],"couple":[31],"years":[33],"brought":[34],"significant":[35],"advances":[36],"different":[38,161],"techniques":[39],"for":[40,65,86,94,150,195],"solving":[41],"hard":[42],"counting-based":[43,106,148,164],"problems":[44,149],"(e.g.,":[45],"#SAT,":[46],"weighted":[47],"counting,":[48],"projected":[49],"counting)":[50],"that":[51,74,100,168,203],"require":[52],"more":[53],"effort":[54],"than":[55,119,207],"deciding":[56],"satisfiability,":[57],"ASP":[58,110,151],"still":[59,192],"falls":[60],"short.":[61],"Intuitively,":[62],"one":[63],"explanation":[64],"this":[66,125,138,157],"lies":[67,128],"structure":[70],"program,":[73],"\u2013":[75,79],"compared":[76],"was":[80],"shown":[81],"yield":[83],"strong":[84],"evidence":[85],"being":[87],"slightly":[88,117],"less":[89],"useful":[90],"during":[91],"solving.":[92],"Indeed,":[93],"well-known":[96],"structural":[97,209],"measure":[98],"treewidth":[99],"plays":[101],"an":[102],"important":[103],"role":[104],"variants":[107,165],"SAT,":[109],"expected":[112],"be":[114],"at":[115],"least":[116],"harder":[118],"SAT.":[120],"The":[121],"underlying":[122],"source":[123],"hardness":[126],"increase":[127],"cyclic":[130],"dependencies":[131,210],"positive":[134],"dependency":[135],"graph.":[136],"In":[137],"work,":[139],"we":[140,159,178,212],"consider":[141],"strategies":[143],"are":[144,204],"appropriate":[145],"tackle":[147],"depending":[152],"on":[153,184],"cycle":[154,176,190],"lengths.":[155],"To":[156],"end,":[158],"present":[160],"encodings":[162],"thereby":[169],"directly":[170],"utilize":[171],"recent":[172],"advances.":[173],"For":[174],"small":[175],"lengths,":[177],"demonstrate":[179],"novel":[181],"strategy":[182],"based":[183],"feedback":[185],"vertex":[186],"sets.":[187],"medium":[189],"lengths":[191],"leave":[193],"room":[194],"future":[196],"improvements,":[197],"surprisingly,":[198],"case":[200],"cycles":[202],"significantly":[205],"larger":[206],"(treewidth),":[211],"can":[213],"even":[214],"obtain":[215],"polynomial":[217],"algorithm.":[218]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}