selp: a single-shot epistemic logic program solver
DOI10.1017/S1471068420000022zbMATH Open1472.68022arXiv2001.01089OpenAlexW3008962280MaRDI QIDQ4957201FDOQ4957201
Authors: Manuel Bichler, Michael Morak, Stefan Woltran
Publication date: 3 September 2021
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.01089
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logics of knowledge and belief (including belief change) (03B42) Logic programming (68N17) Logic in artificial intelligence (68T27)
Cites Work
- Multi-shot ASP solving with clingo
- Logic programming with graded introspection
- On the computational cost of disjunctive logic programming: Propositional case
- Nested expressions in logic programs
- Title not available (Why is that?)
- Semantics and complexity of recursive aggregates in answer set programming
- Equilibrium logic
- Solution Enumeration for Projected Boolean Search Problems
- Title not available (Why is that?)
- Conflict-driven answer set solving: from theory to practice
- Logic programming and reasoning with incomplete information
- FLP answer set semantics without circular justifications for general logic programs
- Evaluating epistemic negation in answer set programming
- Revisiting Epistemic Specifications
- New semantics for epistemic specifications
- The language of epistemic specifications (refined) including a prototype solver
- Well-founded and stable semantics of logic programs with aggregates
- Stable models and circumscription
- Title not available (Why is that?)
- Complexity results for answer set programming with bounded predicate arities and implications
- The impact of treewidth on grounding and solving of answer set programs
- A parallel memory-efficient epistemic logic program solver: harder, better, faster
- Preprocessing of complex non-ground rules in answer set programming
- The power of non-ground rules in Answer Set Programming
- On uniform equivalence of epistemic logic programs
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?
Uses Software
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)