Synthesising Recursive Functions for First-Order Model Counting: Challenges, Progress, and Conjectures
Abstract: First-order model counting (FOMC) is a computational problem that asks to count the models of a sentence in finite-domain first-order logic. In this paper, we argue that the capabilities of FOMC al...
Loading