Undecidability of Finite Model Reasoning in DLFD
Abstract
We resolve an open problem concerning finite logical implication for path functional dependencies (PFDs).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.