关于SPARQL模式的可满足性问题
On the satisfiability problem for SPARQL patterns
摘要:
SPARQL模式的可满足性问题通常是不可判定的,因为SPARQL 1.0的表达能力与关系代数相当。本文的目的是划定边界的可判定性的可满足性的过滤条件中允许的约束。考虑的约束类是有界约束,否定的有界约束,等式,不等式,常数等式,常数不等式。本文的主要结果可以概括为,只要不一致的过滤条件可以形成,可满足性是不可判定的。在每种情况下,关键的洞察力是找到一种方法来模拟集差运算。不可判定性可以从已知的二元关系的代数的不可判定性结果中得到,其中二元关系包括并、合和集差。当没有不一致的过滤条件可以形成,可满足性是有效地判定通过简单的检查约束变量和文字的使用。本文还指出,所谓的“精心设计的”模式的可满足性可以通过检查约束变量和检查不一致的过滤条件来决定。
英文摘要:
The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of this paper is to delineate the boundary of decidability of satisfiability in terms of the constraints allowed in filter conditions. The classes of constraints considered are bound-constraints, negated bound-constraints, equalities, nonequalities, constant-equalities, and constant-nonequalities. The main result of the paper can be summarized by saying that, as soon as inconsistent filter conditions can be formed, satisfiability is undecidable. The key insight in each case is to find a way to emulate the set difference operation. Undecidability can then be obtained from a known undecidability result for the algebra of binary relations with union, composition, and set difference. When no inconsistent filter conditions can be formed, satisfiability is efficiently decidable by simple checks on bound variables and on the use of literals. The paper also points out that satisfiability for the so-called `well-designed' patterns can be decided by a check on bound variables and a check for inconsistent filter conditions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。