To clarify because it was non-obvious to me, this is program synthesis from mathematical formulae.
I'm curious what problems this solves, and in which domains this would be most useful. In the places where I see a lot of formula (computer graphics and ML papers), it doesn't seem like the authors have a hard time implementing the algorithm from the math—in fact, the algorithm may have come first in some cases.
- Theorem proving: Being able to prove or disprove a mathematical statement based on axioms and other proven theorems. Eg: In formal software verification, building a program verifier based on the program's specification and source code or implementation.
- Prolog Inference engine: Making inferences about logical statements based on other logical statements. Eg: deciding whether a user must be permitted or denied access to a resource based on various role assignments / group memberships. Another example would be the application of firewall rules.
I'm curious what problems this solves, and in which domains this would be most useful. In the places where I see a lot of formula (computer graphics and ML papers), it doesn't seem like the authors have a hard time implementing the algorithm from the math—in fact, the algorithm may have come first in some cases.