Toward Defeasible Machine Learning: When Learned Rule Sets Become Defeasible Theories
This work identifies a single structural condition on learned conjunctive rule sets, called strict global exception closure, under which every prediction the classifier makes is provably a defeasible entailment and analyses what breaks when the condition fails, revealing insights for both machine learning and nonmonoto...