A Net Structure Based Relational Question Answerer: Description and Examples
Abstract
A question answering system is described which uses a net structure for storage of information. The net structure consists of nodes an labelled edges, which represent relations between the nodes. The labels are also nodes, and therefore definitions of relations may be stored in the net. It is demonstrated that the generality and complexity of this memory structure allows a surprisingly powerful question answering system to be constructed using comparitively simple executive routines. Output from the question answerer, which is currently running on an interactive, time sharing system, is included, showing its range of applicability including question answering, inductive and deductive inference \nsimple theorem proving and problem solving.
Cite
Text
Shapiro and Woodmansee. "A Net Structure Based Relational Question Answerer: Description and Examples." International Joint Conference on Artificial Intelligence, 1969.Markdown
[Shapiro and Woodmansee. "A Net Structure Based Relational Question Answerer: Description and Examples." International Joint Conference on Artificial Intelligence, 1969.](https://mlanthology.org/ijcai/1969/shapiro1969ijcai-net/)BibTeX
@inproceedings{shapiro1969ijcai-net,
title = {{A Net Structure Based Relational Question Answerer: Description and Examples}},
author = {Shapiro, Stuart C. and Woodmansee, George H.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1969},
pages = {325-346},
url = {https://mlanthology.org/ijcai/1969/shapiro1969ijcai-net/}
}