Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting

Abstract

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.

Keywords

• computer science - logic in computer science