About Epistemic Negation and World Views in Epistemic Logic Programs
From MaRDI portal
Publication:5108503
DOI10.1017/S147106841900019XzbMath1434.68071arXiv1907.09867WikidataQ127225960 ScholiaQ127225960MaRDI QIDQ5108503
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.09867
Related Items (3)
Epistemic logic programs: a study of some properties ⋮ Unnamed Item ⋮ Autoepistemic equilibrium logic and epistemic specifications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Evaluating epistemic negation in answer set programming
- Semantics and complexity of recursive aggregates in answer set programming
- Epistemic answer set programming
- Splitting epistemic logic programs
- Founded world views with autoepistemic equilibrium logic
- A monotonic view on reflexive autoepistemic reasoning
- XSB: Extending Prolog with Tabled Logic Programming
- Revisiting Epistemic Specifications
- New Semantics for Epistemic Specifications
- Negation as a Resource: a Novel View on Answer Set Semantics*
- Extremal problems in logic programming and stable model computation
- A goal-oriented approach to computing the well-founded semantics
- The well-founded semantics for general logic programs
- Transformation-based bottom-up computation of the well-founded model
- Query answering in resource-based answer set semantics
- selp: A Single-Shot Epistemic Logic Program Solver
- Normal forms for answer sets programming
This page was built for publication: About Epistemic Negation and World Views in Epistemic Logic Programs