The language of epistemic specifications (refined) including a prototype solver

DOI10.1093/LOGCOM/EXV065zbMath1489.68272OpenAlexW2468539056MaRDI QIDQ3304094

No author found.

Publication date: 5 August 2020

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exv065

zbMATH Keywords

knowledge representationnonmonotonic reasoninglogic programmingconformant planningepistemic logic programsepistemic specificationsanswer set programming extensionsintrospective reasoningrule safetysorted signature

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items (14)

Evaluating epistemic negation in answer set programming ⋮ Logic Programming with Graded Modality ⋮ Thirty years of Epistemic Specifications ⋮ Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ Epistemic logic programs: a study of some properties ⋮ Unnamed Item ⋮ eclingo : A Solver for Epistemic Logic Programs ⋮ selp: A Single-Shot Epistemic Logic Program Solver ⋮ Splitting Epistemic Logic Programs ⋮ Autoepistemic answer set programming ⋮ Autoepistemic equilibrium logic and epistemic specifications ⋮ A parallel memory-efficient epistemic logic program solver: harder, better, faster ⋮ Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs

This page was built for publication: The language of epistemic specifications (refined) including a prototype solver