Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting

CoRR（2016）

引用 0|浏览45

暂无评分

摘要

The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.

查看译文

关键词

Satisfiability,two-variable fragments,guarded fragment,counting quantifiers,integrity constraints,key constraints,path-functional dependencies

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要