The impact of treewidth on grounding and solving of answer set programs
From MaRDI portal
Logic programming (68N17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Recommendations
Cited in
(13)- ASP programs with groundings of small treewidth
- A multiparametric view on answer set programming
- Treewidth and counting projected answer sets
- Answer set solving with bounded treewidth revisited
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Clique-width and directed width measures for answer-set programming
- Optimizing answer set computation via heuristic-based decomposition
- selp: a single-shot epistemic logic program solver
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Treewidth in non-ground answer set solving and alliance problems in graphs
- Does Treewidth Help in Modal Satisfiability?
- Algorithms and complexity of difference logic
- Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck
This page was built for publication: The impact of treewidth on grounding and solving of answer set programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208864)
