Skip to main content
SpringerLink
Log in

Simple Semiconcept Graphs: A Boolean Logic Approach

  • Conference paper
  • First Online:
Conceptual Structures: Broadening the Base (ICCS 2001)

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

Included in the following conference series:

Abstract

The aim of this paper is to develop a logical theory of concept graphs with negation. For this purpose, we introduce semiconcept graphs as syntactical constructs and define their semantics based on power context families. Then a standard power context family is constructed which serves both as a characterization of the entailment relation and as a mechanism to translate knowledge given on the graph level to the context level. A standard graph is constructed which entails all semiconcept graphs valid in a given power context family. The possible use of semiconcept graphs in conceptual knowledge processing is illustrated by an example.

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. Hermann P. T. Ammon, Arzneimittelneben-und wechselwirkungen. Ein Handbuch und Tabellenwerk für Ärzte und Apotheker, Wissensch. VG. 1991.

    Google Scholar 

  2. F. Dau: Negations in Simple Concept Graphs. In: B. Ganter, G.W. Mineau (Eds.): Conceptual Structures: Logical, Linguistic, and Computational Issues, Springer Verlag, Berlin-New York 2000, 263–276.

    Chapter  Google Scholar 

  3. P. Eklund, B. Groh, G. Stumme, R. Wille: A Contextual-Logic Extension of TOSCANA. In: B. Ganter, G.W. Mineau (Eds.): Conceptual Structures: Logical, Linguistic, and Computational Issues, Springer Verlag, Berlin-New York 2000, 453–467.

    Chapter  Google Scholar 

  4. B. Ganter, R. Wille: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin-Heidelberg-New York 1999.

    MATH  Google Scholar 

  5. P. Luksch, R. Wille: A mathematical model for conceptual knowledge systems. In: H.-H. Bock, P. Ihm (Eds.): Classification, data analysis and knowledge organisation, Springer, Heidelberg 1991, 156–162.

    Google Scholar 

  6. S. Prediger: Kontextuelle Urteilslogik mit Begriffsgraphen, Shaker Verlag, Aachen 1998.

    MATH  Google Scholar 

  7. S. Prediger: Simple Concept Graphs: A Logic Approach. In: M.-L Mugnier, M. Chein (Eds): Conceptuel Structures: Theory, Tools and Applications, Springer Verlag, Berlin-New York 1998, 225–239.

    Chapter  Google Scholar 

  8. S. Prediger, R. Wille: The lattice of concept graphs of a relationally scaled context. In: W. Tepfenhart, W. Cyre (Eds.): Conceptual Structures: Standards and Practices, Springer, Berlin Heidelberg New York 1999, 401–414.

    Chapter  Google Scholar 

  9. S. Prediger: Nested Concept Graphs and Triadic Power Context Families: A Situation-Based Contextual Approach. In: B. Ganter, G.W. Mineau (Eds.): Conceptual Structures: Logical, Linguistic, and Computational Issues, Springer Verlag, Berlin-New York 2000, 249–262.

    Chapter  Google Scholar 

  10. R. Wille: Conceptual Graphs and Formal Concept Analysis. In: D. Lukose et. al. (Eds.): Conceptual Structures: Fulfilling Peirce’s Dream, Springer Verlag, Berlin-New York 1997, 290–303.

    Chapter  Google Scholar 

  11. R. Wille: Boolean Concept Logic. In: B. Ganter, G.W. Mineau (Eds.): Conceptual Structures: Logical, Linguistic, and Computational Issues, Springer Verlag, Berlin-New York 2000, 317–331.

    Chapter  Google Scholar 

  12. R. Wille: Boolean Judgment Logic. This Volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Technische Universität Darmstadt, Schloβgartenstr. 7, D-64289, Darmstadt

    Julia Klinger

Authors
  1. Julia Klinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, TH N-351, University of Alabama in Huntsville, Huntsville, AL, 35899, USA

    Harry S. Delugach

  2. Institut für Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universität Karlsruhe (TH), 76128, Karlsruhe, Germany

    Gerd Stumme

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klinger, J. (2001). Simple Semiconcept Graphs: A Boolean Logic Approach. In: Delugach, H.S., Stumme, G. (eds) Conceptual Structures: Broadening the Base. ICCS 2001. Lecture Notes in Computer Science(), vol 2120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44583-8_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-44583-8_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42344-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation