( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Structural Decompositions of Epistemic Logic Programs.

, , и . AAAI, стр. 2830-2837. AAAI Press, (2020)

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.

Kurt Hecher

Birgit Hecher

Christine Hecher

Markus Markus

Markus Kurscheidt

Ökonomische Analyse von Sportgroßveranstaltungen: ein integrierter Evaluierungs- und Management-Ansatz am Beispiel von Fußball-Weltmeisterschaften. Uni Paderborn, (2007)
 

Другие публикации лиц с тем же именем

Treewidth-Aware Quantifier Elimination and Expansion for QCSP., , и . CP, том 12333 из Lecture Notes in Computer Science, стр. 248-266. Springer, (2020)D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy., , , и . Fundam. Informaticae, 147 (1): 27-61 (2016)The D-FLAT System for Dynamic Programming on Tree Decompositions., , , , , и . JELIA, том 8761 из Lecture Notes in Computer Science, стр. 558-572. Springer, (2014)Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology., , и . SAT, том 12178 из Lecture Notes in Computer Science, стр. 343-360. Springer, (2020)On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth., , и . ECAI, том 372 из Frontiers in Artificial Intelligence and Applications, стр. 247-254. IOS Press, (2023)Complications for Computational Experiments from Modern Processors., , , и . CP, том 210 из LIPIcs, стр. 25:1-25:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation., , , и . IJCAI, стр. 3212-3220. ijcai.org, (2023)An SMT Approach to Fractional Hypertree Width., , , и . CP, том 11008 из Lecture Notes in Computer Science, стр. 109-127. Springer, (2018)Exploiting Treewidth for Projected Model Counting and Its Limits., , , и . SAT, том 10929 из Lecture Notes in Computer Science, стр. 165-184. Springer, (2018)Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF., , , , и . LICS, стр. 1-14. IEEE, (2023)