Revisiting Epistemic Specifications

DOI10.1007/978-3-642-20832-4_20zbMath1326.68280arXiv1108.3279OpenAlexW1586014657MaRDI QIDQ3001928

Miroslaw Truszczynski

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.3279

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items (18)

Evaluating epistemic negation in answer set programming ⋮ Logic Programming with Graded Modality ⋮ Characterizing and extending answer set semantics using possibility theory ⋮ Thirty years of Epistemic Specifications ⋮ Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting ⋮ About Epistemic Negation and World Views in Epistemic Logic Programs ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ Epistemic logic programs: a study of some properties ⋮ Unnamed Item ⋮ eclingo : A Solver for Epistemic Logic Programs ⋮ Determining inference semantics for disjunctive 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 ⋮ Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming

This page was built for publication: Revisiting Epistemic Specifications