Author of the publication

Decomposition-Guided Reductions for Argumentation and Treewidth

, , , and . Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021, page 1880--1886. (2021)
DOI: 10.24963/ijcai.2021/259

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology., , and . SAT, volume 12178 of Lecture Notes in Computer Science, page 343-360. Springer, (2020)The D-FLAT System for Dynamic Programming on Tree Decompositions., , , , , and . JELIA, volume 8761 of Lecture Notes in Computer Science, page 558-572. Springer, (2014)D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy., , , and . Fundam. Informaticae, 147 (1): 27-61 (2016)Treewidth-Aware Quantifier Elimination and Expansion for QCSP., , and . CP, volume 12333 of Lecture Notes in Computer Science, page 248-266. Springer, (2020)Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs., , and . Theory Pract. Log. Program., 21 (5): 575-592 (2021)Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF., , , , and . LICS, page 1-14. (2023)Werkzeuge und Methoden zum Lösen von Problemen mittels Baumweite .. Ausgezeichnete Informatikdissertationen, volume D-22 of LNI, GI, (2021)Counting Answer Sets via Dynamic Programming., , , and . CoRR, (2016)An SMT Approach to Fractional Hypertree Width., , , and . CP, volume 11008 of Lecture Notes in Computer Science, page 109-127. Springer, (2018)Exploiting Treewidth for Projected Model Counting and Its Limits., , , and . SAT, volume 10929 of Lecture Notes in Computer Science, page 165-184. Springer, (2018)