  The satisfiability and finite satisfiability problems for the two-variable
guarded fragment of first-order logic with counting quantifiers, a database,
and path-functional dependencies are both ExpTime-complete.
