An SMT instance is a generalization of a Boolean SAT instance in which various sets of variables are replaced by predicates from a variety of underlying theories.
By comparison, answer set programming is also based on predicates (more precisely, on atomic sentences created from atomic formula).