Search Results for author:
Found 2 papers, 1 papers with code
Synthesising Recursive Functions for First-Order Model Counting: Challenges, Progress, and Conjectures
First-order model counting (FOMC) is a computational problem that asks to count the models of a sentence in finite-domain first-order logic.
Generating Random Logic Programs Using Constraint Programming
Existing methods to generate random logic programs are limited to propositional programs and often impose stringent syntactic restrictions.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
