Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption.
ICALP(2017)
摘要
In this paper, we investigate the finite satisfiability and model checking problems for the logic D of the sub-interval relation under the homogeneity assumption, that constrains a proposition letter to hold over an interval if and only if it holds over all its points. First, we prove that the satisfiability problem for D, over finite linear orders, is PSPACE-complete; then, we show that its model checking problem, over finite Kripke structures, is PSPACE-complete as well.
更多查看译文
关键词
computer science - logic in computer science,computer science - formal languages and automata theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络