  We give an overview of recent techniques for implementing syntax-guided
synthesis (SyGuS) algorithms in the core of Satisfiability Modulo Theories
(SMT) solvers. We define several classes of synthesis conjectures and
corresponding techniques that can be used when dealing with each class of
conjecture.
