2000 character limit reached
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting (1611.08738v3)
Published 26 Nov 2016 in cs.LO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.