具有并、合、差的有限二元关系代数中可满足性的不可判定性
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference
摘要:
我们考虑使用运算符union,composition和set difference从二元关系名称构建的表达式。我们证明了测试给定的这样的表达式$e$是否可满足是不可判定的,即,是否存在可以替换关系名称的有限二进制关系,以便$e$计算为非空结果。这一结果已经适用于只提到单个关系名称的表达式,以及差异运算符最多只能嵌套一次的表达式。
英文摘要:
We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there exist finite binary relations that can be substituted for the relation names so that $e$ evaluates to a nonempty result. This result already holds in restriction to expressions that mention just a single relation name, and where the difference operator can be nested at most once.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。