1 August 2022, ICLP'22 Workshop on goal-directed execution of answer set programs, Haifa, Israel

Answer set programming is a successful extension of logic programming for solving combinatorial problems as well as knowledge representation and reasoning problems. Most current implementations of ASP work by grounding a program and using a SAT solver-like technology to find the answer sets. While this approach is extremely efficient, relying on grounding of the program leads to significant blow-up of the program size, and computing the whole model makes finding justification of an atom in the model hard. This limits the applicability of ASP to problems dealing with large knowledge bases. Goal-directed or query-driven execution strategies have been proposed that do not require grounding. The goal of this workshop is to foster discussion around challenges and opportunities that such approaches present.