selp: a single-shot epistemic logic program solver
From MaRDI portal
Publication:4957201
Abstract: Epistemic Logic Programs (ELPs) are an extension of Answer Set Programming (ASP) with epistemic operators that allow for a form of meta-reasoning, that is, reasoning over multiple possible worlds. Existing ELP solving approaches generally rely on making multiple calls to an ASP solver in order to evaluate the ELP. However, in this paper, we show that there also exists a direct translation from ELPs into non-ground ASP with bounded arity. The resulting ASP program can thus be solved in a single shot. We then implement this encoding method, using recently proposed techniques to handle large, non-ground ASP rules, into the prototype ELP solving system "selp", which we present in this paper. This solver exhibits competitive performance on a set of ELP benchmark instances. Under consideration in Theory and Practice of Logic Programming (TPLP).
Recommendations
- \texttt{eclingo}: a solver for epistemic logic programs
- A parallel memory-efficient epistemic logic program solver: harder, better, faster
- Utilizing treewidth for quantitative reasoning on epistemic logic programs
- About epistemic negation and world views in epistemic logic programs
- Splitting epistemic logic programs
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- A parallel memory-efficient epistemic logic program solver: harder, better, faster
- Complexity results for answer set programming with bounded predicate arities and implications
- Conflict-driven answer set solving: from theory to practice
- Equilibrium logic
- Evaluating epistemic negation in answer set programming
- FLP answer set semantics without circular justifications for general logic programs
- Logic programming and reasoning with incomplete information
- Logic programming with graded introspection
- Multi-shot ASP solving with clingo
- Nested expressions in logic programs
- New semantics for epistemic specifications
- On the computational cost of disjunctive logic programming: Propositional case
- On uniform equivalence of epistemic logic programs
- Preprocessing of complex non-ground rules in answer set programming
- Revisiting Epistemic Specifications
- Semantics and complexity of recursive aggregates in answer set programming
- Solution Enumeration for Projected Boolean Search Problems
- Stable models and circumscription
- The impact of treewidth on grounding and solving of answer set programs
- The language of epistemic specifications (refined) including a prototype solver
- The power of non-ground rules in Answer Set Programming
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(7)- A parallel memory-efficient epistemic logic program solver: harder, better, faster
- \texttt{eclingo}: a solver for epistemic logic programs
- Thirty years of Epistemic Specifications
- Utilizing treewidth for quantitative reasoning on epistemic logic programs
- On uniform equivalence of epistemic logic programs
- About epistemic negation and world views in epistemic logic programs
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
This page was built for publication: selp: a single-shot epistemic logic program solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957201)
