Logical Aspects of Question-Answering by Computer

Kuhns, J. L.

doi:10.1016/b978-0-12-696202-4.50013-9

Cited by 3 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…INFEREX permits the user to specify rules of inference for retrieval of data. Kuhns (1969) describes an algorithm for translating natural language queries into the symbolic language of the system, and discusses the implications of the extensional and intensional aspects of meaning for such a procedure. The extension of a two-place predicate is the set of ordered pairs of arguments which stand in that relation, while the intension refers to the set of meaning postulates giving the interrelations between predicates.…”

Section: Research Models For Question-answering and Fact Retrievalmentioning

confidence: 99%

Linguistics and information science

Montgomery¹

1972

J. Am. Soc. Inf. Sci.

View full text Add to dashboard Cite

This paper defines the relationship between linguistics and information science in terms of a common interest in natural language. The notion of automated processing of natural language–i.e., machine simulation of the language processing activities of a human–provides novel possibilities for interaction between linguists, who have a theoretical interest in such activities, and information scientists, who have more practical goals, e.g. simulating the language processing activities of an indexer with a machine. The concept of a natural language information system is introduced as a framework for reviewing automated language processing efforts by computational linguists and information scientists. In terms of this framework, the former have concentrated on automating the operations of the component for content analysis and representation, while the latter have emphasized the data management component. The complementary nature of these developments allows the postulation of an integrated approach to automated language processing. This approach, which is outlined in the final sections of the paper, incorporates current notions in linguistic theory and information science, as well as design features of recent computational linguistic models.

show abstract

Section: Research Models For Question-answering and Fact Retrievalmentioning

confidence: 99%

Linguistics and information science

Montgomery¹

1972

J. Am. Soc. Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…Relational calculus-based languages rely on the universal and existential quantifiers in the formulation of queries. Relations and quantifier-based languages have a background of use in inferential questiohanswering systems such as the RAND Relational Data File [13,15]. In this context, Kuhns [14] has proposed an "extensional universal quantifier."…”

Section: Introductionmentioning

confidence: 99%

Specifying queries as relational expressions

et al. 1975

View full text Add to dashboard Cite

This paper presents a data sublanguage called SQUARE, intended for use in ad hoc, interactive problem solving by non-computer specialists. SQUARE is based on the relational model of data, and is shown to be relationally complete; however, it avoids the quantifiers and bound variables required by languages based on the relational calculus. Facilities for query, insertion, deletion, and update on tabular data bases are described. A syntax is given, and suggestions are made for alternative syntaxes, including a syntax based on English key words for users with limited mathematical background.

show abstract

Is natural language an unnatural query language?

Montgomery¹

1972

Proceedings of the ACM Annual Conference on - ACM '72

View full text Add to dashboard Cite

Logical Aspects of Question-Answering by Computer

Cited by 3 publications

References 3 publications

Linguistics and information science

Linguistics and information science

Specifying queries as relational expressions

Is natural language an unnatural query language?

Contact Info

Product

Resources

About