arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.09140cs.AI
收藏

定性演算和网络的代数基础

Algebraic foundations for qualitative calculi and networks

Robin Hirsch, Marcel Jackson, Tomasz Kowalski

摘要:

定性表示$ϕ$类似于关系代数的普通表示,但不像我们对普通表示那样需要$(a; b)^ϕ= a^ϕ| b^ϕ$,我们只需要$c^ϕ\supseteq a^ϕ| b^ϕ\iff c\geq a ; b$,对于代数中的每个$c$。一个约束网络是定性可满足的,如果它的节点可以映射到一个定性表示的元素,保持约束。如果一个约束网络是可满足的,那么它显然是定性可满足的,但反过来可能失败。然而,对于广泛的关系代数,包括点代数,Allen区间代数,RCC 8和许多其他关系代数,网络是可满足的当且仅当它是定性可满足的。与普通的组合不同,从定性表示产生的弱组合不需要是结合的,所以我们可以通过考虑非结合代数上的网络满意度问题来推广。我们证明了在计算上,定性表示比普通表示具有许多优点:虽然许多有限关系代数只有无限表示,但每个有限定性可表示代数都有有限定性表示;有限非结合代数的原子结构是NP-完全的,有限定性可表示代数上的网络满足问题总是NP的;方程在定性表示上的有效性是co-NP-完全的。另一方面,我们证明了定性表示代数类不存在有限公理化。

英文摘要:

A qualitative representation $ϕ$ is like an ordinary representation of a relation algebra, but instead of requiring $(a; b)^ϕ= a^ϕ| b^ϕ$, as we do for ordinary representations, we only require that $c^ϕ\supseteq a^ϕ| b^ϕ\iff c\geq a ; b$, for each $c$ in the algebra. A constraint network is qualitatively satisfiable if its nodes can be mapped to elements of a qualitative representation, preserving the constraints. If a constraint network is satisfiable then it is clearly qualitatively satisfiable, but the converse can fail. However, for a wide range of relation algebras including the point algebra, the Allen Interval Algebra, RCC8 and many others, a network is satisfiable if and only if it is qualitatively satisfiable. Unlike ordinary composition, the weak composition arising from qualitative representations need not be associative, so we can generalise by considering network satisfaction problems over non-associative algebras. We prove that computationally, qualitative representations have many advantages over ordinary representations: whereas many finite relation algebras have only infinite representations, every finite qualitatively representable algebra has a finite qualitative representation; the representability problem for (the atom structures of) finite non-associative algebras is NP-complete; the network satisfaction problem over a finite qualitatively representable algebra is always in NP; the validity of equations over qualitative representations is co-NP-complete. On the other hand we prove that there is no finite axiomatisation of the class of qualitatively representable algebras.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑