On Uniform Equivalence of Epistemic Logic Programs
From MaRDI portal
Publication:5108505
DOI10.1017/S1471068419000218zbMath1434.68073arXiv1907.10925WikidataQ127226141 ScholiaQ127226141MaRDI QIDQ5108505
Wolfgang Faber, Michael Morak, Stefan Woltran
Publication date: 4 May 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.10925
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Logic programming (68N17)
Related Items (4)
Thirty years of Epistemic Specifications ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ Unnamed Item ⋮ selp: A Single-Shot Epistemic Logic Program Solver
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Evaluating epistemic negation in answer set programming
- Conflict-driven answer set solving: from theory to practice
- On the computational cost of disjunctive logic programming: Propositional case
- Logic programming and reasoning with incomplete information
- Nested expressions in logic programs
- Revisiting Epistemic Specifications
- New Semantics for Epistemic Specifications
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- The language of epistemic specifications (refined) including a prototype solver
- Minimal Logic Programs
- Modularity Aspects of Disjunctive Stable Models
- Model-based recasting in answer-set programming
- Strong equivalence made easy: nested expressions and weight constraints
- selp: A Single-Shot Epistemic Logic Program Solver
- On Uniform Equivalence of Epistemic Logic Programs
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Strongly equivalent logic programs
This page was built for publication: On Uniform Equivalence of Epistemic Logic Programs
