Reproduce “Finite-Choice Logic Programming” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Chris Martens, Robert J. Simmons, Michael Arntzenius
Finite-Choice Logic Programming (FCLP) introduces a new declarative paradigm for problems involving both choices and deductions, offering a direct least-fixed-point semantics over novel "choice sets" and an operational model that avoids the grounding bottleneck common in Answer Set Programming (ASP). Its implementation, Dusa, demonstrates more predictable scaling and performance than state-of-the-art ASP solvers for certain generative problems while maintaining ASP's expressive power.
Key insights
- The core innovation is the use of "choice sets" as the domain for a lifted immediate consequence operator (`T_P`), enabling a unique least-fixed-point definition for the meaning of multi-model logic programs.
- FCLP formally subsumes both Datalog and Answer Set Programming (ASP), demonstrating equivalent expressive power through direct translations, thereby offering an alternative without ASP's grounding bottleneck.
- The
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.