Elsevier

Artificial Intelligence

Volume 2, Issue 2, Autumn 1971, Pages 129-145
Artificial Intelligence

Formal methods in the design of question-answering systems

https://doi.org/10.1016/0004-3702(71)90007-5Get rights and content

Abstract

This paper contributes to the discussion whether and how predicate calculus should be used as a deep structure in question-answering programs. The first part of the paper stresses that there are several possible ways of using predicate calculus, and argues that predicate calculus has significant advantages above competing deep structures if the way of using it is carefully selected. The second half gives hints on how various natural-language constructions can be encoded in a consistent way, and how axion sets that define these encodings can be written and debugged.

References (14)

  • D. Luckham et al.

    Extracting information from resolution proof trees

    Artificial Intell.

    (1971)
  • J.A. Robinson

    A machine oriented logic based on the resolution principle

    J. ACM

    (1965)
  • N. Nilsson

    Problem-Solving Methods in Artificial Intelligence

    (1971)
  • C. Green

    The Application of Theorem-Proving to Question-Answering Systems

  • J. Palme

    Making Computers Understand Natural Language

  • H.G. Bohnert et al.

    Automatic English-to-Logic Translation In a Simplified Model

  • R.F. Simmons

    Computational Linguistics and Question-Answering Systems

There are more references available in the full text version of this article.

Cited by (0)

View full text