Computing key-word answer to hypothetical queries in the presence of skolem clauses binding

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

This article deals with Natural Language (NL) question answering to knowledge base (KB). The question-answering (QA) system described in this article is used in reading comprehension task. It considers the usual theorem prover for NL semantic interpretation by joining new approaches to the hypothetical question in bringing forth an automated answer to a restricted domain such as reading comprehension. In reading comprehension tasks such as QA processes, there can be limited access clauses to relations, i.e., binding clauses require arguments to be specified for certain predicates in order to retrieve relevant answer from a relation. In this article we studied the problem of computing the keyword answer to a query. The answer could be computed if all the arguments could be bonded. A query is considered as hypothetical if for any instance of the relations in a query, its answer comes from the text and logical thinking that is not explicitly stated in the text. It can be shown in the general form X ⇒ Y, where X cannot be proven based on the information in knowledge base. We studied the binding of arguments between sentences, including the query with logical method. We constructed an architecture for the system. Finally, we studied argument-dependent computability of keyword answer to a hypothetical query, and propose strategies for guiding the process to compute keyword answer.

Original languageEnglish
Pages (from-to)514-521
Number of pages8
JournalWSEAS Transactions on Computers
Volume6
Issue number3
Publication statusPublished - Mar 2007

Fingerprint

Joining
Semantics

Keywords

  • Hypothetical query
  • Keyword answer to queries
  • Skolem clauses binding

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Computing key-word answer to hypothetical queries in the presence of skolem clauses binding. / Rabiah, Abdul Kadir; Sembok, T. M T; Badioze Zaman, Halimah.

In: WSEAS Transactions on Computers, Vol. 6, No. 3, 03.2007, p. 514-521.

Research output: Contribution to journalArticle

@article{c47d3d0bed624f1a84b56e1ed03a249a,
title = "Computing key-word answer to hypothetical queries in the presence of skolem clauses binding",
abstract = "This article deals with Natural Language (NL) question answering to knowledge base (KB). The question-answering (QA) system described in this article is used in reading comprehension task. It considers the usual theorem prover for NL semantic interpretation by joining new approaches to the hypothetical question in bringing forth an automated answer to a restricted domain such as reading comprehension. In reading comprehension tasks such as QA processes, there can be limited access clauses to relations, i.e., binding clauses require arguments to be specified for certain predicates in order to retrieve relevant answer from a relation. In this article we studied the problem of computing the keyword answer to a query. The answer could be computed if all the arguments could be bonded. A query is considered as hypothetical if for any instance of the relations in a query, its answer comes from the text and logical thinking that is not explicitly stated in the text. It can be shown in the general form X ⇒ Y, where X cannot be proven based on the information in knowledge base. We studied the binding of arguments between sentences, including the query with logical method. We constructed an architecture for the system. Finally, we studied argument-dependent computability of keyword answer to a hypothetical query, and propose strategies for guiding the process to compute keyword answer.",
keywords = "Hypothetical query, Keyword answer to queries, Skolem clauses binding",
author = "Rabiah, {Abdul Kadir} and Sembok, {T. M T} and {Badioze Zaman}, Halimah",
year = "2007",
month = "3",
language = "English",
volume = "6",
pages = "514--521",
journal = "WSEAS Transactions on Computers",
issn = "1109-2750",
publisher = "World Scientific and Engineering Academy and Society",
number = "3",

}

TY - JOUR

T1 - Computing key-word answer to hypothetical queries in the presence of skolem clauses binding

AU - Rabiah, Abdul Kadir

AU - Sembok, T. M T

AU - Badioze Zaman, Halimah

PY - 2007/3

Y1 - 2007/3

N2 - This article deals with Natural Language (NL) question answering to knowledge base (KB). The question-answering (QA) system described in this article is used in reading comprehension task. It considers the usual theorem prover for NL semantic interpretation by joining new approaches to the hypothetical question in bringing forth an automated answer to a restricted domain such as reading comprehension. In reading comprehension tasks such as QA processes, there can be limited access clauses to relations, i.e., binding clauses require arguments to be specified for certain predicates in order to retrieve relevant answer from a relation. In this article we studied the problem of computing the keyword answer to a query. The answer could be computed if all the arguments could be bonded. A query is considered as hypothetical if for any instance of the relations in a query, its answer comes from the text and logical thinking that is not explicitly stated in the text. It can be shown in the general form X ⇒ Y, where X cannot be proven based on the information in knowledge base. We studied the binding of arguments between sentences, including the query with logical method. We constructed an architecture for the system. Finally, we studied argument-dependent computability of keyword answer to a hypothetical query, and propose strategies for guiding the process to compute keyword answer.

AB - This article deals with Natural Language (NL) question answering to knowledge base (KB). The question-answering (QA) system described in this article is used in reading comprehension task. It considers the usual theorem prover for NL semantic interpretation by joining new approaches to the hypothetical question in bringing forth an automated answer to a restricted domain such as reading comprehension. In reading comprehension tasks such as QA processes, there can be limited access clauses to relations, i.e., binding clauses require arguments to be specified for certain predicates in order to retrieve relevant answer from a relation. In this article we studied the problem of computing the keyword answer to a query. The answer could be computed if all the arguments could be bonded. A query is considered as hypothetical if for any instance of the relations in a query, its answer comes from the text and logical thinking that is not explicitly stated in the text. It can be shown in the general form X ⇒ Y, where X cannot be proven based on the information in knowledge base. We studied the binding of arguments between sentences, including the query with logical method. We constructed an architecture for the system. Finally, we studied argument-dependent computability of keyword answer to a hypothetical query, and propose strategies for guiding the process to compute keyword answer.

KW - Hypothetical query

KW - Keyword answer to queries

KW - Skolem clauses binding

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

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

M3 - Article

VL - 6

SP - 514

EP - 521

JO - WSEAS Transactions on Computers

JF - WSEAS Transactions on Computers

SN - 1109-2750

IS - 3

ER -