扩展对象间的基本方向推理:困难性结果
Reasoning about Cardinal Directions between Extended Objects: The Hardness Result
摘要:
Goyal和Egenhofer提出的基本方向演算(CDC)是一种非常有表现力的扩展对象方向信息的定性演算。早期的工作已经表明,基本CDC约束的完整网络的一致性检查是易处理的,而与CDC推理一般是NP难的。然而,本文表明,如果允许一些约束条件未指定,那么可能不完整的网络的基本CDC约束的一致性检查已经是棘手的。这在CDC的易处理子类和难处理子类之间划出了清晰的界限。其结果是从著名的3-SAT问题的减少。
英文摘要:
The cardinal direction calculus (CDC) proposed by Goyal and Egenhofer is a very expressive qualitative calculus for directional information of extended objects. Early work has shown that consistency checking of complete networks of basic CDC constraints is tractable while reasoning with the CDC in general is NP-hard. This paper shows, however, if allowing some constraints unspecified, then consistency checking of possibly incomplete networks of basic CDC constraints is already intractable. This draws a sharp boundary between the tractable and intractable subclasses of the CDC. The result is achieved by a reduction from the well-known 3-SAT problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。