An Inference Rule for Hypothesis Generation
Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 152-156.
Abstract
There are many new application fields for automated deduction where we have to apply abductive reasoning. In these applications we have to generate consequences of a given theory having some appropriate properties. In particular we consider the case where we have to generate the clauses containing instances of a given literal L. The negation of the other literals in such clauses are hypothesis allowing to derive L. In this paper we present an inference rule, called L-inference, which was designed in order to derive those clauses, and a L-strategy. The L-inference rule is a sort of Input Hyperresolution. The main result of the paper is the proof of the soundness and completeness of the L-inference rule. The L-strategy associated to the L-inference rule, is a saturation by level with deletion of the tautologies and of the subsumed clauses. We show that the L-strategy is also complete.
@inproceedings{ijcai1991p23,
title = {An Inference Rule for Hypothesis Generation},
author = {Demolombe, Robert and Fariñas del Cerro, Luis},
booktitle = {Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, {IJCAI-91}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John Mylopoulos and Ray Reiter},
pages = {152--156},
year = {1991},
month = {8},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1991/23},
}
TY - CPAPER TI - An Inference Rule for Hypothesis Generation AU - Demolombe, Robert AU - Fariñas del Cerro, Luis T2 - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91 PB - International Joint Conferences on Artificial Intelligence PY - 1991 SP - 152 EP - 156 UR - https://ijcai.org/proceedings/1991/23 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: