Undecidability of Finite Model Reasoning in DLFD

TL;DR

This paper addresses the unresolved question of whether finite model reasoning for path functional dependencies is decidable, contributing to the theoretical understanding of database dependencies.

Contribution

It proves the undecidability of finite model reasoning in the context of path functional dependencies, resolving an open problem.

Findings

Finite model reasoning for PFDs is undecidable.

The result impacts database theory and dependency reasoning.

Provides a theoretical foundation for future research.

Abstract

We resolve an open problem concerning finite logical implication for path functional dependencies (PFDs).