Semiconcept and protoconcept algebras: the basic theorems

Authors:
Björn Vormbrock;Rudolf Wille
Affiliations:
Fachbereich Mathematik, Technische Universität Darmstadt, Darmstadt;Fachbereich Mathematik, Technische Universität Darmstadt, Darmstadt
Venue:
Formal Concept Analysis
Year:
2005

Citing 8
Cited 3

Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Contextual Attribute Logic

ICCS '99 Proceedings of the 7th International Conference on Conceptual Structures: Standards and Practices
Boolean Concept Logic

ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Boolean Judgment Logic

ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Simple Semiconcept Graphs: A Boolean Logic Approach

ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Existential Concept Graphs of Power Context Families

ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
Semiconcept Graphs with Variables

ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
A Contextual-Logic Extension of TOSCANA

ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues

A solution of the word problem for free Double Boolean algebras

ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
On the isomorphism problem of concept algebras

Annals of Mathematics and Artificial Intelligence
Formal concept analysis and lattice-valued Chu systems

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

The concern of this paper is to elaborate a basic understanding of semiconcepts and protoconcepts as notions of Formal Concept Analysis. First, semiconcepts and protoconcepts are motivated by their use for effectively describing formal concepts. It is shown that one can naturally operate with those units of description, namely with operations which constitute algebras of semiconcepts and algebras of protoconcepts as so-called double Boolean algebras. The main results of this paper are the two basic theorems which characterize semiconcept resp. protoconcept algebras as pure resp. fully contextual double Boolean algebras whose related Boolean algebras are complete and atomic. Those theorems may, for instance, be applied to check whether line diagram representations of semiconcept and protoconcept algebras are correct.