All the complexity upper bounds for the instance-level problem carry over straightforwardly using the simple approach of substituting in each potential output a tuple from V and utilizing the prior algorithms on the resulting Boolean queries. The complexity for each substitution preserves the upper bounds since they hold in the presence of constants, and the iteration over tuples can be absorbed in the complexity classes given in our upper bounds: for **data** complexity the iteration is polynomial, while for combined complexity the number of tuples can be exponential, but our bounds are at least exponential. Further, GFP-Datalog definability for negative implications also extends straightforwardly to the non-Boolean case: Theorem 27 extends with the same statement and proof, while the argument in Theorem 28 is easily extended to show that there is a GFP-Datalog program that returns the complement of NQI(Q, C, S) within the active domain.