Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
A Solution of the Word Problem for Free Double Boolean Algebras
verfasst von : Björn Vormbrock
Erschienen in: Formal Concept Analysis
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Double Boolean algebras were introduced in [Wi00a] as a variety fundamental for Boolean Concept Logic, an extension of Formal Concept Analysis allowing negations of formal concepts. In this paper, the free double Boolean algebra generated by the constants is described. Moreover, we show that every free double Boolean algebra with at least one generator is infinite. A measure of the complexity of terms specific for double Boolean algebras is introduced. This, together with a modification of the algorithm for protoconcept exploration (cf. [Vo04]) yields double Boolean algebras containing a counterexample to every term identity up to a given complexity if the identity does not hold in general. These algebras can be constructed automatically, thus the word problem for free double Boolean algebras is solved.