Use this URL to cite or link to this record in EThOS:
Title: Path-functional dependencies and the two-variable guarded fragment with counting
Author: Kourtis, Georgios
ISNI:       0000 0004 6498 5232
Awarding Body: University of Manchester
Current Institution: University of Manchester
Date of Award: 2017
Availability of Full Text:
Access from EThOS:
Access from Institution:
We examine how logical reasoning in the two-variable guarded fragment with counting quantifiers can be integrated with databases in the presence of certain integrity constraints, called path-functional dependencies. In more detail, we establish that the problems of satisfiability and finite satisfiability for the two-variable guarded fragment with counting quantifiers, a database, and binary path-functional dependencies are EXPTIME-complete; we also establish that the data complexity of these problems is NP-complete. We establish that query answering for the above fragment (with a database and binary path-functional dependencies) is 2-EXPTIME-complete with respect to arbitrary models, and provide a 2-EXPTIME upper bound for finite models. Finally, we establish that the data complexity of query answering is coNP-complete, both with respect to arbitrary and finite models.
Supervisor: Pratt-Hartmann, Ian ; Schmidt, Renate Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: constraint ; key ; path-functional ; dependency ; integrity ; counting ; guarded ; two-variable ; fragment ; complexity ; database ; logic ; first-order