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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationInternational Conference on Computational Intelligence, Man-Machine Systems and Cybernetics - Proceedings
PublisherWorld Scientific and Engineering Academy and Society
Pages257-262
Number of pages6
Volume1
ISBN (Print)9608457564
Publication statusPublished - 20 Nov 2006
EventProceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics, CIMMACS '06 - Venice
Duration: 20 Nov 200622 Nov 2006

Other

OtherProceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics, CIMMACS '06
CityVenice
Period20/11/0622/11/06

Fingerprint

Knowledge representation
Experiments

Keywords

  • Natural Language Processing
  • Question Answering System
  • Theorem Prover

ASJC Scopus subject areas

  • Artificial Intelligence
  • Human-Computer Interaction
  • Software

Cite this

Rabiah, A. K., Sembok, T. M. T., & Badioze Zaman, H. (2006). Binding skolem clauses in theorem prover resolution for automated hypothetical question answering. In International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics - Proceedings (Vol. 1, pp. 257-262). World Scientific and Engineering Academy and Society.

Binding skolem clauses in theorem prover resolution for automated hypothetical question answering. / Rabiah, Abdul Kadir; Sembok, T. M T; Badioze Zaman, Halimah.

International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics - Proceedings. Vol. 1 World Scientific and Engineering Academy and Society, 2006. p. 257-262.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rabiah, AK, Sembok, TMT & Badioze Zaman, H 2006, Binding skolem clauses in theorem prover resolution for automated hypothetical question answering. in International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics - Proceedings. vol. 1, World Scientific and Engineering Academy and Society, pp. 257-262, Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics, CIMMACS '06, Venice, 20/11/06.
Rabiah AK, Sembok TMT, Badioze Zaman H. Binding skolem clauses in theorem prover resolution for automated hypothetical question answering. In International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics - Proceedings. Vol. 1. World Scientific and Engineering Academy and Society. 2006. p. 257-262
Rabiah, Abdul Kadir ; Sembok, T. M T ; Badioze Zaman, Halimah. / Binding skolem clauses in theorem prover resolution for automated hypothetical question answering. International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics - Proceedings. Vol. 1 World Scientific and Engineering Academy and Society, 2006. pp. 257-262
@inproceedings{406b7e82060a42fa85504bca453865e9,
title = "Binding skolem clauses in theorem prover resolution for automated hypothetical question answering",
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.",
keywords = "Natural Language Processing, Question Answering System, Theorem Prover",
author = "Rabiah, {Abdul Kadir} and Sembok, {T. M T} and {Badioze Zaman}, Halimah",
year = "2006",
month = "11",
day = "20",
language = "English",
isbn = "9608457564",
volume = "1",
pages = "257--262",
booktitle = "International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics - Proceedings",
publisher = "World Scientific and Engineering Academy and Society",

}

TY - GEN

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

AU - Rabiah, Abdul Kadir

AU - Sembok, T. M T

AU - Badioze Zaman, Halimah

PY - 2006/11/20

Y1 - 2006/11/20

N2 - 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.

AB - 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.

KW - Natural Language Processing

KW - Question Answering System

KW - Theorem Prover

UR - http://www.scopus.com/inward/record.url?scp=84905724837&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84905724837&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84905724837

SN - 9608457564

VL - 1

SP - 257

EP - 262

BT - International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics - Proceedings

PB - World Scientific and Engineering Academy and Society

ER -