Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
From MaRDI portal
Publication:2667835
Cites work
- \textsc{lp2normal} -- a normalization tool for extended logic programs
- \texttt{eclingo}: a solver for epistemic logic programs
- A c^k n 5-approximation algorithm for treewidth
- A multiparametric view on answer set programming
- Algorithms for propositional model counting
- Answer set based design of knowledge systems
- Answer set programming modulo acyclicity
- Answer set solving with bounded treewidth revisited
- ASP-Core-2 input language format
- ASSAT: computing answer sets of a logic program by SAT solvers
- Autoepistemic logic
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Clique-width and directed width measures for answer-set programming
- Complexity of Finding Embeddings in a k-Tree
- Double-exponential and triple-exponential bounds for choosability problems parameterized by treewidth
- Evaluation of disjunctive programs in WASP
- Expansion-based QBF solving on tree decompositions
- Exploiting treewidth for projected model counting and its limits
- Fundamentals of parameterized complexity
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 978240 (Why is no real title available?)
- scientific article; zbMATH DE number 1470716 (Why is no real title available?)
- scientific article; zbMATH DE number 1453071 (Why is no real title available?)
- scientific article; zbMATH DE number 6747915 (Why is no real title available?)
- scientific article; zbMATH DE number 6783431 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Lower Bounds for QBFs of Bounded Treewidth
- Multi-shot ASP solving with clingo
- Negation by default and unstratifiable logic programs
- Normalizing cardinality rules using merging and sorting constructions
- On the computational cost of disjunctive logic programming: Propositional case
- Parameterized algorithms
- Parametrized complexity theory.
- Practical access to dynamic programming on tree decompositions
- Propositional semantics for disjunctive logic programs
- SAT-based local improvement for finding tree decompositions of small width
- selp: a single-shot epistemic logic program solver
- Solution Enumeration for Projected Boolean Search Problems
- Some (in)translatability results for normal logic programs and propositional theories
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- The impact of treewidth on grounding and solving of answer set programs
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- Tractable answer-set programming with weight constraints: bounded treewidth is not enough
- Train scheduling with hybrid ASP
- Treewidth and counting projected answer sets
- Treewidth with a quantifier alternation revisited
- Treewidth. Computations and approximations
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- Utilizing treewidth for quantitative reasoning on epistemic logic programs
- Which problems have strongly exponential complexity?
- Why are there so many loop formulas?
Cited in
(8)- Does Treewidth Help in Modal Satisfiability?
- Aspmc: new frontiers of algebraic answer set counting
- Strong backdoors for default logic
- Strong backdoors for default logic
- IASCAR: incremental answer set counting by anytime refinement
- Solving decision theory problems with probabilistic answer set programming
- A fast and accurate ASP counting based network reliability estimator
- Reducing treewidth for SAT-related problems using simple liftings
This page was built for publication: Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667835)
