Epistemic logic programs: a different world view
From MaRDI portal
Publication:5020544
Authors: Michael Morak
Publication date: 6 January 2022
Full work available at URL: https://arxiv.org/abs/1909.08233
Recommendations
Cites Work
- On the computational cost of disjunctive logic programming: Propositional case
- Nested expressions in logic programs
- Title not available (Why is that?)
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- Logic programming and reasoning with incomplete information
- 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
- Logic Programming and Nonmonotonic Reasoning
- Discovering classes of strongly equivalent logic programs
- Minimal Logic Programs
- Model-based recasting in answer-set programming
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- On uniform equivalence of epistemic logic programs
Cited In (4)
Uses Software
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)