一句话：为带数据约束的混合 XPath 建立可靠且强完全的公理化系统，并研究树模型公理化与可判定性。
论文研究带数据约束并扩展混合算子的 XPath 逻辑。作者首先定义 HXPath=：一种带数据的多模态 XPath 版本，加入 nominal 与混合算子 @。随后给出公理系统，并证明其相对于抽象数据模型（数据值被抽象为等价关系）是可靠且强完全的。作者还证明一个一般完全性结果，说明该系统的若干扩展在广泛帧类上仍保持完全，并给出具体实例。针对实践中常用的树模型，论文证明不存在强完全、有穷的一阶混合 XPath 公理化，并提出两种替代方案。最后引入过滤法来考察这些语言可满足性问题的可判定性。
In this paper we introduce sound and strongly complete axiomatizations for XPath with data constraints extended with hybrid operators. First, we present HXPath=, a multi-modal version of XPath with data, extended with nominals and the hybrid operator @. Then, we introduce an axiomatic system for HXPath=, and we prove it is strongly complete with respect to the class of abstract data models, i.e., data models in which data values are abstracted as equivalence relations. We prove a general completeness result similar to the one presented in, e.g., [BtC06], that ensures that certain extensions of the axiomatic system we introduce are also complete. The axiomatic systems that can be obtained in this way cover a large family of hybrid XPath languages over different classes of frames, for which we present concrete examples. In addition, we investigate axiomatizations over the class of tree models, structures widely used in practice. We show that a strongly complete, finitary, first-order axiomatization of hybrid XPath over trees does not exist, and we propose two alternatives to deal with this issue. We finally introduce filtrations to investigate the status of decidability of the satisfiability problem for these languages.