When is a concept algebra boolean?

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Concept algebras are concept lattices enriched by a weak negation and a weak opposition. The introduction of these two operations was motivated by the search of a negation on formal concepts. These weak operations form a weak dicomplementation. A weakly dicomplemented lattice is a bounded lattice equipped with a weak dicomplementation. (Weakly) dicomplemented lattices abstract (at least for finite distributive lattices) concept algebras. Distributive double p-algebras and Boolean algebras are some special subclasses of the class of weakly dicomplemented lattices. We investigate in the present work the connection between weak dicomplementations and complementation notions like semicomplementation, pseudocomplementation, complementation or orthocomplementation.

Cite

CITATION STYLE

APA

Kwuida, L. (2004). When is a concept algebra boolean? In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2961, pp. 142–155). Springer Verlag. https://doi.org/10.1007/978-3-540-24651-0_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free