{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/answer-set-solving-with-bounded-treewidth","title":"Answer Set Solving with Bounded Treewidth Revisited","arxiv_id":"1702.02890","date":"2017-02-09","proceeding":null,"authors":["Johannes Fichte","Markus Hecher","Michael Morak","Stefan Woltran"],"abstract":"Parameterized algorithms are a way to solve hard problems more efficiently,\ngiven that a specific parameter of the input is small. In this paper, we apply\nthis idea to the field of answer set programming (ASP). To this end, we propose\ntwo kinds of graph representations of programs to exploit their treewidth as a\nparameter. Treewidth roughly measures to which extent the internal structure of\na program resembles a tree. Our main contribution is the design of\nparameterized dynamic programming algorithms, which run in linear time if the\ntreewidth and weights of the given program are bounded. Compared to previous\nwork, our algorithms handle the full syntax of ASP. Finally, we report on an\nempirical evaluation that shows good runtime behaviour for benchmark instances\nof low treewidth, especially for counting answer sets.","url_abs":"http://arxiv.org/abs/1702.02890v1","url_pdf":"http://arxiv.org/pdf/1702.02890v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"answer-set-solving-with-bounded-treewidth","repo_url":"https://github.com/daajoe/lpnmr17_experiments","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}