Given a qualitative constraint network ($\mathsf{QCN}$), a singleton-style consistency focuses on each base relation (atom) of a constraint separately, rather than the entire constraint altogether. This local consistency is essential for tackling fundamental reasoning problems associated with $\mathsf{QCN}$s, such as minimal labeling, but can suffer from redundant constraint checks, especially when checks occur far from where the pruning usually takes place. In this paper, we propose singleton-style consistencies that are applied just on the neighbourhood of a singleton-checked constraint instead of the whole network. We make a theoretical comparison with existing consistencies and consequently prove some properties of the new ones. Further, we propose algorithms to enforce our consistencies, as well as parsimonious variants thereof, that are more efficient in practice than the state of the art. An experimental evaluation with random and structured $\mathsf{QCN}$s of Allen's Interval Algebra in the phase transition region demonstrates the potential of our approach.

给定一个定性约束网络（$\mathsf{质量控制中心}$)，单例风格的一致性分别关注约束的每个基本关系（原子），而不是整个约束。这种局部一致性对于解决与$\mathsf{质量控制中心}$s，例如最小标记，但可能会受到冗余约束检查的影响，特别是当检查发生在远离修剪通常发生的地方时。在本文中，我们提出了单例风格的一致性，它仅应用于单例检查约束的邻域而不是整个网络。我们与现有一致性进行了理论比较，从而证明了新一致性的一些特性。此外，我们提出算法来加强我们的一致性，以及其简约的变体，在实践中比现有技术更有效。随机和结构化的实验评估$\mathsf{质量控制中心}$相变区域中艾伦区间代数的 s 证明了我们方法的潜力。