ASP∀: Answer Set Programming “Algorithms” 🔗
ASP∀ is the genesis of our group and its mission. Dr. Guerin has studied logic and other declarative programming forms for decades, and the state of many modern languages includes more and more declarative ideas (e.g., monads, functional programming generalizations, etc.). As he has taught Answer Set Programming for many years (Programming Languages Paradigms, AI, etc.). Computationally difficult problems became a focus of many of his courses, which generated a repository of solutions to classical problems in computing, with a specific focus on NP-Complete and NP-Hard problems. We hope that the repository serves as a starting point regarding how to model problems in answer set languages and other SAT-style solvers.
With the help of undergraduate researchers the repository turned into something we believed would be usable by the educational and programming community, our inaugural publication on the project was presented at Florida AI Research Symposium (FLAIRS-39, 2026, Marco Island).
This project served as the genesis for ASP∀: The Answer Set Programming Research Group, a multi-disciplinary and multi-institution effort group dedicated to continued investigation of ASP (and other constraint satisfiability formalisms) and its applications to various classes of computationally difficult problems, with the original cohort starting in 2026.
ASP∀: The Answer Set Programming Research Group 