Skip to main content
SpringerLink
Log in

RelView – An OBDD-Based Computer Algebra System for Relations

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

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

Included in the following conference series:

Abstract

We present an OBDD-based Computer Algebra system for relational algebra, called RelView. After a short introduction to the OBDD-implementation of relations and the system, we exhibit its application by presenting two typical examples.

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 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. 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., Hoffmann, T.: Modelling sequences within the RelView system. J. of Univ. Comp. Sci. 7, 107–123 (2001)

    MATH  MathSciNet  Google Scholar 

  3. Berghammer, R., Möller, B., Struth, G. (eds.): RelMiCS 2003. LNCS, vol. 3051. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  4. Brink, C., Kahl, W., Schmidt, G. (eds.): Relational methods in computer science, Advances in Computer Science. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  5. Bryant, R.E.: Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Com. Surv. 24, 293–318 (1992)

    Article  Google Scholar 

  6. Davey, B.A., Priestley, H.A.: Introduction to lattices and orders. Cambridge Univ. Press, Cambridge (1991)

    Google Scholar 

  7. DIMACS implementation challenges (second challenge, 1992-1993), Available via, http://dimacs.rutgers.edu/Challenges/

  8. Fahle, T.: Simple and fast: Improving a branch-and-bound algorithm for maximum clique. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 485–498. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Fronk, A.: Using relational algebra for the analysis of Petri nets in a CASE tool based approach. In: Proc. 2nd IEEE Int. Conf. on Software Engineering and Formal Methods, pp. 396–405. IEEE Press, Los Alamitos (2004)

    Chapter  Google Scholar 

  10. Leoniuk, B.: ROBDD-based implementation of relational algebra with applications (in German). Diss., Univ. Kiel (2001)

    Google Scholar 

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

    Google Scholar 

  12. Schmidt, G., Ströhlein, T.: Relations and graphs. Discrete mathematics for computer scientists. EATCS Monographs on Theoret. Comp. Sci. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  13. Wegener, I.: Branching programs and binary decision diagrams: Theory and applications. SIAM Monographs on Discr. Math. and Appl., SIAM (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Olshausenstraße 40, D-24098, Kiel

    Rudolf Berghammer & Frank Neumann

Authors
  1. Rudolf Berghammer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Neumann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, Technische Universität München, Boltzmannstr. 3, 85748, Garching, Germany

    Victor G. Ganzha  & Ernst W. Mayr  & 

  2. Institute of Theoretical and Applied Mechanics, Russian Academy of Sciences, 630090, Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berghammer, R., Neumann, F. (2005). RelView – An OBDD-Based Computer Algebra System for Relations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2005. Lecture Notes in Computer Science, vol 3718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11555964_4

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28966-1

  • Online ISBN: 978-3-540-32070-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation