Monadic decomposability is a notion of variable independence ,
Recently , Veanes et al . showed the usefulness of monadic decomposability in the context of SMT
Monadic decomposability is a notion of variable independence , which asks whether a given formula in a first - order theory is expressible as a Boolean combination of monadic predicates in the theory .
Recently , Veanes et al . showed the usefulness of monadic decomposability in the context of SMT ( i.e. the input formula is quantifier - free ) , and found various interesting applications including string analysis .