@proceedings{DBLP:conf/aiia/1993,
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {AI*IA},
  editor = {Pietro Torasso},
  isbn = {3-540-57292-9},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Advances in Artificial Intelligence, Third Congress of the Italian Association for Artificial Intelligence, AI*IA'93, Torino, Italy, October 26-28, 1993, Proceedings},
  volume = {728},
  year = {1993}
}
@inproceedings{DBLP:conf/aiia/Nienhuys-ChengLT93,
  abstract = {Inductive learning models (Plotkin, Shapiro) 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 introduce a framework of deconstructing orderings to find refinement operators. We decompose the quasi-ordering induced by logical implication into six increasingly weak orderings. The difference between two successive orderings is small, and can therefore be understood easily. Using this decomposition, we describe upward and downward refinement operators for all orderings, including theta-subsumption and logical implication.},
  author = {Shan-Hwei Nienhuys-Cheng and Patrick R. J. van der Laag and Leendert W. N. van der Torre},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {AI*IA},
  crossref = {DBLP:conf/aiia/1993},
  ee = {http://dx.doi.org/10.1007/3-540-57292-9_56},
  pages = {178-189},
  title = {Constructing Refinement Operators by Decomposing Logical Implication},
  url = {http://icr.uni.lu/leonvandertorre/papers/aiia93.ps.Z},
  year = {1993},
  bdsk-url-1 = {http://icr.uni.lu/leonvandertorre/papers/aiia93.ps.Z}
}