Paper Info
Title
A Reasoning Methodology for CW-Based Question Answering Systems
Abstract
Question Answering Systems or (QA systems for short) are regarded as the next generation of the current search engines. Instead of returning a list of relevant documents, QA systems find the direct answer to the query posed in natural language. The key difficulty in designing such systems is to perform reasoning on natural language knowledgebase. The theory of Computing with Words (CW), proposed by Zadeh, offers a mathematical tool to formally represent and reason with perceptive information. CW views a proposition in natural language as imposing a soft/hard constraint on an attribute and represents it in form of a generalized constraint . In this paper we develop a reasoning methodology for the restricted domain CW-based QA systems. This methodology takes, as input, the knowledgebase and the query in form of generalized constraints and organizes the knowledge related to the query in a new tree structure, referred to as a constraint propagation tree . The constraint propagation tree generates a plan to find the most relevant answer to the query and allows improving the answer by establishing an information-seeking dialog with user.
Year
DOI
Venue
2009
10.1007/978-3-642-02282-1_41
WILF
Keywords
Field
DocType
reasoning methodology,constraint propagation tree,qa system,generalized constraint,cw-based question answering systems,new tree structure,hard constraint,natural language,direct answer,natural language knowledgebase,relevant answer,tree structure,question answering system,constraint propagation,search engine,question answering
Dialog box,Local consistency,Proposition,Search engine,Question answering,Theory of computing,Computer science,Natural language,Artificial intelligence,Tree structure,Machine learning
Conference
Volume
ISSN
Citations 
5571
0302-9743
3
PageRank 
References 
Authors
0.38
10
3
Name
Order
Citations
PageRank
Elham S. Khorasani1102.22
Shahram Rahimi217240.74
B. Gupta315251.48