It might be, though the grounding of concept operators in mathematical formalism might be essential for that. For instance, the boolean and linear algebra underpinnings of boolean and Semantica-like ops might enable proofs on related properties of the concept program as a whole, or at least upper-bounds on error to be matched against thresholds based on given standards of caution.