6533b7d6fe1ef96bd1265c39
RESEARCH PRODUCT
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting
Georgios KourtisIan Pratt-hartmannsubject
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)description
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2017-10-30 |