Towards skolemize clauses binding for reasoning in inference engine

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

4 Citations (Scopus)

Abstract

The paper presents a reasoning technique for opendomain Question Answering (QA) system. QA system has attracted more attention to meet information needs providing users with more precise and focused retrieval answers. We proposed a Skolemize Clauses Binding (SCB) for reasoning, along with the theorem proving to provide the basis answer extraction. QA systems employing combination of SCB and resolution theorem proving have been used to provide both satisfying and hypothetical answers. Satisfying answers are associated with ground term corresponding with questions whose logical form contains variables. Hypothetical answer is an answer which comes from the story or plot of text, and required logical thinking because it is not explicitly stated in the knowledge domain. In this case, the answer can be considered as a set of logical formula called skolemize clauses defining sufficient conditions characteristic the tuples of individuals which satisfying the query.

Original languageEnglish
Title of host publicationProceedings - The 2007 International Conference on Computational Science and its Applications, ICCSA 2007
Pages273-279
Number of pages7
DOIs
Publication statusPublished - 2007
Event2007 International Conference on Computational Science and its Applications, ICCSA 2007 - Kuala Lumpur
Duration: 26 Aug 200729 Aug 2007

Other

Other2007 International Conference on Computational Science and its Applications, ICCSA 2007
CityKuala Lumpur
Period26/8/0729/8/07

Fingerprint

Theorem proving
Inference engines

ASJC Scopus subject areas

  • Computer Science Applications

Cite this

Rabiah, A. K., Sembok, T. M. T., & Badioze Zaman, H. (2007). Towards skolemize clauses binding for reasoning in inference engine. In Proceedings - The 2007 International Conference on Computational Science and its Applications, ICCSA 2007 (pp. 273-279). [4301155] https://doi.org/10.1109/ICCSA.2007.80

Towards skolemize clauses binding for reasoning in inference engine. / Rabiah, Abdul Kadir; Sembok, T. M T; Badioze Zaman, Halimah.

Proceedings - The 2007 International Conference on Computational Science and its Applications, ICCSA 2007. 2007. p. 273-279 4301155.

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

Rabiah, AK, Sembok, TMT & Badioze Zaman, H 2007, Towards skolemize clauses binding for reasoning in inference engine. in Proceedings - The 2007 International Conference on Computational Science and its Applications, ICCSA 2007., 4301155, pp. 273-279, 2007 International Conference on Computational Science and its Applications, ICCSA 2007, Kuala Lumpur, 26/8/07. https://doi.org/10.1109/ICCSA.2007.80
Rabiah AK, Sembok TMT, Badioze Zaman H. Towards skolemize clauses binding for reasoning in inference engine. In Proceedings - The 2007 International Conference on Computational Science and its Applications, ICCSA 2007. 2007. p. 273-279. 4301155 https://doi.org/10.1109/ICCSA.2007.80
Rabiah, Abdul Kadir ; Sembok, T. M T ; Badioze Zaman, Halimah. / Towards skolemize clauses binding for reasoning in inference engine. Proceedings - The 2007 International Conference on Computational Science and its Applications, ICCSA 2007. 2007. pp. 273-279
@inproceedings{dee28287426547c0a4acbe734a3afcaf,
title = "Towards skolemize clauses binding for reasoning in inference engine",
abstract = "The paper presents a reasoning technique for opendomain Question Answering (QA) system. QA system has attracted more attention to meet information needs providing users with more precise and focused retrieval answers. We proposed a Skolemize Clauses Binding (SCB) for reasoning, along with the theorem proving to provide the basis answer extraction. QA systems employing combination of SCB and resolution theorem proving have been used to provide both satisfying and hypothetical answers. Satisfying answers are associated with ground term corresponding with questions whose logical form contains variables. Hypothetical answer is an answer which comes from the story or plot of text, and required logical thinking because it is not explicitly stated in the knowledge domain. In this case, the answer can be considered as a set of logical formula called skolemize clauses defining sufficient conditions characteristic the tuples of individuals which satisfying the query.",
author = "Rabiah, {Abdul Kadir} and Sembok, {T. M T} and {Badioze Zaman}, Halimah",
year = "2007",
doi = "10.1109/ICCSA.2007.80",
language = "English",
isbn = "0769529453",
pages = "273--279",
booktitle = "Proceedings - The 2007 International Conference on Computational Science and its Applications, ICCSA 2007",

}

TY - GEN

T1 - Towards skolemize clauses binding for reasoning in inference engine

AU - Rabiah, Abdul Kadir

AU - Sembok, T. M T

AU - Badioze Zaman, Halimah

PY - 2007

Y1 - 2007

N2 - The paper presents a reasoning technique for opendomain Question Answering (QA) system. QA system has attracted more attention to meet information needs providing users with more precise and focused retrieval answers. We proposed a Skolemize Clauses Binding (SCB) for reasoning, along with the theorem proving to provide the basis answer extraction. QA systems employing combination of SCB and resolution theorem proving have been used to provide both satisfying and hypothetical answers. Satisfying answers are associated with ground term corresponding with questions whose logical form contains variables. Hypothetical answer is an answer which comes from the story or plot of text, and required logical thinking because it is not explicitly stated in the knowledge domain. In this case, the answer can be considered as a set of logical formula called skolemize clauses defining sufficient conditions characteristic the tuples of individuals which satisfying the query.

AB - The paper presents a reasoning technique for opendomain Question Answering (QA) system. QA system has attracted more attention to meet information needs providing users with more precise and focused retrieval answers. We proposed a Skolemize Clauses Binding (SCB) for reasoning, along with the theorem proving to provide the basis answer extraction. QA systems employing combination of SCB and resolution theorem proving have been used to provide both satisfying and hypothetical answers. Satisfying answers are associated with ground term corresponding with questions whose logical form contains variables. Hypothetical answer is an answer which comes from the story or plot of text, and required logical thinking because it is not explicitly stated in the knowledge domain. In this case, the answer can be considered as a set of logical formula called skolemize clauses defining sufficient conditions characteristic the tuples of individuals which satisfying the query.

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

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

U2 - 10.1109/ICCSA.2007.80

DO - 10.1109/ICCSA.2007.80

M3 - Conference contribution

SN - 0769529453

SN - 9780769529455

SP - 273

EP - 279

BT - Proceedings - The 2007 International Conference on Computational Science and its Applications, ICCSA 2007

ER -