首页> 外文会议>International Conference on Computational Science and its Applications >Towards Skolemize Clauses Binding for Reasoning in Inference Engine
【24h】

Towards Skolemize Clauses Binding for Reasoning in Inference Engine

机译:在推理推理引擎中绑定了绑定的子句

获取原文

摘要

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.
机译:本文提出了开放域问题应答(QA)系统的推理技术。 QA系统引起了更多关注,以满足信息需求,为用户提供更精确和专注的检索答案。我们提出了一种以吸引人的条款绑定(SCB)的推理,以及定理证明提供基础答案提取。采用SCB和分辨率定理组合的QA系统已被用于提供令人满意和假设的答案。满足答案与与逻辑表单包含变量的问题相对应的接地术语关联。假设答案是来自文本故事或情节的答案,以及所需的逻辑思维,因为它没有明确在知识域中陈述。在这种情况下,答案可以被视为称为SkoLemize子句的一组逻辑公式,定义了满足查询的个人元组的特征。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号