Utilizing treewidth for quantitative reasoning on epistemic logic programs
From MaRDI portal
Publication:5019599
DOI10.1017/S1471068421000399OpenAlexW3214340885MaRDI QIDQ5019599FDOQ5019599
Authors: 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
Recommendations
- selp: a single-shot epistemic logic program solver
- \texttt{eclingo}: a solver for epistemic logic programs
- About epistemic negation and world views in epistemic logic programs
- A parallel memory-efficient epistemic logic program solver: harder, better, faster
- Evaluating epistemic negation in answer set programming
treewidthtree decompositionsabstractionshybrid solvingnested dynamic programmingepistemic logic programming
Cites Work
- \texttt{eclingo}: a solver for epistemic logic programs
- On the computational cost of disjunctive logic programming: Propositional case
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Evaluating epistemic negation in answer set programming
- Revisiting Epistemic Specifications
- The language of epistemic specifications (refined) including a prototype solver
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Lower Bounds for QBFs of Bounded Treewidth
- Combining treewidth and backdoors for CSP
- Fixed-parameter complexity of semantics for logic programs
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- A multiparametric view on answer set programming
- Splitting epistemic logic programs
- Title not available (Why is that?)
- Clique-width and directed width measures for answer-set programming
- selp: a single-shot epistemic logic program solver
Cited In (6)
- A parallel memory-efficient epistemic logic program solver: harder, better, faster
- \texttt{eclingo}: a solver for epistemic logic programs
- IASCAR: incremental answer set counting by anytime refinement
- 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
- selp: a single-shot epistemic logic program solver
Uses Software
This page was built for publication: Utilizing treewidth for quantitative reasoning on epistemic logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019599)
