Reasoning about cyclic space: Axiomatic and computational aspects

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we propose models of the axioms for linear and cyclic Orders. First, we describe explicitly the relations between linear and cyclic models, from a logical point of view. The second part of the paper is concerned with qualitative constraints: we study the cyclic point algebra. This formalism is based on ternary relations which allow to express cyclic orientations. We give some results of complexity about the consistency problem in this formalism. The last part of the paper is devoted to conceptual spaces. The notion of a conceptual space is related to the complexity properties of temporal and spatial qualitative formalisms, including the cyclic point algebra.

Cite

CITATION STYLE

APA

Balbiani, P., Condotta, J. F., & Ligozat, G. (2003). Reasoning about cyclic space: Axiomatic and computational aspects. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2685, pp. 348–371). Springer Verlag. https://doi.org/10.1007/3-540-45004-1_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free