Affiliation:
1. The Rand Corporation, Santa Monica, California
Abstract
A class of formulas of the first-order predicate calculus, the definite formulas has recently been proposed as the formal representation of the “reasonable” questions to put to a computer in the context of an actual data retrieval system, the Relational Data File of Levien and Maron. It is shown here that the decision problem for the class of definite formulas is recursively unsolvable. Hence there is no algorithm to decide whether a given formula is definite.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference7 articles.
1. A computer system for inference execution and data retrieval
2. MARON M. E. flelatimal data file I : design philosophy. In Sehector G. (Ed.) Information ReTrievel A Crilical View Thompson Book Co. Washington D. C. 1906. MARON M. E. flelatimal data file I : design philosophy. In Sehector G. (Ed.) Information ReTrievel A Crilical View Thompson Book Co. Washington D. C. 1906.
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献