Bridging Two Communities to Solve Real Problems
Christopher W. Brown · 2016
This paper describes a sort of case study of how ideas from computational logic (specifically, satisfiability modulo theory solving) provide new algorithms in symbolic computing. In particular, it describes how ideas from the NLSAT solver led to a new kind of Cylindrical Algebraic Decomposition.