Skip to main content
SpringerLink
Log in

Stone Relation Algebras

  • Conference paper
  • First Online:
Relational and Algebraic Methods in Computer Science (RAMICS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10226))

Abstract

We study a generalisation of relation algebras in which the underlying Boolean algebra structure is replaced with a Stone algebra. Many theorems of relation algebras generalise with no or small changes. Weighted graphs represented as matrices over extended real numbers form an instance. Relational concepts and methods can thus be applied to weighted graphs. All results are formally verified in Isabelle/HOL.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading (1974)

    MATH  Google Scholar 

  2. Andréka, H., Mikulás, Sz.: Axiomatizability of positive algebras of binary relations. Algebra Universalis 66(1–2), 7–34 (2011)

    Google Scholar 

  3. Armstrong, A., Foster, S., Struth, G., Weber, T.: Relation algebra. Archive of Formal Proofs (2016, first version 2014)

    Google Scholar 

  4. Armstrong, A., Gomes, V.B.F., Struth, G., Weber, T.: Kleene algebra. Archive of Formal Proofs (2016, first version 2013)

    Google Scholar 

  5. Asplund, T.: Formalizing the Kleene star for square matrices. Bachelor thesis IT 14 002, Department of Information Technology, Uppsala Universitet (2014)

    Google Scholar 

  6. Backhouse, R.C., Carré, B.A.: Regular algebra applied to path-finding problems. J. Inst. Math. Appl. 15(2), 161–186 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  7. Balbes, R., Dwinger, P.: Distributive Lattices. University of Missouri Press, Columbia (1974)

    MATH  Google Scholar 

  8. Berghammer, R., Fischer, S.: Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures. J. Log. Algebr. Methods Program. 84(3), 341–358 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  9. Berghammer, R., von Karger, B.: Relational semantics of functional programs (Chap. 8). In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational Methods in Computer Science, pp. 115–130. Springer, Wien (1997). doi:10.1007/978-3-7091-6510-2_8

    Chapter  Google Scholar 

  10. Berghammer, R., von Karger, B., Wolf, A.: Relation-algebraic derivation of spanning tree algorithms. In: Jeuring, J. (ed.) MPC 1998. LNCS, vol. 1422, pp. 23–43. Springer, Heidelberg (1998). doi:10.1007/BFb0054283

    Chapter  Google Scholar 

  11. Berghammer, R., Rusinowska, A., de Swart, H.: Computing tournament solutions using relation algebra and RelView. Eur. J. Oper. Res. 226(3), 636–645 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  12. Bird, R., de Moor, O.: Algebra of Programming. Prentice Hall, Englewood Cliffs (1997)

    MATH  Google Scholar 

  13. Birkhoff, G.: Lattice Theory. Colloquium Publications, vol. XXV, 3rd edn. American Mathematical Society, Providence (1967)

    MATH  Google Scholar 

  14. Blanchette, J.C., Böhme, S., Paulson, L.C.: Extending Sledgehammer with SMT solvers. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS (LNAI), vol. 6803, pp. 116–130. Springer, Heidelberg (2011). doi:10.1007/978-3-642-22438-6_11

    Chapter  Google Scholar 

  15. Blanchette, J.C., Nipkow, T.: Nitpick: a counterexample generator for higher-order logic based on a relational model finder. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 131–146. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14052-5_11

    Chapter  Google Scholar 

  16. Blyth, T.S.: Lattices and Ordered Algebraic Structures. Springer, London (2005)

    MATH  Google Scholar 

  17. Bredihin, D.A., Schein, B.M.: Representations of ordered semigroups and lattices by binary relations. Colloq. Math. 39(1), 1–12 (1978)

    MathSciNet  MATH  Google Scholar 

  18. Comer, S.D.: On connections between information systems, rough sets and algebraic logic. In: Rauszer, C. (ed.) Algebraic Methods in Logic and in Computer Science. Banach Center Publications, vol. 28, pp. 117–124. Institute of Mathematics, Polish Academy of Sciences, Warsaw (1993)

    Google Scholar 

  19. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)

    MATH  Google Scholar 

  20. Curry, H.B.: Foundations of Mathematical Logic. Dover Publications, New York (1977)

    MATH  Google Scholar 

  21. Desharnais, J., Grinenko, A., Möller, B.: Relational style laws and constructs of linear algebra. J. Log. Algebr. Methods Program. 83(2), 154–168 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  22. Desharnais, J., Struth, G.: Internal axioms for domain semirings. Sci. Comput. Program. 76(3), 181–203 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  23. Freyd, P.J., Ščedrov, A.: Categories, Allegories. North-Holland Mathematical Library, vol. 39. Elsevier Science Publishers, Amsterdam (1990)

    MATH  Google Scholar 

  24. Fried, E., Hansoul, G.E., Schmidt, E.T., Varlet, J.C.: Perfect distributive lattices. In: Eigenthaler, G., Kaiser, H.K., Müller, W.B., Nöbauer, W. (eds.) Contributions to General Algebra, vol. 3, pp. 125–142. Hölder-Pichler-Tempsky, Wien (1985)

    Google Scholar 

  25. Goguen, J.A.: L-fuzzy sets. J. Math. Anal. Appl. 18(1), 145–174 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  26. Gondran, M., Minoux, M.: Graphs, Dioids and Semirings. Springer, New York (2008)

    MATH  Google Scholar 

  27. Grätzer, G.: Lattice Theory: First Concepts and Distributive Lattices. W. H. Freeman and Co., San Francisco (1971)

    MATH  Google Scholar 

  28. Guttmann, W.: Algebras for iteration and infinite computations. Acta Inf. 49(5), 343–359 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  29. Guttmann, W.: Relation-algebraic verification of Prim’s minimum spanning tree algorithm. In: Sampaio, A., Wang, F. (eds.) ICTAC 2016. LNCS, vol. 9965, pp. 51–68. Springer, Cham (2016). doi:10.1007/978-3-319-46750-4_4

    Chapter  Google Scholar 

  30. Guttmann, W.: Stone algebras. Archive of Formal Proofs (2016)

    Google Scholar 

  31. Guttmann, W.: Stone relation algebras. Archive of Formal Proofs (2017)

    Google Scholar 

  32. Hirsch, R., Hodkinson, I.: Relation Algebras by Games. Elsevier Science B.V., Amsterdam (2002)

    MATH  Google Scholar 

  33. Höfner, P., Möller, B.: Dijkstra, Floyd and Warshall meet Kleene. Form. Asp. Comput. 24(4), 459–476 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  34. Kawahara, Y., Furusawa, H.: Crispness in Dedekind categories. Bull. Inform. Cybern. 33(1–2), 1–18 (2001)

    MathSciNet  MATH  Google Scholar 

  35. Kawahara, Y., Furusawa, H., Mori, M.: Categorical representation theorems of fuzzy relations. Inf. Sci. 119(3–4), 235–251 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  36. Killingbeck, D., Teixeira, M.S., Winter, M.: Relations among matrices over a semiring. In: Kahl, W., Winter, M., Oliveira, J.N. (eds.) RAMiCS 2015. LNCS, vol. 9348, pp. 101–118. Springer, Cham (2015). doi:10.1007/978-3-319-24704-5_7

    Chapter  Google Scholar 

  37. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366–390 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  38. Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19(3), 427–443 (1997)

    Article  MATH  Google Scholar 

  39. Macedo, H.D., Oliveira, J.N.: A linear algebra approach to OLAP. Form. Asp. Comput. 27(2), 283–307 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  40. Maddux, R.D.: Relation-algebraic semantics. Theoret. Comput. Sci. 160(1–2), 1–85 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  41. Maddux, R.D.: Relation Algebras. Elsevier B.V., Amsterdam (2006)

    MATH  Google Scholar 

  42. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  43. Paulson, L.C., Blanchette, J.C.: Three years of experience with Sledgehammer, a practical link between automatic and interactive theorem provers. In: Sutcliffe, G., Ternovska, E., Schulz, S. (eds.) Proceedings of 8th International Workshop on the Implementation of Logics, pp. 3–13 (2010)

    Google Scholar 

  44. Pawlak, Z.: Rough sets, rough relations and rough functions. Fundamenta Informaticae 27(2–3), 103–108 (1996)

    MathSciNet  MATH  Google Scholar 

  45. Schmidt, G., Ströhlein, T.: Relationen und Graphen. Springer, Heidelberg (1989)

    Book  MATH  Google Scholar 

  46. Tarski, A.: On the calculus of relations. J. Symb. Log. 6(3), 73–89 (1941)

    Article  MathSciNet  MATH  Google Scholar 

  47. Winter, M.: A new algebraic approach to L-fuzzy relations convenient to study crispness. Inf. Sci. 139(3–4), 233–252 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

I thank Georg Struth and the anonymous referees for pointing out related work and for other helpful comments.

Author information

Authors and Affiliations

  1. Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand

    Walter Guttmann

Authors
  1. Walter Guttmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Walter Guttmann .

Editor information

Editors and Affiliations

  1. Data61, CSIRO, Sydney, New South Wales, Australia

    Peter Höfner

  2. CNRS, Lyon, France

    Damien Pous

  3. University of Sheffield, Sheffield, United Kingdom

    Georg Struth

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Guttmann, W. (2017). Stone Relation Algebras. In: Höfner, P., Pous, D., Struth, G. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2017. Lecture Notes in Computer Science(), vol 10226. Springer, Cham. https://doi.org/10.1007/978-3-319-57418-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57418-9_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57417-2

  • Online ISBN: 978-3-319-57418-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation