selp - A Single-Shot Epistemic Logic Program Solver. 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.
Keywords for this software
References in zbMATH (referenced in 8 articles )
Showing results 1 to 8 of 8.
- Hecher, Markus: Treewidth-aware reductions of normal \textscASPto \textscSAT- is normal \textscASPHarder than \textscSATafter all? (2022)
- Besin, Viktor; Hecher, Markus; Woltran, Stefan: Utilizing treewidth for quantitative reasoning on epistemic logic programs (2021)
- Bichler, Manuel; Morak, Michael; Woltran, Stefan: selp: a single-shot epistemic logic program solver (2020)
- Brewka, Gerhard; Diller, Martin; Heissenberger, Georg; Linsbichler, Thomas; Woltran, Stefan: Solving advanced argumentation problems with answer set programming (2020)
- Constantini, Stefania: About epistemic negation and world views in epistemic logic programs (2019)
- Faber, Wolfgang; Morak, Michael; Woltran, Stefan: On uniform equivalence of epistemic logic programs (2019)
- Kahl, Patrick Thor; Leclerc, Anthony P.; Tran, Son Cao: A parallel memory-efficient epistemic logic program solver: harder, better, faster (2019)
- Morak, Michael: Epistemic logic programs: a different world view (2019)