A survey of advances in epistemic logic program solvers

09/19/2018
by   Anthony P. Leclerc, et al.
0

Recent research in extensions of Answer Set Programming has included a renewed interest in the language of Epistemic Specifications, which adds modal operators K ("known") and M ("may be true") to provide for more powerful introspective reasoning and enhanced capability, particularly when reasoning with incomplete information. An epistemic logic program is a set of rules in this language. Infused with the research has been the desire for an efficient solver to enable the practical use of such programs for problem solving. In this paper, we report on the current state of development of epistemic logic program solvers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2018

Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)

Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) e...
research
08/05/2020

eclingo: A solver for Epistemic Logic Programs

We describe eclingo, a solver for epistemic logic programs under Gelfond...
research
05/14/2014

ESmodels: An Epistemic Specification Solver

(To appear in Theory and Practice of Logic Programming (TPLP)) ESmodel...
research
04/26/2010

An approach to visualize the course of solving of a research task in humans

A technique to study the dynamics of solving of a research task is sugge...
research
06/04/2013

Narrative based Postdictive Reasoning for Cognitive Robotics

Making sense of incomplete and conflicting narrative knowledge in the pr...
research
05/05/2023

MindGames: Targeting Theory of Mind in Large Language Models with Dynamic Epistemic Modal Logic

Theory of Mind (ToM) is a critical component of intelligence, yet accura...
research
08/17/2021

Thirty years of Epistemic Specifications

The language of epistemic specifications and epistemic logic programs ex...

Please sign up or login with your details

Forgot password? Click here to reset