ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Information Processing & Management
Volume 23, Issue 4, 1987, Pages 321-339
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (1601 K)

 
 
 
Related Articles in ScienceDirect
There are no related articles for this article.
 
Special issue
View Record in Scopus
 
doi:10.1016/0306-4573(87)90021-5    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1987 Published by Elsevier Science Ltd. All rights reserved.

A text knowledge base from the AI handbook*1

Robert F. Simmons

Department of Computer Science, University of Texas at Austin, Austin, TX 78712, USA

Received 25 February 1987. 
Available online 13 July 2002.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

This research aims at defining a consistent set of text representation conventions for organizing fifty pages of the AI handbook as an inferential knowledge base founded on a procedural logic system of general inference schemes for answering questions from it. As a result of research on the AI handbook project, we have developed a prototype, natural-language, text-knowledge system that includes a data base manager to compile the text knowledge and to make it available to navigational commands. The text is represented as logical propositions that form a set of text axioms to model its content. English questions and commands are translated to corresponding logical formulas and treated as theorems to be proved with respect to the text model. The logical form is that of semantic relations (SRs)—logical predicates with varying numbers and ordering of arguments. To compute effectively with such a free form, a relaxed unification procedure was defined as the basis of the SR theorem prover. The use of procedural logic, augmented with fast compiled LISP functions, has shown that questions can be answered in times ranging from a few tenths of a second to minutes of CPU time on a DEC2060 system. The navigational capabilities of the data base manager make available larger contexts surrounding the text and offer the user complete freedom to explore the text and to extract any desired information from it.

Article Outline

• References

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.