Describes a prototype natural language text knowledge system (TKS) that was used to organize 50 pages of a handbook on artificial intelligence as an inferential knowledge base with natural language query and command capabilities. Representation of text, database navigation, query systems, discourse structuring, and future research needs are…

Describes a model for a front end query processor to deal with incomplete information in a database. The effectiveness of the processor in restricting the number of objects to be processed in a query and in aiding the interpretation of a query is discussed. (26 references) (Author/CLB)

Identifies requirements for representing structural aspects of nonconventional information system applications and demonstrates how recursive data models support information systems better than record-based database modelling tools. Structural concepts for representing office data objects are discussed and applied to an office example. Language…

Presents a concept of end-user query language with facilities for expressing relationships between objects kept in a database. The idea of nesting these features in typical document query language is shown. Examples of usage of these new facilities are included. (Author/MBR)

Describes a model that displays structures necessary to map between the conceptual and external levels in database management systems, using an algorithm that maps the syntactic representations of tuples onto semantic representations. A technique for translating tuples into natural language sentences is introduced, and a system implemented in…

Describes PLEXUS, an expert system for information retrieval related to gardening, designed at the University of London for use in public libraries. Focusing on the semantic problems encountered, methods used in artificial intelligence and information science to resolve them are discussed, including classification and facet analysis. (Author/LRW)

Presents an algorithm for use in natural language document retrieval systems which automatically determines if the conjunction "and" in a statement representing an information need should be translated into a Boolean "and" or "or." The results of an experiment that used the algorithm are reported, and further research is suggested. (CLB)