Synthesising Programs with Non-trivial Constants

Journal article

Motivated by the recent 10 million dollar AIMO challenge, this paper targets the problem of finding all functions conforming to a given specification. This is a popular problem at mathematical competitions and it brings about a number of challenges, primarily, synthesizing the possible solutions and proving that no other solutions exist. Often, there are infinitely many solutions and then the set of solutions has to be captured symbolically. We propose an approach to solving this problem and evaluate it on a set of problems that appeared in mathematical competitions and olympics

Authors: Abate, A; Barbosa, H; Barrett, C; David, C; Kesseli, P

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Springer
• Journal: Journal of Automated Reasoning
• Volume: 67
• Issue: 2
• Pages: 19-19
• Article number: 19
• Publication date: 2023-05-13
• DOI: 10.1007/s10817-023-09664-4
• EISSN: 1573-0670
• ISSN: 0168-7433
• Language: English
• Keywords: Satisfiability; Theoretical computer science; Constant (computer programming); Computer science; Satisfiability modulo theories; Mathematics; Counterexample; Space (punctuation); Solver; Programming language; Discrete mathematics; Set (abstract data type)