We consider the extension of two-variable guarded fragment logic with local
Presburger quantifiers. These are quantifiers that can express properties such
as ``the number of incoming blue edges plus twice the number of outgoing red
edges is at most three times the number of incoming green edges'' and captures
various description logics with counting, but without constant symbols. We show
that the satisfiability of this logic is EXP-complete. While the lower bound
already holds for the standard two-variable guarded fragment logic, the upper
bound is established by a novel, yet simple deterministic graph theoretic based
algorithm