Solving Combinatorial Counting Problems with Weighted First-Order Model Counting
Researchers have introduced Cofola, a new declarative language designed to simplify the solving of combinatorial counting problems. Cofola uses a typed language with primitives for common combinatorial objects like sets, bags, and partitions, alongside relational and arithmetic constraints. The system compiles these specifications into a weighted first-order model counting instance, employing techniques to preserve symmetry and improve tractability for complex problems. AI
IMPACT Introduces a novel language and methodology for tackling complex combinatorial problems, potentially improving AI's ability to handle enumeration and constraint satisfaction tasks.