Given a p-order A over a universe of strings (i.e., a transitive, reflexive, antisymmetric relation such that if (x, y) is an element of A then |x| is polynomially bounded by |y| ), an interval size function of A returns, for each string x in the universe, the number of strings in the interval between strings b(x) and t(x) (with respect to A), where b(x) and t(x) are functions that are polynomial-time computable in the length of x. By choosing sets of interval size functions based on feasibility requirements for their underlying p-orders, we obtain new characterizations of complexity classes. We prove that the set of all interval size functions whose underlying p-orders are polynomial-time decidable is exactly #P. We show that the interval size functions for orders with polynomial-time adjacency checks are closely related to the class FPSPACE(poly). Indeed, FPSPACE(poly) is exactly the class of all nonnegative functions that are an interval size function minus a polynomial-time computable function. We study two important functions in relation to interval size functions. The function #DIV maps each natural number n to the number of nontrivial divisors of n. We show that #DIV is an interval size function of a polynomial-time decidable partial p-order with polynomial-time adjacency checks. The function #MONSAT maps each monotone boolean formula F to the number of satisfying assignments of F. We show that #MONSAT is an interval size function of a polynomial-time decidable total p-order with polynomial-time adjacency checks. Finally, we explore the related notion of cluster computation.
英文摘要:
Given a p-order A over a universe of strings (i.e., a transitive, reflexive, antisymmetric relation such that if (x, y) is an element of A then |x| is polynomially bounded by |y|), an interval size function of A returns, for each string x in the universe, the number of strings in the interval between strings b(x) and t(x) (with respect to A), where b(x) and t(x) are functions that are polynomial-time computable in the length of x.
By choosing sets of interval size functions based on feasibility requirements for their underlying p-orders, we obtain new characterizations of complexity classes. We prove that the set of all interval size functions whose underlying p-orders are polynomial-time decidable is exactly #P. We show that the interval size functions for orders with polynomial-time adjacency checks are closely related to the class FPSPACE(poly). Indeed, FPSPACE(poly) is exactly the class of all nonnegative functions that are an interval size function minus a polynomial-time computable function.
We study two important functions in relation to interval size functions. The function #DIV maps each natural number n to the number of nontrivial divisors of n. We show that #DIV is an interval size function of a polynomial-time decidable partial p-order with polynomial-time adjacency checks. The function #MONSAT maps each monotone boolean formula F to the number of satisfying assignments of F. We show that #MONSAT is an interval size function of a polynomial-time decidable total p-order with polynomial-time adjacency checks.
Finally, we explore the related notion of cluster computation.
On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions
本文研究了Halpern和Shoham的区间时序逻辑HS的模型检验问题。在过去的几年里,间隔时态逻辑MC作为传统(基于点)时态逻辑MC的可行替代方案越来越受到关注,传统时态逻辑MC可以被恢复为特殊情况。大多数结果都是在同质性假设下得到的,即约束一个命题字母在一个区间上成立当且仅当它在每个分量状态上成立。最近,Lomuscio和Michaliszyn提出了一种放松这种假设的方法,利用正则表达式来定义命题字母在其组成状态方面的行为。当同质性假设,MC的确切复杂性是一个困难的公开问题,充分HS和它的两个句法最大片段AA'BB' E '和AA' EB 'E'。在本文中,我们提供了一个渐近最优的约束下,这两个片段的复杂性更有表现力的语义变体的基础上,正则表达式的MC问题是AEXP_pol-完成,其中AEXP_pol表示的复杂性类的问题,由指数时间有界的交替图灵机,使一个多项式有界的交替。
On the Complexity of Vertex-Splitting Into an Interval Graph
Lebanese American University(黎巴嫩美国大学);Centrale Méditerranée, LIS, Aix-Marseille Université(地中海中央理工学院,信息系统实验室,艾克斯-马赛大学);Université de Strasbourg(斯特拉斯堡大学);Umeå University(于默奥大学)