{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:58:08Z","timestamp":1762102688597},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:p>Probabilistic reasoning, parameter learning, and most probable explanation inference for answer set programming have recently received growing attention. They are only some of the problems that can be formulated as Algebraic Answer Set Counting (AASC) problems. The latter are however hard to solve, and efficient evaluation techniques are needed. Inspired by Vlasser et al.'s Tp-compilation (JAR, 2016), we introduce Tp-unfolding, which employs forward reasoning to break the cycles in the positive dependency graph of a program by unfolding them. Tp-unfolding is defined for any normal answer set program and unfolds programs with respect to unfolding sequences, which are akin to elimination orders in SAT-solving. Using \"good\" unfolding sequences, we can ensure that the increase of the treewidth of the unfolded program is small. Treewidth is a measure adhering to a program's tree-likeness, which gives performance guarantees for AASC. We give sufficient conditions for the existence of good unfolding sequences based on the novel notion of component-boosted backdoor size, which measures the cyclicity of the positive dependencies in a program. The experimental evaluation of a prototype implementation, the AASC solver aspmc, shows promising results.<\/jats:p>","DOI":"10.24963\/kr.2021\/26","type":"proceedings-article","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T16:45:56Z","timestamp":1633970756000},"page":"269-279","source":"Crossref","is-referenced-by-count":10,"title":["Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting"],"prefix":"10.24963","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[{"name":"Vienna University of Technology"}]},{"given":"Markus","family":"Hecher","sequence":"additional","affiliation":[{"name":"Vienna University of Technology"}]},{"given":"Rafael","family":"Kiesel","sequence":"additional","affiliation":[{"name":"Vienna University of Technology"}]}],"member":"10584","event":{"number":"18","sponsor":["Artificial Intelligence Journal","Principles of Knowledge Representation and Reasoning Inc.","Sea AI Lab","Potassco Solutions","European Association for Artificial Intelligence"],"acronym":"KR-2021","name":"18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}","start":{"date-parts":[[2020,11,12]]},"theme":"Artificial Intelligence","location":"Hanoii, Vietnam","end":{"date-parts":[[2021,11,18]]}},"container-title":["Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning"],"original-title":[],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T16:46:12Z","timestamp":1633970772000},"score":1,"resource":{"primary":{"URL":"https:\/\/proceedings.kr.org\/2021\/26"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/kr.2021\/26","relation":{},"subject":[],"published":{"date-parts":[[2021,9]]}}}