Constructing Refinement Operators by Decomposing Logical Implication (bibtex)
by Shan-Hwei Nienhuys-Cheng, Patrick R. J. van der Laag, Leendert W. N. van der Torre
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.
Reference:
Constructing Refinement Operators by Decomposing Logical Implication (Shan-Hwei Nienhuys-Cheng, Patrick R. J. van der Laag, Leendert W. N. van der Torre), In AI*IA, 1993.
Bibtex Entry:
@InProceedings{Nienhuys-Cheng1993,
  Title                    = {Constructing Refinement Operators by Decomposing Logical Implication},
  Author                   = {Shan-Hwei Nienhuys-Cheng and Patrick R. J. van der Laag and Leendert W. N. van der Torre},
  Booktitle                = {AI*IA},
  Year                     = {1993},
  Pages                    = {178-189},

  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.},
  Bdsk-url-1               = {http://icr.uni.lu/leonvandertorre/papers/aiia93.ps.Z},
  Bibsource                = {DBLP, http://dblp.uni-trier.de},
  Crossref                 = {DBLP:conf/aiia/1993},
  Ee                       = {http://dx.doi.org/10.1007/3-540-57292-9_56},
  Timestamp                = {2013.07.26},
  Url                      = {http://icr.uni.lu/leonvandertorre/papers/aiia93.ps.Z}
}
Powered by bibtexbrowser