Paper Info
Title
When Is a Concept Algebra Boolean?
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.
Year
DOI
Venue
2004
10.1007/978-3-540-24651-0_14
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
Keywords
Field
DocType
boolean algebra,distributive lattice
Stone's representation theorem for Boolean algebras,Discrete mathematics,Congruence lattice problem,Combinatorics,Distributive lattice,Complemented lattice,Boolean algebras canonically defined,Map of lattices,Ideal (order theory),Boolean algebra (structure),Mathematics
Conference
Volume
ISSN
Citations 
2961
0302-9743
0
PageRank 
References 
Authors
0.34
2
1
Name
Order
Citations
PageRank
Léonard Kwuida15516.25