作者: Holger Sturm , Nobu-Yuki Suzuki , Frank Wolter , Michael Zakharyaschev
关键词:
摘要: We introduce a family of languages intended for representing knowledge and reasoning about metric (and more general distance) spaces. While the simplest language can speak only distances between individual objects Boolean relations sets, expressive ones are capable capturing notions such as 'somewhere in (or somewhere out of) sphere certain radius', 'everywhere ring', etc. The computational complexity satisfiability problem formulas our ranges from NP-completeness to undecidability depends on class distance spaces which they interpreted. Besides all spaces, we consider, example, R × N with their natural metrics.