Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
From MaRDI portal
Publication:5019599
DOI10.1017/S1471068421000399OpenAlexW3214340885MaRDI QIDQ5019599
Viktor Besin, Markus Hecher, Stefan Woltran
Publication date: 10 January 2022
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.03022
treewidthtree decompositionsabstractionshybrid solvingnested dynamic programmingepistemic logic programming
Related Items (2)
Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ A practical account into counting Dung's extensions by dynamic programming
Uses Software
Cites Work
- Unnamed Item
- Evaluating epistemic negation in answer set programming
- On the computational cost of disjunctive logic programming: Propositional case
- A multiparametric view on answer set programming
- Splitting epistemic logic programs
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- Revisiting Epistemic Specifications
- The language of epistemic specifications (refined) including a prototype solver
- Clique-Width and Directed Width Measures for Answer-Set Programming
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Combining Treewidth and Backdoors for CSP.
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- selp: A Single-Shot Epistemic Logic Program Solver
- eclingo : A Solver for Epistemic Logic Programs
- Lower Bounds for QBFs of Bounded Treewidth
- Fixed-parameter complexity of semantics for logic programs
This page was built for publication: Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
