Search Results for author:
Found 21 papers, 4 papers with code
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.
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.
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.
Answer Set Solving with Bounded Treewidth Revisited
Parameterized algorithms are a way to solve hard problems more efficiently, given that a specific parameter of the input is small.
Counting Answer Sets via Dynamic Programming
While the solution counting problem for propositional satisfiability (#SAT) has received renewed attention in recent years, this research trend has not affected other AI solving paradigms like answer set programming (ASP).
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.
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.
Lower Bounds for QBFs of Bounded Treewidth
More formally, we establish lower bounds for QSAT and treewidth, namely, that under ETH there cannot be an algorithm that solves QSAT of quantifier depth i in runtime significantly better than i-fold exponential in the treewidth and polynomial in the input size.
Structural Decompositions of Epistemic Logic Programs
Epistemic logic programs (ELPs) are a popular generalization of standard Answer Set Programming (ASP) providing means for reasoning over answer sets within the language.
Exploiting Database Management Systems and Treewidth for Counting
This paper deals with counting problems for instances of small treewidth.
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard
The exponential time hypothesis (ETH) implies that this result is tight for SAT, that is, SAT cannot be solved in subexponential time.
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.
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.
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.
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
In this paper, we take a next step and contribute to epistemic logic programming in two ways: First, we establish quantitative reasoning for ELPs, where the acceptance of a certain set of literals depends on the number (proportion) of world views that are compatible with the set.
Advanced Tools and Methods for Treewidth-Based Problem Solving -- Extended Abstract
We present a new type of problem reduction, which is referred to by decomposition-guided (DG).
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?
In this paper we propose a novel reduction from normal ASP to SAT that is aware of the treewidth, and guarantees that a slight increase of treewidth is indeed sufficient.
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?
This paper deals with a novel reduction from SAT to normal ASP that goes beyond well-known encodings: We explicitly utilize the structural power of ASP, whereby we sublinearly decrease the treewidth, which probably cannot be significantly improved.
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.
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.
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Our results provide an in-depth hardness study, relying on a novel reduction from normal to disjunctive programs, trading the increase of complexity for an exponential parameter compression.
