The significance of attributes in decision table is defined from the viewpoint of discernibility matrix and the concept of partial discernibility matrix is given and based on which a heuristic algorithm for reduction of knowledge is proposed. Experimental results show that this algorithm can find the minimal reduction for most decision tables.