Effective Generalization of Relational Descriptions
Abstract
The problem of computing maximally-specific generalizations (MSCG's) of relational descriptions can be modelled as tree search. We describe several transformations and pruning methods for reducing the complexity of the problem. Based on this analysis, we have implemented a search program (X-search) for finding the MSCG's. Experiments compare the separate and combined effects of pruning methods on search efficiency. With effective pruning methods, full-width search appears feasible for moderately sized relational descriptions.
Cite
Text
Watanabe and Rendell. "Effective Generalization of Relational Descriptions." AAAI Conference on Artificial Intelligence, 1990.Markdown
[Watanabe and Rendell. "Effective Generalization of Relational Descriptions." AAAI Conference on Artificial Intelligence, 1990.](https://mlanthology.org/aaai/1990/watanabe1990aaai-effective/)BibTeX
@inproceedings{watanabe1990aaai-effective,
title = {{Effective Generalization of Relational Descriptions}},
author = {Watanabe, Larry and Rendell, Larry A.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1990},
pages = {875-881},
url = {https://mlanthology.org/aaai/1990/watanabe1990aaai-effective/}
}