Skip to main content
SpringerLink
Log in

Algorithms for Creating Relational Power Context Families from Conceptual Graphs

  • Conference paper
Conceptual Structures: Standards and Practices (ICCS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1640))

Included in the following conference series:

Abstract

This paper reports on the implementation of Wille’s algorithm for creating power context families from conceptual graphs. It describes how to extend FCA tools, such as TOSCANA, to accommodate the expressibility of CG’s. It further reports on a tool where Wille’s Algorithm, along with an algorithm to create SQL queries from power context families, has been implemented and applied. These algorithms are given a detailed presentation in this paper and their complexity provided.

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. Chein, M. The CORALI Project: Prom Conceptual Graphs to Conceptual Graphs via Labelled Graphs. In D. Lukose, H. Delugach, M. Keeler, L. Searle & J. Sowa (Eds.), Conceptual Structures: Fulfilling Peirce’s Dream, pp. 65–79, Springer-Verlag, 1997.

    Google Scholar 

  2. Chein, M. and Mugnibr, M.-L. Positive Nested Conceptual Graphs. In D. Lukose, H. Dblugach, M. Keeler, L. Searle & J. Sowa (Eds.), Conceptual Structures: Fulfilling Peirce’s Dream, pp. 95–109, Springer-Verlag, 1997.

    Google Scholar 

  3. Mineau, G. W. and Gerbe O. Contexts: A Formal Definition of Worlds of Assertion. In D. Lukose, H. Delugach, M. Keeler, L. Searle & J. Sowa (Eds.), Conceptual Structures: Fulfilling Peirce’s Dream, pp. 80–94, Springer-Verlag, 1997.

    Google Scholar 

  4. Sowa, J. F. Conceptual Graphs Summary. In T. E. NAGLE, J. A. NAGLE, L. L. GERHOLZ, P. W. EKLUND (Eds.), Conceptual Structures: Current Research and Practice, pp. 3–51, Ellis Horwood, 1992.

    Google Scholar 

  5. Vogt, F. and Wille, R. TOSCANA-a graphical tool for analyzing and exploring data. In R. Tamassia, I. G. Tollis (Eds.), Graph Drawing 94, pp. 226–233, Springer-Verlag, 1995.

    Google Scholar 

  6. Vogt, F. Formale Begriffsanalyse mit C++. Springer-Verlag, 1996.

    Google Scholar 

  7. Wille, R. Conceptual Graphs and Formal Concept Analysis. In D. Lukose, H. Delugach, M. Keeler, L. Searle & J. Sowa (Eds.), Conceptual Structures: Fulfilling Peirce’s Dream, pp. 290–303, Springer-Verlag, 1997.

    Google Scholar 

  8. Wille, R. Triadic Concept Graphs. In M.-L. Mugnier & M. Chein (Eds.), Conceptual Structures: Theory, Tools and Applications, pp. 194–208, Springer-Verlag, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology, Griffith University, PMB 50 Gold Coast Mail Centre, Queensland, 9726, Australia

    Bernd Groh & Peter Eklund

Authors
  1. Bernd Groh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Eklund
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Software Engineering Department, Monmouth University, West Long Branch, NJ, 07764-1898, USA

    William M. Tepfenhart

  2. The Bradley Department of Electrical and Computer Engineering, Virginia Tech, Automatic Design Research Group, Blacksburg, VA, 24061, USA

    Walling Cyre

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Groh, B., Eklund, P. (1999). Algorithms for Creating Relational Power Context Families from Conceptual Graphs. In: Tepfenhart, W.M., Cyre, W. (eds) Conceptual Structures: Standards and Practices. ICCS 1999. Lecture Notes in Computer Science(), vol 1640. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48659-3_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-48659-3_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66223-5

  • Online ISBN: 978-3-540-48659-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation