Treffer: Solver fast prototyping for reduct-based ELP semantics

Over time, various semantic frameworks have emerged for Epistemic Logic Programs (ELPs), which extend Answer Set Programming (ASP) by incorporating epistemic operators. These frameworks often define ELP semantics in terms of "world views," comprising sets of belief sets. Many of these approaches are "reduct-based," mirroring techniques used in ASP. They typically involve starting with a candidate world view, constructing the program’s reduct based on this candidate, determining the stable models of the reduct, and verifying whether the candidate indeed forms a valid world view. Several solvers have been devised for these methods. However, ongoing debates over the "right" semantics continue, leading to the introduction of new variations. We recently proposed a rapid prototyping approach to facilitate experimentation with reduct-based semantics. This approach allows for testing on small to medium-sized programs before investing resources in developing dedicated solvers. In this paper, we refine this method in our paper and showcase its implementation in the ASP Chef System, applying it to various well-established seminal semantic approaches.