Utilizing treewidth for quantitative reasoning on epistemic logic programs

DOI10.1017/S1471068421000399MaRDI QIDQ5019599zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

abstractionsepistemic logic programminghybrid solvingnested dynamic programmingtree decompositionstreewidth

Mathematics Subject Classification ID

Logic programming (68N17)

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

Cites work

• \texttt{eclingo}: a solver for epistemic logic programs
• A multiparametric view on answer set programming
• Clique-width and directed width measures for answer-set programming
• Combining treewidth and backdoors for CSP
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• Epistemic logic programs: a different world view
• Evaluating epistemic negation in answer set programming
• Fixed-parameter complexity of semantics for logic programs
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Lower Bounds for QBFs of Bounded Treewidth
• On the computational cost of disjunctive logic programming: Propositional case
• Revisiting Epistemic Specifications
• selp: a single-shot epistemic logic program solver
• Splitting epistemic logic programs
• Taming high treewidth with abstraction, nested dynamic programming, and database technology
• The language of epistemic specifications (refined) including a prototype solver

Cited in

(7)

• A parallel memory-efficient epistemic logic program solver: harder, better, faster
• 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
• \texttt{eclingo}: a solver for epistemic logic programs
• IASCAR: incremental answer set counting by anytime refinement
• Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck

Describes a project that uses

Uses Software

• eclingo
• htd
• selp

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)