Binding skolem clauses in theorem prover resolution for automated hypothetical question answering

  • Authors:
  • A. K. Rabiah;T. M. T. Sembok;B. Z. Halimah

  • Affiliations:
  • Department of Information Sciences, Faculty of Information Sciences & Technology, National University of Malaysia, Selangor, Malaysia;Department of Information Sciences, Faculty of Information Sciences & Technology, National University of Malaysia, Selangor, Malaysia;Department of Information Sciences, Faculty of Information Sciences & Technology, National University of Malaysia, Selangor, Malaysia

  • Venue:
  • CIMMACS'06 Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper described a new approach of adapting an existing theorem prover to the hypothetical question in generating an automated answer to a restricted domain such as reading comprehension. The adaptation of this theorem prover involves the modification of some components from our experiment such as: Knowledge Representation and Answer Extraction Agent. Question answering systems employing Skolemized Clauses Binding as the basic reasoning technique have been used to provide hypothetical answers to questions by considering a theorem to be proven as question. Hypothetical answer is an answer which comes from the text and logical thinking that is not explicitly stated in the text. It can be shown in general form X ⇒ Y, where X cannot be proven based on the information in the knowledge base. The notion of what constitutes an answer can be expanded so that the skolemized clauses binding, added as an intermediate approach generated while finding the hypothetical answer, may be regarded as answer. When there is not enough information in a knowledge base to provide a hypothetical answer, an approach such as answer generation requires an external resource similar to world knowledge in order to obtain relevant answer for the question given.