Epistemic logic programs: a different world view
From MaRDI portal
Recommendations
Cites work
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Discovering classes of strongly equivalent logic programs
- Evaluating epistemic negation in answer set programming
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- Logic Programming and Nonmonotonic Reasoning
- Logic programming and reasoning with incomplete information
- Minimal Logic Programs
- Model-based recasting in answer-set programming
- 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
- Revisiting Epistemic Specifications
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- The language of epistemic specifications (refined) including a prototype solver
Cited in
(5)- Autoepistemic equilibrium logic and epistemic specifications
- Logics for epistemic programs
- Utilizing treewidth for quantitative reasoning on epistemic logic programs
- Epistemic logic programs: a study of some properties
- Body-decoupled grounding via reduction: a novel approach on the \textsc{Asp} bottleneck
This page was built for publication: Epistemic logic programs: a different world view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020544)
