Oliver Kutz
Abstract
We investigate the expressive power and computational properties of two different types of languages intended for speaking about distances. First, we consider a first-order language FM the two-variable fragment of which turns out to be undecidable in the class of distance spaces validating the triangular inequality as well as in the class of all metric spaces. Yet, this two-variable fragment is decidable in various weaker classes of distance spaces. Second, we introduce a variable-free modal language MS that, when interpreted in metric spaces, has the same expressive power as the two-variable fragment of FM. We determine natural and expressive fragments of MS which are decidable in various classes of distance spaces validating the triangular inequality, in particular, the class of all metric spaces.
- Alur, R. and Henzinger, T. A. 1992. Logics and models of real time: a survey. In Real Time: Theory and Practice, de Bakker et al., Ed. Springer-Verlag, New York, 74--106.]] Google Scholar
Digital Library
- Blackburn, P. 1993. Nominal tense logic. Notre Dame J. Formal Logic 34, 56--83.]]Google ScholarCross Ref
- Blum, L., Cucker, F., Shub, M., and Smale, S. 1998. Complexity and Real Computation. Springer-Verlag, New York.]] Google ScholarDigital Library
- Börger, E., Grädel, E., and Gurevich, Y. 1997. The Classical Decision Problem. In Perspectives in Mathematical Logic. Springer-Verlag, New York.]]Google Scholar
- Chagrov, A. and Zakharyaschev, M. 1997. Modal Logic. Oxford University Press, Oxford.]]Google Scholar
- de Rijke, M. 1990. The modal logic of inequality. J. Symb. Logic 57, 566--584.]]Google ScholarCross Ref
- Etessami, K., Vardi, M., and Wilke, T. 1997. First-order logic with two variables and unary temporal logic. In Proceedings of 12th IEEE Symposium Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 228--235.]] Google ScholarDigital Library
- Fürer, M. 1984. The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). In Logic and Machines: Decision Problems and Complexity. Springer-Verlag, New York, 312--319.]] Google ScholarDigital Library
- Gabbay, D. 1971. Expressive functional completeness in tense logic. In Aspects of Philosophical Logic, U. Mönnich, Ed. Reidel, 91--117.]]Google Scholar
- Gabbay, D., Hodkinson, I., and Reynolds, M. 1994. Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 1. Oxford University Press, Oxford, England.]] Google ScholarCross Ref
- Gargov, G., Passy, S., and Tinchev, T. 1988. Modal environment for Boolean speculations. In Mathematical Logic, D. Scordev, Ed. Plenum Press, New York.]]Google Scholar
- Goranko, V. 1990. Completeness and incompleteness in the bimodal base (R,−R). In Mathematical Logic, P. Petkov, Ed. Plenum Press, New York, 311--326.]]Google Scholar
- Goranko, V. and Passy, S. 1992. Using the universal modality. J. Logic Comput. 2, 203--233.]]Google ScholarCross Ref
- Grädel, E., Kolaitis, P., and Vardi, M. 1997. On the decision problem for two-variable first-order logic. Bull. Symb. Logic 3, 53--69.]]Google ScholarCross Ref
- Grädel, E. and Otto, M. 1999. On Logics with two variables. Theoret. Comput. Sci. 224, 73--113.]] Google ScholarDigital Library
- Harel, D. 1984. Dynamic logic. In Handbook of Philosophical Logic, D. Gabbay and F. Guenthner, Eds. Reidel, Dordrecht, 605--714.]]Google Scholar
- Henzinger, T. A. 1998. It's about time: Real-time logics reviewed. In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR 1998). Lecture Notes in Computer Science. Springer-Verlag, New York, 439--454.]] Google ScholarDigital Library
- Hirshfeld, Y. and Rabinovich, A. M. 1999. Quantitative temporal logic. In Computer Science Logic, CSL'99, J. Flum and M. Rodrigues-Artalejo, Eds. Springer-Verlag, New York, 172--187.]] Google ScholarDigital Library
- Jansana, R. 1994. Some logics related to von Wright's logic of place. Notre Dame J. Formal Logic 35, 88--98.]]Google ScholarCross Ref
- Kamp, H. 1968. Tense Logic and the Theory of Linear Order. Ph.D. dissertation. Univ. California, Los Angeles, Calif.]]Google Scholar
- Kutz, O., Wolter, F., and Zakharyaschev, M. 2002. Connecting abstract description systems. In Proceedings of KR 2002 (Toulouse, France). Morgan-Kaufmann, Reading, Mass.]]Google Scholar
- Lemon, O. and Pratt, I. 1998. On the incompleteness of modal logics of space: Advancing complete modal logics of place. In Advances in Modal Logic, M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, Eds. CSLI, 115--132.]]Google Scholar
- Lutz, C., Sattler, U., and Wolter, F. 2001. Modal logic and the two-variable fragment. In Proceedings of CSL'2001. Lecture Notes in Computer Science. Springer-Verlag, New York.]] Google ScholarDigital Library
- Montanari, A. 1996. Metric and layered temporal logic for time granularity. Ph.D. dissertation. Amsterdam.]]Google Scholar
- Mortimer, M. 1975. On languages with two variables. Z. Math. Logik Grund. der Math. 21, 135--140.]]Google ScholarCross Ref
- Rabin, M. O. 1965. A simple method for undecidability proofs and some applications. In Logic and Methodology of Sciences, Y. Bar-Hillel, Ed. North-Holland, Amsterdam, The Netherlands, 58--68.]]Google Scholar
- Rabinovich, A. M. 2000. Expressive completeness of duration calculus. Inf. Comput. 156, 320--344.]] Google ScholarDigital Library
- Rescher, N. and Garson, J. 1968. Topological logic. J. Symb. Logic 33, 537--548.]]Google ScholarCross Ref
- Scott, D. 1962. A decision method for validity of sentences in two variables. J. Symb. Logic 27, 477.]]Google Scholar
- Segerberg, K. 1980. A note on the logic of elsewhere. Theoria 46, 183--187.]]Google ScholarCross Ref
- Sturm, H., Suzuki, N.-Y., Wolter, F., and Zakharyaschev, M. 2000. Semi-qualitative reasoning about distances: a preliminary report. In Logics in Artificial Intelligence. Proceedings of JELIA 2000 (Malaga, Spain). Springer-Verlag, Berlin, Germany, 37--56.]] Google ScholarDigital Library
- Suzuki, N.-Y. 1997. Kripke frames with graded accessibility and fuzzy possible world semantics. Studia Logica 59, 249--269.]]Google ScholarCross Ref
- Tarski, A. 1951. A Decision Method for Elementary Algebra and Geometry. University of California Press.]]Google Scholar
- Vakarelov, D. 1991. Modal logics for knowledge representation. Theoret. Comput. Sci. 90, 433--456.]] Google ScholarDigital Library
- van Emde Boas, P. 1997. The convenience of tilings. In Complexity, Logic and Recursion Theory, A. Sorbi, Ed. Lecture Notes in Pure and Applied Mathematics, vol. 187. Marcel Dekker Inc., 331--363.]]Google Scholar
- von Wright, G. 1979. A modal logic of place. In The Philosophy of Nicholas Rescher, E. Sosa, Ed. D. Reidel, Dordrecht, 65--73.]]Google Scholar
Index Terms
- Logics of metric spaces
Recommendations
Gödel logics with monotone operators
We consider the extension of Gödel logic by a unary operator interpreted by functions on the unit interval with certain monotonicity properties. We prove that validity of propositional formulas is decidable by giving a sound and complete proof system ...
Metric propositional neighborhood logics on natural numbers
Interval logics formalize temporal reasoning on interval structures over linearly (or partially) ordered domains, where time intervals are the primitive ontological entities and truth of formulae is defined relative to time intervals, rather than time ...
Undecidability of the unification and admissibility problems for modal and description logics
We show that the unification problem “is there a substitution instance of a given formula that is provable in a given logic?” is undecidable for basic modal logics K and K4 extended with the universal modality. It follows that the admissibility problem ...
Reviews
Franz Baader
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. Online Computing Reviews Service
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments