selp: a single-shot epistemic logic program solver

From MaRDI portal
Publication:4957201

DOI10.1017/S1471068420000022zbMATH Open1472.68022arXiv2001.01089OpenAlexW3008962280MaRDI QIDQ4957201FDOQ4957201


Authors: Manuel Bichler, Michael Morak, Stefan Woltran Edit this on Wikidata


Publication date: 3 September 2021

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Abstract: Epistemic Logic Programs (ELPs) are an extension of Answer Set Programming (ASP) with epistemic operators that allow for a form of meta-reasoning, that is, reasoning over multiple possible worlds. Existing ELP solving approaches generally rely on making multiple calls to an ASP solver in order to evaluate the ELP. However, in this paper, we show that there also exists a direct translation from ELPs into non-ground ASP with bounded arity. The resulting ASP program can thus be solved in a single shot. We then implement this encoding method, using recently proposed techniques to handle large, non-ground ASP rules, into the prototype ELP solving system "selp", which we present in this paper. This solver exhibits competitive performance on a set of ELP benchmark instances. Under consideration in Theory and Practice of Logic Programming (TPLP).


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




Recommendations




Cites Work


Cited In (7)

Uses Software





This page was built for publication: selp: a single-shot epistemic logic program solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957201)