Logical analysis of concept lattices by factorization

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F12%3A33141161" target="_blank" >RIV/61989592:15310/12:33141161 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-29892-9_8" target="_blank" >http://dx.doi.org/10.1007/978-3-642-29892-9_8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-29892-9_8" target="_blank" >10.1007/978-3-642-29892-9_8</a>

Result language
angličtina
Original language name
Logical analysis of concept lattices by factorization
Original language description
Reducing the size of concept lattices is a well-known problem in Formal Concept Analysis. A particular instance of this problem is the size reduction of concept lattices using factorization by complete tolerances. We show that all complete tolerances ona complete lattice (i.e., all possible ways of factorizing the lattice) with a naturally-defined operation of multiplication form a residuated lattice. This allows looking at the set of all complete tolerances as a scale of truth degrees using which we can evaluate formulas of predicate logic specifying the desired parameters of the factorization. We present illustrative example to clarify our approach.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/EE2.3.20.0059" target="_blank" >EE2.3.20.0059: Reintegration of Czech Scientist and Creation of Top Level Team in Information Sciences</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)