scientific article; zbMATH DE number 7453102
From MaRDI portal
Publication:5020544
Publication date: 6 January 2022
Full work available at URL: https://arxiv.org/abs/1909.08233
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Autoepistemic equilibrium logic and epistemic specifications ⋮ Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Evaluating epistemic negation in answer set programming
- 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
- Model-based recasting in answer-set programming
- Strong equivalence made easy: nested expressions and weight constraints
- On Uniform Equivalence of Epistemic Logic Programs
- Logic Programming and Nonmonotonic Reasoning
- Strongly equivalent logic programs
This page was built for publication:
