Abstract
Due to its special role on logical deduction and practical applications of attribute implications, canonical basis has attracted much attention and been widely studied in Formal Concept Analysis. Canonical basis is constructed on pseudo-intents and, as an attribute implication basis, possesses of many important features, such as completeness, non-redundancy and minimality among all complete sets of attribute implications. In this paper, to deduce an analogous basis for decision implications, we introduce the notion of decision premise and form the so-called decision implication canonical basis. Furthermore, we show that the basis is complete, non-redundant and minimal among all complete sets of decision implications. We also present an algorithm to generate this canonical basis and analyze time complexity of this algorithm.
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 callDisclaimer: 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.
