Finite-Choice Logic Programming

This video presentation from POPL 2025 introduces Finite-Choice Logic Programming, a novel approach to logic programming developed by researchers from Northeastern University. Explore how this formalism uses choice rather than negation to allow multiple solutions while maintaining the expressive power of stable model semantics. Learn about the limitations of traditional logic programming approaches like datalog when dealing with problems requiring multiple valid models that vary along different choices while maintaining constraints. Discover the least-fixed-point interpretation over a new domain that gives meaning to a broader class of programs. The presentation covers an algorithm for exploring the solution space and demonstrates the Dusa logic programming language implementation, which shows favorable performance compared to state-of-the-art answer set solvers with more predictable scaling. Access supplementary materials including the full article, code artifacts (rated as Available and Reusable), and additional documentation at the provided links.