The Superiority of Relative Criteria in Partial Matching and Generalization
Proceedings of the Seventh International Joint Conference on Artificial Intelligence. Nowledge Representation. Pages 296-302.
Abstract
Some familiar justifications for concluding that a data element D is an unacceptable match to a pattern element P are examined for their suitability for partial-matching applications. All of these absolute criteria are found to be unacceptable in that they rule out some plausible partial matches. A partial matching program, RELAX, is described which justifies the conclusion that a data element Ra is an unacceptable match to a pattern element P on the grounds that some other data element Rb is-a better match to f· The use of such relative criteria makes it possible to compute all of the kinds of mappings that Kling [ 9] has claimed are required to account for intuitions about similarity. The ability to form unrestrictive mappings allows RELAX to construct generalizations that have eluded other approaches [ 5' 6 ].
@inproceedings{ijcai1981p59,
title = {The Superiority of Relative Criteria in Partial Matching and Generalization},
author = {Kline, Paul J.},
booktitle = {Proceedings of the Seventh International Joint Conference on
Artificial Intelligence, {IJCAI-81}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Roger C. Schank},
pages = {296--302},
year = {1981},
month = {8},
note = {Nowledge Representation},
url = {https://ijcai.org/proceedings/1981/59},
}
TY - CPAPER TI - The Superiority of Relative Criteria in Partial Matching and Generalization AU - Kline, Paul J. T2 - Proceedings of the Seventh International Joint Conference on Artificial Intelligence, IJCAI-81 PB - International Joint Conferences on Artificial Intelligence PY - 1981 SP - 296 EP - 302 UR - https://ijcai.org/proceedings/1981/59 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
