no code implementations • 13 Nov 2023 • Johannes K. Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac
However, navigating through parts of the solution space requires counting many times, which is expensive in theory.
no code implementations • 30 May 2023 • Johannes K. Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran
Inspired by the observation that the so-called "treewidth" is one of the most prominent structural parameters, our algorithm utilizes small treewidth of the primal graph of the input instance.
no code implementations • 10 May 2022 • Emmanuelle Dietz, Johannes K. Fichte, Florim Hamiti
Cognitive theories for reasoning are about understanding how humans come to conclusions from a set of premises.
no code implementations • 14 Dec 2021 • Johannes K. Fichte, Sarah Alice Gaggl, Dominik Rusovac
For example, when a user aims to identify a specific answer set according to her needs, or requires the total number of diverging solutions to comprehend probabilistic applications such as reasoning in medical domains.
no code implementations • 2 Dec 2020 • Johannes K. Fichte, Markus Hecher, Florim Hamiti
We hope that the results can be a good indicator of the current feasibility of model counting and spark many new applications.
1 code implementation • 9 Nov 2020 • Johannes K. Fichte, Markus Hecher, Andre Schidler
We show that admissibility is indeed weaker than consistency and establish correctness of the DS* algorithm when using an admissible heuristic function.
no code implementations • 5 Aug 2020 • Johannes K. Fichte, Markus Hecher, Stefan Szeider
We compare the impact of hardware advancement and algorithm advancement for SAT solving over the last two decades.
2 code implementations • 29 Apr 2020 • Johannes K. Fichte, Norbert Manthey, Julian Stecklina, André Schidler
Huge pages allow to reduce the overhead that is required to translate memory addresses between the virtual memory of the operating system and the physical memory of the hardware.
no code implementations • 13 Jan 2020 • Johannes K. Fichte, Markus Hecher, Patrick Thier, Stefan Woltran
This paper deals with counting problems for instances of small treewidth.
no code implementations • 24 Jul 2019 • Mario Alviano, Carmine Dodaro, Johannes K. Fichte, Markus Hecher, Tobias Philipp, Jakob Rath
Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs.
no code implementations • 28 Nov 2018 • Johannes K. Fichte, Markus Hecher, Arne Meier
In this paper, we consider counting and projected model counting of extensions in abstract argumentation for various semantics.
no code implementations • 14 May 2018 • Johannes K. Fichte, Michael Morak, Markus Hecher, Stefan Woltran
It runs in time $O({2^{2^{k+4}} n^2})$ where k is the treewidth and n is the input size of the instance.
no code implementations • 28 Jun 2017 • Johannes K. Fichte, Markus Hecher, Irina Schindler
In this paper, we study Reiter's propositional default logic when the treewidth of a certain graph representation (semi-primal graph) of the input theory is bounded.
1 code implementation • 28 Jun 2017 • Johannes K. Fichte, Markus Hecher, Michael Morak, Stefan Woltran
In this paper, we describe underlying concepts of our new implementation (DynASP2. 5) that shows competitive behavior to state-of-the-art ASP solvers even for finding just one solution when solving problems as the Steiner tree problem that have been modeled in ASP on graphs with low treewidth.
no code implementations • 19 Feb 2016 • Johannes K. Fichte, Arne Meier, Irina Schindler
In this paper, we introduce a notion of backdoors to Reiter's propositional default logic and study structural properties of it.
no code implementations • 20 Jul 2015 • Johannes K. Fichte, Miroslaw Truszczynski, Stefan Woltran
Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers.