Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Logics of metric spaces
Kutz O., Wolter F., Sturm H., Suzuki N., Zakharyaschev M. ACM Transactions on Computational Logic4 (2):260-294,2003.Type:Article
Date Reviewed: Oct 13 2003

First-order logics, as well as propositional modal-like logics, that are interpreted in metric (and other distance) spaces are introduced in this paper. It investigates both their expressive power and their computational properties, including decidability and complexity of reasoning. Such logics can be used to represent and reason about spatial knowledge, which has many potential applications (for example, in geographic information systems). Another interesting application of these logics comes from the fact that distance need not be interpreted as spatial distance; it can also be viewed as a measure of the similarity of objects. Using this interpretation, these logics have potential applications in bioinformatics and in case-based reasoning.

The main technical contributions of this paper are threefold. First, a natural logic of metric spaces, MS, that is similar in flavor to modal or description logics, is introduced. Typical (modal) operators of this logic can express things like “somewhere in the circle of radius x, there is an object of a certain type,” which can, for example, describe houses that are within a certain distance of the next shop.

Second, it is proved that MS has the same expressive power as the two-variable fragment of the natural first-order logic of metric spaces. Third, it is shown that MS (and, therefore, the corresponding two-variable fragment of first-order logic) is undecidable over any class of metric spaces that contains the Euclidean plane. This is in contrast to the fact that the usual two-variable fragment of first-order logic is decidable. However, it is also shown that a number of expressive fragments of MS are indeed decidable, and enjoy the finite model property. Some complexity results (in the vicinity of nondeterministic exponential time) are also established.

To sum up, this paper provides the first in-depth analysis of the computational properties of logics intended for reasoning about distances and similarities. As such, it should be of interest to logicians, as well as to researchers in knowledge representation, case-based reasoning, geographic information systems, bioinformatics, and other areas where reasoning about distances and similarities is relevant.

Reviewer:  F. Baader Review #: CR128368 (0402-0208)
Bookmark and Share
 
Modal Logic (F.4.1 ... )
 
 
Computational Logic (F.4.1 ... )
 
 
Modal Logic (I.2.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Modal Logic": Date
A class of decidable information logics
Demri S. Theoretical Computer Science 195(1): 33-60, 1998. Type: Article
Jul 1 1998
First-order modal logic
Fitting M., Mendelsohn R., Kluwer Academic Publishers, Norwell, MA, 1999. Type: Book (9780792353348)
Mar 1 2000
Modal logic
Blackburn P. (ed), de Rijke M. (ed), Venema Y. (ed), Cambridge University Press, New York, NY, 2001.  554, Type: Book (9780521802000), Reviews: (1 of 2)
May 31 2002
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy