Automated Hypothesis Generation Using Extended Inductive Resolution
Abstract
We report on a method of automated hypothesis generation, called f-resolution, which is derived from deductive resolution techniques. The method is inductive in character, in the sense that given input statement E, it generates hypotheses H, such that E is a deductive consequence of E. The method is extended by a generalized unification algorithm which introduces appropriate identity assumptions needed to unify a pair of literals. The f-resolution technique is shown to embody a version of Ockham's raror as a pruning heuristic. Some promising experimental results are also presented.
Cite
Text
Morgan. "Automated Hypothesis Generation Using Extended Inductive Resolution." International Joint Conference on Artificial Intelligence, 1975.Markdown
[Morgan. "Automated Hypothesis Generation Using Extended Inductive Resolution." International Joint Conference on Artificial Intelligence, 1975.](https://mlanthology.org/ijcai/1975/morgan1975ijcai-automated/)BibTeX
@inproceedings{morgan1975ijcai-automated,
title = {{Automated Hypothesis Generation Using Extended Inductive Resolution}},
author = {Morgan, Charles G.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1975},
pages = {351-356},
url = {https://mlanthology.org/ijcai/1975/morgan1975ijcai-automated/}
}