Z. Pawlak, Rough sets, International Journal of Computer & Information Sciences, vol.8, issue.3, pp.341-356, 1982.
DOI : 10.1007/BF01001956

A. Skowron and . Rauszer, The discernibility matrices and functions in information systems Intelligent Decision Support?handbook of Applications and Advances of the Rough Sets Theory, pp.331-362, 1992.

Z. Pawlak, Rough set approach to multi-attribute decision analysis, European Journal of Operational Research, vol.72, issue.3, pp.443-459, 1994.
DOI : 10.1016/0377-2217(94)90415-4

Z. Pawlak and A. Skowron, Rudiments of rough sets, Information Sciences, vol.177, issue.1, pp.3-27, 2007.
DOI : 10.1016/j.ins.2006.06.003

A. Muir, G. Düntsch, and . Gediga, Rough set data representation using binary decision diagrams, Computational Sciences, pp.197-211, 2004.

C. Yuming and M. Duoqian, Searching Algorithm for Attribute Reduction based on Power Graph, Chinese Journal of Computers, pp.1486-1492, 2009.

T. Gu, Z. Xu, and Z. Yang, Symbolic OBDD representations for mechanical assembly sequences, Computer-Aided Design, vol.40, issue.4, pp.411-421, 2008.
DOI : 10.1016/j.cad.2007.12.001

Y. Yao, Y. Zhao, and J. Wang, On Reduct Construction Algorithms, Proceedings of the First International Conference on Rough Sets and Knowledge Technologies, pp.297-304, 2006.
DOI : 10.1007/978-3-540-87563-5_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.9684

Y. Yao and Y. Zhao, Discernibility matrix simplification for constructing attribute reducts, Information Sciences, vol.179, issue.7, pp.867-882, 2009.
DOI : 10.1016/j.ins.2008.11.020
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.375.3157

K. Thangavel and A. Pethalakshmi, Dimensionality reduction based on rough set theory: A review, Applied Soft Computing, vol.9, issue.1, pp.1-12, 2009.
DOI : 10.1016/j.asoc.2008.05.006

X. H. Hu and N. Cercone, LEARNING IN RELATIONAL DATABASES: A ROUGH SET APPROACH, Computational Intelligence, vol.1, issue.2, pp.323-337, 1995.
DOI : 10.1145/125223.125272

Y. Dongyi and C. Zhaojiong, A new discernibility matrix and the computation of a core, Acta Electronica Sinica, vol.307, pp.1086-1088, 2002.

W. Guoyin, Calculation methods for core attributes of decision table, Chinese Journal of Computer, vol.26, issue.5, pp.611-615, 2003.

G. Tianlong and X. Zhoubo, Ordered binary decision diagram and it s application, pp.22-57, 2009.

S. Minato, Zero-suppressed BDDs for set manipulation in combinatorial problems, Proceedings of the 30th international on Design automation conference , DAC '93, pp.272-277
DOI : 10.1145/157485.164890

V. Ognjenovic, V. Brtka, M. Jovanovic, E. Brtka, and I. Berkovic, The Representation of Indiscerniblity Relation by Graph, Proceeding of 9 th IEEE International Symposium on Intelligent systems and Informatics, pp.91-94

Y. Matsunaga and M. Fujita, Multi-level logic optimization using binary decision diagrams, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers, 1989.
DOI : 10.1109/ICCAD.1989.77012

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.4027