Inductive learning models [Plotkin 1971; Shapiro 1981] often use a search space of clauses, ordered by a generalization hierarchy. To find solutions in the model, search algorithms use different generalization and specialization operators. In this article we will decompose the quasi-ordering induced by logical implication into six increasingly weak orderings. The difference between two successive orderings will be small, and can therefore be understood easily. Using this decomposition, we will describe upward and downward refinement operators for all orderings, including $theta$-subsumption and logical implication.

Additional Metadata
Keywords Inductive learning models, search algorithms
Persistent URL hdl.handle.net/1765/1464
Citation
Nienhuys-Cheng, S-H., van der Laag, P.R.J., & van der Torre, L.W.N.. (1993). Constructing refinement operators by decomposing logical implication. Retrieved from http://hdl.handle.net/1765/1464