Search Results for author:
Found 16 papers, 3 papers with code
IASCAR: Incremental Answer Set Counting by Anytime Refinement
However, navigating through parts of the solution space requires counting many times, which is expensive in theory.
Solving Projected Model Counting by Utilizing Treewidth and its Limits
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.
A Quantitative Symbolic Approach to Individual Human Reasoning
Cognitive theories for reasoning are about understanding how humans come to conclusions from a set of premises.
Rushing and Strolling among Answer Sets -- Navigation Made Easy
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.
The Model Counting Competition 2020
We hope that the results can be a good indicator of the current feasibility of model counting and spark many new applications.
Solving the Steiner Tree Problem with few Terminals
We show that admissibility is indeed weaker than consistency and establish correctness of the DS* algorithm when using an admissible heuristic function.
A Time Leap Challenge for SAT Solving
We compare the impact of hardware advancement and algorithm advancement for SAT solving over the last two decades.
Towards Faster Reasoners By Using Transparent Huge Pages
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.
Exploiting Database Management Systems and Treewidth for Counting
This paper deals with counting problems for instances of small treewidth.
Inconsistency Proofs for ASP: The ASP-DRUPE Format
Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs.
Counting Complexity for Reasoning in Abstract Argumentation
In this paper, we consider counting and projected model counting of extensions in abstract argumentation for various semantics.
Exploiting Treewidth for Projected Model Counting and its Limits
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.
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
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.
Default Logic and Bounded Treewidth
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.
Strong Backdoors for Default Logic
In this paper, we introduce a notion of backdoors to Reiter's propositional default logic and study structural properties of it.
Dual-normal Logic Programs - the Forgotten Class
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.
