Exotic semiring constraints arise in a variety of applications and in particular in the context of automated termination analysis. We propose two techniques to solve such constraints: (a) to model them using Boolean functions and integer linear arithmetic and solve them using an SMT solver (QF LIA, in certain cases also QF IDL); and (b) to seek finite domain solutions by applying unary bit-blas...