Abstract

The #P-complete problem of finding all the formal concepts of a given context and the decomposition method for its solving are investigated. As parts of the decomposition is proposed to use fragments of the initial context, called boxes. Such decomposition allows to decompose the given context without losing formal concepts and thereby to reduce the execution time of the algorithms for solving considered task. The number of boxes, obtained at each iteration of the decomposition, is determined based on studies of the boxes structure and the rules for stopping of the decomposition process are established

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.