public void checkIsCovering(List<String> oneAttrCombo){
		//Get partition for this combination of non decision attributes
		Set<List<Integer>> singlePartition = computePartition(oneAttrCombo);
		//Check to see if it's a possible covering
		if(isCoveringCanidate(singlePartition, decisionPartition)) {
			System.out.println("Found one that could be a covering!");
			//For now, just put all covering canidates into our structure
			boolean foundLarger = false;
			boolean isLarger = false;
			List<String> temp = new ArrayList<String>();
			for(List<String> one:allCoverings) {
				if(one.containsAll(oneAttrCombo)) {
					foundLarger = true;
					temp = one;
				} 
				if(oneAttrCombo.containsAll(one)) {
					isLarger = true;
				}
			}
			if(foundLarger){
				allCoverings.remove(temp);
				allCoverings.add(oneAttrCombo);
			} else if(isLarger) {
				//Do nothing
			}
			else {
				allCoverings.add(oneAttrCombo);
			}
		}
	}