Modal logics for knowledge representation systems
Theoretical Computer Science
Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
Complexity and real computation
Complexity and real computation
Theoretical Computer Science
Expressive completeness of duration calculus
Information and Computation - Special issue on EXPRESS 1997
It's About Time: Real-Time Logics Reviewed
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
First-Order Logic with Two Variables and Unary Temporal
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
ε-connections of abstract description systems
Artificial Intelligence
Linear and affine logics with temporal, spatial and epistemic operators
Theoretical Computer Science
Counterparts in Language and SpaceSimilarity and S-Connection
Proceedings of the 2008 conference on Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS 2008)
Combining spatial and temporal logics: expressiveness vs. complexity
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Integrated behavior models for factory automation systems
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Comparative similarity, tree automata, and diophantine equations
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Logics for approximate and strong entailments
Fuzzy Sets and Systems
Hi-index | 0.00 |
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.