Undecidability of Finite Model Reasoning in DLFD

2014/08/19 by David Toman, Toman, David, Grant Weddell +1
Computer Science · #Advanced Database Systems and Queries #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies #cs.DB #cs.LO

paper · pdf · doi:10.48550/arxiv.1408.4468

arxiv created 2014/08/19 · arxiv updated 2014/08/21

Abstract

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

Related

• Finite Model Property and Bisimulation for LFD
• Justification logic enjoys the strong finite model property
• Local Dependence and Guarding
• Model-theoretic Characterizations of Existential Rule Languages
• Embedded Finite Models Beyond Restricted Quantifier Collapse