We then indicate how the satisfiability of this enriched input could be controlled.
in the realisation algorithm sketched in Section 3, non-determinism stems from lexical ambiguity: 3 for each (combination of) literal(s) l in the input there usually is more than one TAG elementary tree whose semantics subsumes l. each (combination of) literal(s) in the input selects a set of elementary trees and the realiser output is the set of combinations of selected lexical trees which are licensed by the grammar operations (substitution and adjunction) and whose semantics is the input.