0000000000276311

AUTHOR

Georgios Kourtis

showing 1 related works from this author

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

2017

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.

FOS: Computer and information sciencesComputer Science - Logic in Computer ScienceTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESintegrity constraintssatisfiabilitycounting quantifierspath-functional dependenciesComputer Science::Logic in Computer Scienceguarded fragmentkey constraintstwo-variable fragmetLogic in Computer Science (cs.LO)
researchProduct