We describe a method of implementing support for Hilbert’s ε-terms within solvers for satisfiability modulo theories (SMT), giving users access to a new logical choice primitive.

Byron Cook is Professor of Computer Science at University College London (UCL) and Director of Automated Reasoning at Amazon Web Services. Byron’s interests include computer/network security, program analysis/verification, programming languages, theorem proving, logic, hardware design, operating systems, and biological systems. Byron is the founder and leader of Amazon’s Automated Reasoning Group (ARG).