Undecidability of Finite Model Reasoning in DLFD
Databases
2014-08-21 v1 Logic in Computer Science
Abstract
We resolve an open problem concerning finite logical implication for path functional dependencies (PFDs).
Keywords
Cite
@article{arxiv.1408.4468,
title = {Undecidability of Finite Model Reasoning in DLFD},
author = {David Toman and Grant Weddell},
journal= {arXiv preprint arXiv:1408.4468},
year = {2014}
}