The "argmax problem" in structured prediction is not tractable in the general case.
specially, using a pruning algorithm, we collect a set of argument candidates; then we classify dependency relations between argument candidates and the predicates and predict whether a candidate is an argument.