Следене
Johannes K. Fichte
Заглавие
Позовавания
Позовавания
Година
Clause-learning algorithms with many restarts and bounded-width resolution
A Atserias, J Fichte, M Thurley
Journal of Artificial Intelligence Research (JAIR) 40, 353-373, 2011
1332011
Backdoors to tractable answer set programming
JK Fichte, S Szeider
Artificial Intelligence 220, 64-103, 2015
55*2015
Answer set solving with bounded treewidth revisited
JK Fichte, M Hecher, M Morak, S Woltran
Logic Programming and Nonmonotonic Reasoning: 14th International Conference …, 2017
47*2017
Backdoors to Normality for Disjunctive Logic Programs.
JK Fichte, S Szeider
ACM Transactions on Computational Logic (TOCL) 17 (1), 7:1--7:23, 2015
402015
The model counting competition 2020
JK Fichte, M Hecher, F Hamiti
Journal of Experimental Algorithmics (JEA) 26 (1), 1-26, 2021
362021
Solving Projected Model Counting by Utilizing Treewidth and its Limits
JK Fichte, M Hecher, M Morak, P Thier, S Woltran
Artificial Intelligence 314, 103810, 2023
31*2023
Exploiting Database Management Systems and Treewidth for Counting
JK Fichte, M Hecher, P Thier, S Woltran
Practical Aspects of Declarative Languages, 151, 2020
292020
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration
MA Dzulfikar, JK Fichte, M Hecher
14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019
292019
Weighted model counting on the GPU by exploiting small treewidth
JK Fichte, M Hecher, S Woltran, M Zisser
26th Annual European Symposium on Algorithms (ESA 2018), 2018
272018
An SMT approach to fractional hypertree width
JK Fichte, M Hecher, N Lodha, S Szeider
Principles and Practice of Constraint Programming: 24th International …, 2018
252018
An improved GPU-based SAT model counter
JK Fichte, M Hecher, M Zisser
Principles and Practice of Constraint Programming: 25th International …, 2019
24*2019
Exploiting treewidth for counting projected answer sets
JK Fichte, M Hecher
Proceedings of the 16th International Conference on Principles of Knowledge …, 2018
24*2018
SAT-based local improvement for finding tree decompositions of small width
JK Fichte, N Lodha, S Szeider
Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017
232017
Counting complexity for reasoning in abstract argumentation
JK Fichte, M Hecher, A Meier
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2827-2834, 2019
222019
Lower Bounds for QBFs of Bounded Treewidth
JK Fichte, M Hecher, A Pfandler
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020
212020
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
JK Fichte, M Hecher, M Morak, S Woltran
12th International Symposium on Parameterized and Exact Computation (IPEC …, 2018
21*2018
A time leap challenge for SAT-solving
JK Fichte, M Hecher, S Szeider
Principles and Practice of Constraint Programming: 26th International …, 2020
192020
Default logic and bounded treewidth
JK Fichte, M Hecher, I Schindler
Language and Automata Theory and Applications: 12th International Conference …, 2018
13*2018
Rushing and strolling among answer sets–navigation made easy
JK Fichte, SA Gaggl, D Rusovac
Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5651-5659, 2022
112022
A multiparametric view on answer set programming
JK Fichte, M Kronegger, S Woltran
Annals of Mathematics and Artificial Intelligence 86 (1-3), 121-147, 2019
102019
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20