We propose a class of functional dependencies for temporal graphs, called TGFDs. TGFDs capture both attribute-value dependencies and topological structures of entities over a valid period of time in a temporal graph. It subsumes graph functional dependencies (\gfds) and conditional functional dependencies (CFDs) as a special case. We study the foundations of TGFDs including satisfiability, implication and validation. We show that the satisfiability and validation problems are coNP-complete and the implication problem is NP-complete. We also present an axiomatization of TGFDs and provide the proof of the soundness and completeness of the axiomatization.

中文翻译：

---

时序图函数依赖——技术报告

我们提出了一类时间图的函数依赖关系，称为 TGFD。TGFD 在时间图中的有效时间段内捕获实体的属性值依赖关系和拓扑结构。它将图函数依赖关系 (\gfds) 和条件函数依赖关系 (CFDs) 作为一种特殊情况。我们研究 TGFD 的基础，包括可满足性、含义和验证。我们表明可满足性和验证问题是 coNP 完全的，蕴涵问题是 NP 完全的。我们还提出了 TGFD 的公理化，并提供了公理化的合理性和完整性的证明。