Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting
Logic in Computer Science
2023-06-22 v3
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.
Cite
@article{arxiv.1611.08738,
title = {Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting},
author = {Georgios Kourtis and Ian Pratt-Hartmann},
journal= {arXiv preprint arXiv:1611.08738},
year = {2023}
}