selp - A Single-Shot Epistemic Logic Program Solver
Contents
News
Release of selp 1.0
2018-05-01Version 1.0 of the selp tool is now available (see Downloads).
TopDocumentation
selp (Single-shot Epistemic Logic Program solver) is a solver for Epistemic Logic Programs (ELPs), that is, programs that use an extended version of the language of Answer Set Programming (ASP) that, in particular, allows users to express epistemic negation. selp works by polynomially rewriting the input ELP into a non-ground disjunctive ASP program, making use of long rule bodies. This allows a subsequently called ASP solving system to solve this program, and therefore the original ELP in a single shot. In order to deal with large rules and not run into grounding problems, selp uses the lpopt tool in order to split up large rules into multiple smaller rules. selp is explicitly tailored to generate rules in such a way that lpopt can split them up as well as possible.
A description of the system, the rewriting, and other theoretical underpinnings, are contained in this paper.
Downloads
The selp source code is available under the open-source GPLv3
license. It requires python, lpopt, and the ASP grounder/solver gringo/clasp to
run.
Version 1.0
Benchmark Archive
TopContact
In case of questions, bug reports or comments, please send an e-mail to Michael Morak.
Top