A Control Structure for a Question-Answering System
Abstract
The control structure of a question-answering system is derived from a set of basic assumptions. For its design and implementation, a normal algorithmic language is used. The design leads to symmetric procedures, the resulting programs use the stack mechanism for recursion to give the correct storage allocation. Two strategies are discussed in more detail: a trivial well-known depth-first strategy and a new one, called flexible decision tree strategy. No linguistic aspects (either syntactic or semantic) of the system are discussed
Cite
Text
Madama. "A Control Structure for a Question-Answering System." International Joint Conference on Artificial Intelligence, 1975.Markdown
[Madama. "A Control Structure for a Question-Answering System." International Joint Conference on Artificial Intelligence, 1975.](https://mlanthology.org/ijcai/1975/madama1975ijcai-control/)BibTeX
@inproceedings{madama1975ijcai-control,
title = {{A Control Structure for a Question-Answering System}},
author = {Madama, P.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1975},
pages = {542-548},
url = {https://mlanthology.org/ijcai/1975/madama1975ijcai-control/}
}