Skip to main content

Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2006)

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

Included in the following conference series:

  • 644 Accesses

Abstract

Relation algebra is well suited for dealing with many problems on ordered sets. Introducing lattices via order relations, this suggests to apply it and tools for its mechanization for lattice-theoretical problems, too. We combine relation algebra and the specific purpose Computer Algebra system RelView to solve some algorithmic problems.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Behnke, R., et al.: RELVIEW — A system for calculation with relations and relational programming. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol. 1382, pp. 318–321. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Berghammer, R., Fronk, A.: Exact computation of minimum feedback vertex sets with relational algebra. Fund. Informaticae 70, 301–316 (2006)

    MathSciNet  MATH  Google Scholar 

  3. Berghammer, R., Schmidt, G.: Discrete ordering relations. Discr. Math. 43, 1–7 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  4. Berghammer, R., Leoniuk, B., Milanese, U.: Implementation of relation algebra using binary decision diagrams. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 241–257. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Berghammer, R., Neumann, F.: RELVIEW – An OBDD-based Computer Algebra system for relations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol. 3718, pp. 40–51. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Berghammer, R.: Computation of cut completions and concept lattices using relational algebra and RELVIEW. J. Relat. Meth. in Comput. Sci. 1, 50–72 (2004)

    Google Scholar 

  7. Berghammer, R., Milanese, U.: Relational approach to Boolean logic problems. In: MacCaull, W., Winter, M., Düntsch, I. (eds.) RelMiCS 2005. LNCS, vol. 3929, pp. 48–59. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Birkhoff, G.: Lattice theory, 3rd edn., vol. XXV. American Math. Society Coll. Publ., American Math. Society (1967)

    Google Scholar 

  9. Freese, R., Jezek, J., Nation, J.B.: Free lattices. Mathematical Surveys and Monographs, vol. 42. American Math. Society (1995)

    Google Scholar 

  10. Ganter, B., Wille, R.: Formal concept analysis: Mathematical foundations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  11. Leoniuk, B.: ROBDD-based implementation of relational algebra with applications (in German). Ph.D. thesis, Univ. Kiel (2001)

    Google Scholar 

  12. Milanese, U.: On the implementation of a ROBDD-based tool for the manipulation and visualization of relations (in German). Ph.D. thesis, Univ. Kiel (2003)

    Google Scholar 

  13. Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Inform. Proc. Let. 70, 259–264 (1999)

    Article  MathSciNet  Google Scholar 

  14. Schmidt, G., Ströhlein, T.: Relations and graphs. Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoret. Comput. Sci. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  15. Skornjakow, L.A.: Elements of lattice theory (in German). Akademie-Verlag (1973)

    Google Scholar 

  16. Tarski, A.: On the calculus of relations. J. Symbolic Logic 6, 73–89 (1941)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berghammer, R. (2006). Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView . In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2006. Lecture Notes in Computer Science, vol 4194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11870814_4

Download citation

  • DOI: https://doi.org/10.1007/11870814_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45182-2

  • Online ISBN: 978-3-540-45195-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics