Standard completeness for extensions of MTL: an automated approach. We provide general conditions on hypersequent calculi that guarantee standard completeness for the formalized logics. These conditions are implemented in the PROLOG system AxiomCalc that takes as input any suitable axiomatic extension of Monoidal T-norm Logic MTL and outputs a hypersequent calculus for the logic and the result of the check. Our approach subsumes many existing results and allows for the computerized discovery of new fuzzy logics.