Recognizing Unnecessary Inference
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Automated Deduction. Pages 366-370.
Abstract
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, automated reasoning systems can produce formulas that are not necessary for the problem at hand. We concentrate on the problem of unnecessary inference in the context of resolution based systems. In such systems several strategies have been developed that allow for the deletion of clauses without sacrificing completeness. Unfortunately these strategies fail to recognize other frequently generated unnecessary formulas. We will present a generalized subsumption theorem that can be used to recognize such formulas and to develop new deletion methods which retain completeness.
@inproceedings{ijcai1989p58,
title = {Recognizing Unnecessary Inference},
author = {Benanav, Dan},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {366--370},
year = {1989},
month = {8},
note = {Automated Deduction},
url = {https://ijcai.org/proceedings/1989/58},
}
TY - CPAPER TI - Recognizing Unnecessary Inference AU - Benanav, Dan T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 366 EP - 370 UR - https://ijcai.org/proceedings/1989/58 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: