A Reasoning Methodology for CW-Based Question Answering Systems

Authors:
Elham S. Khorasani;Shahram Rahimi;Bidyut Gupta
Affiliations:
Computer Science Department, Southern Illinois University, Carbondale, USA;Computer Science Department, Southern Illinois University, Carbondale, USA;Computer Science Department, Southern Illinois University, Carbondale, USA
Venue:
WILF '09 Proceedings of the 8th International Workshop on Fuzzy Logic and Applications
Year:
2009

Citing 6
Cited 0

Approximate and Commonsense Reasoning: From Theory to Practice

ISMIS '96 Proceedings of the 9th International Symposium on Foundations of Intelligent Systems
Default reasoning with qualified syllogisms

ISUMA '95 Proceedings of the 3rd International Symposium on Uncertainty Modelling and Analysis
Precisiated natural language (PNL)

AI Magazine
A Perception Based, Domain Specific Expert System for Question-Answering Support

WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Toward a generalized theory of uncertainty (GTU)--an outline

Information Sciences: an International Journal
Veristic variables

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

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.