Abstract
In relational reasoning, one is concerned with the algebras generated by a given set of relations, when one allows only basic relational operations such as the Boolean operations, relational composition, and converse. According to a result by A. Tarski, the relations obtained in this way are exactly the relations which are definable in the three-variable fragment of first order logic. Thus, a relation algebra is a first indicator of the expressive power of a given set of relations.
In this paper, we investigate relation algebras which arise in the context of preference relations. In particular, we study the tangent circle orders introduced in [1].
Co-operation for this work was supported by EU COST Action 274 “Theory and Applications of Relational Structures as Knowledge Instruments” (TARSKI), www.tarski.org
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abbas, M., Vincke, P.: Tangent circle orders: Numerical representation and properties. Working paper 94/06, SMG, Free University of Brussels (1994) pvincke@smg.ulb.ac.be.
Fishburn, P. C.: Intransitive indifference with unequal in difference intervals. J. Math. Psychology 7 (1970) 144–149
Fishburn, P. C.: Interval orders and interval graphs. John Wiley, New York (1985)
Bridges, D. S., Mehta, G. B.: Representation of preference orderings. In: Lecture Notes in Economics and Mathematical Systems. Volume 422. Springer-Verlag, Berlin (1995)
Fishburn, P. C.: Nontransitive preferences in decision theory. J. of Risk and Uncertainty 7 (1991) 113–134
Roberts, F.: Measurement Theory. Volume 7 of Encyclopaedia of Mathematics. Addison-Wesley, Reading, Mass. (1979)
Roubens, M., Vincke, P.: Preference Modelling. Volume 250 of Lecture Notes in Economics and Mathematical Sciences. Springer-Verlag, Berlin (1985)
Abbas, M., Pirlot, M., Vincke, P.: Tangent circle orders: a simple non transitive order structure. Manuscript, MATHRO, Faculté polytechnique de Mons (2001) Marc.Pirlot@fpms.ac.be.
Fodor, J., Roubens, M.: Parametrized preference structures and some geometrical interpretation. J. Multi-Crit. Decis. Anal. 6 (1997) 253–258
Andréka, H., Düntsch, I., Németi, I.: Binary relations and permutation groups. Mathematical Logic Quarterly 41 (1995) 197–216
Jónsson, B.: The theory of binary relations. In Andréka, H., Monk, J. D., Németi, I., eds.: Algebraic Logic. Volume 54 of Colloquia Mathematica Societatis János Bolyai. North Holland, Amsterdam (1991) 245–292
Scheinerman, E., Wierman, J.: On circle containment orders. Order 4 (1988) 315–318
Tarski, A., Givant, S.: A formalization of set theory without variables. Volume 41 of Colloquium Publications. Amer. Math. Soc., Providence (1987)
Jónsson, B.: Maximal algebras of binary relations. Contemporary Mathematics 33 (1984) 299–307
Düntsch, I., Wang, H., McCloskey, S.: A relation algebraic approach to the Region Connection Calculus. Theoretical Computer Science 255 (2001) 63–83
de Laguna, T.: Point, line and surface as sets of solids. The Journal of Philosophy 19 (1922) 449–461
Nicod, J.: Geometry in a sensible world. Doctoral thesis, Sorbonne, Paris (1924) English translation in Geometry and Induction, Routledge and Kegan Paul, 1969.
Düntsch, I., Wang, H., McCloskey, S.: Relation algebras in qualitative spatial reasoning. Fundamenta Informaticae (2000) 229–248
Allen, J. F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26 (1983) 832–843
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Düntsch, I., Roubens, M. (2002). Tangent Circle Algebras. In: de Swart, H.C.M. (eds) Relational Methods in Computer Science. RelMiCS 2001. Lecture Notes in Computer Science, vol 2561. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36280-0_21
Download citation
DOI: https://doi.org/10.1007/3-540-36280-0_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00315-1
Online ISBN: 978-3-540-36280-7
eBook Packages: Springer Book Archive