On the Complexity of Fragments of the Modal Logic of Allen's Relations over Dense Structures.

LATA(2015)

引用 10|浏览35
暂无评分
关键词
expressiveness,satisfiability,decidability,computational complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要