Towards skolemize clauses binding for reasoning in inference engine

The paper presents a reasoning technique for open-domain 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 theor...

Full description

Bibliographic Details
Main Authors: Abdul Kadir, Rabiah, Tengku Sembok, Tengku Mohd, Badioze Zaman, Halimah
Format: Conference or Workshop Item
Language:English
Published: IEEE 2007
Online Access:http://psasir.upm.edu.my/id/eprint/48258/1/Towards%20skolemize%20clauses%20binding%20for%20reasoning%20in%20inference%20engine.pdf
_version_ 1796974957272498176
author Abdul Kadir, Rabiah
Tengku Sembok, Tengku Mohd
Badioze Zaman, Halimah
author_facet Abdul Kadir, Rabiah
Tengku Sembok, Tengku Mohd
Badioze Zaman, Halimah
author_sort Abdul Kadir, Rabiah
collection UPM
description The paper presents a reasoning technique for open-domain 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.
first_indexed 2024-03-06T09:04:30Z
format Conference or Workshop Item
id upm.eprints-48258
institution Universiti Putra Malaysia
language English
last_indexed 2024-03-06T09:04:30Z
publishDate 2007
publisher IEEE
record_format dspace
spelling upm.eprints-482582016-08-04T07:49:52Z http://psasir.upm.edu.my/id/eprint/48258/ Towards skolemize clauses binding for reasoning in inference engine Abdul Kadir, Rabiah Tengku Sembok, Tengku Mohd Badioze Zaman, Halimah The paper presents a reasoning technique for open-domain 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. IEEE 2007 Conference or Workshop Item PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/48258/1/Towards%20skolemize%20clauses%20binding%20for%20reasoning%20in%20inference%20engine.pdf Abdul Kadir, Rabiah and Tengku Sembok, Tengku Mohd and Badioze Zaman, Halimah (2007) Towards skolemize clauses binding for reasoning in inference engine. In: Fifth International Conference on Computational Science and Application (ICCSA 2007), 26-29 Aug. 2007, Kuala Lumpur, Malaysia. (pp. 273-282). 10.1109/ICCSA.2007.24
spellingShingle Abdul Kadir, Rabiah
Tengku Sembok, Tengku Mohd
Badioze Zaman, Halimah
Towards skolemize clauses binding for reasoning in inference engine
title Towards skolemize clauses binding for reasoning in inference engine
title_full Towards skolemize clauses binding for reasoning in inference engine
title_fullStr Towards skolemize clauses binding for reasoning in inference engine
title_full_unstemmed Towards skolemize clauses binding for reasoning in inference engine
title_short Towards skolemize clauses binding for reasoning in inference engine
title_sort towards skolemize clauses binding for reasoning in inference engine
url http://psasir.upm.edu.my/id/eprint/48258/1/Towards%20skolemize%20clauses%20binding%20for%20reasoning%20in%20inference%20engine.pdf
work_keys_str_mv AT abdulkadirrabiah towardsskolemizeclausesbindingforreasoningininferenceengine
AT tengkusemboktengkumohd towardsskolemizeclausesbindingforreasoningininferenceengine
AT badiozezamanhalimah towardsskolemizeclausesbindingforreasoningininferenceengine