Skip to main content

Tangent Circle Algebras

  • Conference paper
  • First Online:
Book cover Relational Methods in Computer Science (RelMiCS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2561))

Included in the following conference series:

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. Fishburn, P. C.: Intransitive indifference with unequal in difference intervals. J. Math. Psychology 7 (1970) 144–149

    Article  MATH  MathSciNet  Google Scholar 

  3. Fishburn, P. C.: Interval orders and interval graphs. John Wiley, New York (1985)

    MATH  Google Scholar 

  4. Bridges, D. S., Mehta, G. B.: Representation of preference orderings. In: Lecture Notes in Economics and Mathematical Systems. Volume 422. Springer-Verlag, Berlin (1995)

    Google Scholar 

  5. Fishburn, P. C.: Nontransitive preferences in decision theory. J. of Risk and Uncertainty 7 (1991) 113–134

    Article  Google Scholar 

  6. Roberts, F.: Measurement Theory. Volume 7 of Encyclopaedia of Mathematics. Addison-Wesley, Reading, Mass. (1979)

    Google Scholar 

  7. Roubens, M., Vincke, P.: Preference Modelling. Volume 250 of Lecture Notes in Economics and Mathematical Sciences. Springer-Verlag, Berlin (1985)

    MATH  Google Scholar 

  8. 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.

    Google Scholar 

  9. Fodor, J., Roubens, M.: Parametrized preference structures and some geometrical interpretation. J. Multi-Crit. Decis. Anal. 6 (1997) 253–258

    Article  MATH  Google Scholar 

  10. Andréka, H., Düntsch, I., Németi, I.: Binary relations and permutation groups. Mathematical Logic Quarterly 41 (1995) 197–216

    Article  MATH  MathSciNet  Google Scholar 

  11. 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

    Google Scholar 

  12. Scheinerman, E., Wierman, J.: On circle containment orders. Order 4 (1988) 315–318

    Article  MATH  MathSciNet  Google Scholar 

  13. Tarski, A., Givant, S.: A formalization of set theory without variables. Volume 41 of Colloquium Publications. Amer. Math. Soc., Providence (1987)

    Google Scholar 

  14. Jónsson, B.: Maximal algebras of binary relations. Contemporary Mathematics 33 (1984) 299–307

    Google Scholar 

  15. Düntsch, I., Wang, H., McCloskey, S.: A relation algebraic approach to the Region Connection Calculus. Theoretical Computer Science 255 (2001) 63–83

    Article  MATH  MathSciNet  Google Scholar 

  16. de Laguna, T.: Point, line and surface as sets of solids. The Journal of Philosophy 19 (1922) 449–461

    Article  Google Scholar 

  17. Nicod, J.: Geometry in a sensible world. Doctoral thesis, Sorbonne, Paris (1924) English translation in Geometry and Induction, Routledge and Kegan Paul, 1969.

    Google Scholar 

  18. Düntsch, I., Wang, H., McCloskey, S.: Relation algebras in qualitative spatial reasoning. Fundamenta Informaticae (2000) 229–248

    Google Scholar 

  19. Allen, J. F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26 (1983) 832–843

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics