It depends upon the computational assumptions, schnorr's proof of exponent achieves perfect zero knowledge, where as it achieves computational soundness as discrete log is a computationally bounded assumption.
And depends upon the definition of the adversary (i.e computationally bounded or unbounded) the proof system is either called proof or argument system.