Skip Navigation

The Computer Journal 1988 31(1):51-55; doi:10.1093/comjnl/31.1.51
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Henschen, L. J.
Right arrow Articles by Weems, B. P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Top-down Inference Procedure for Template Dependencies

L. J. Henschen1 * and B. P. Weems2 §

1 Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60201, USA, 2 Department of Computer Science Engineering, The University of Texas at Arlington, P.O. Box 19015, Arlington, TX 76019, USA

The chase procedure, for determining if a given dependency must hold in any relation where a set of dependencies is known to hold, operates bottom-up by constructing a hypothetical relation know as a tableau. A top-down counterpart, based on resolution theorem proving techniques, is introduced in which, through factoring, resolvents which contain function terms may be avoided. A literal numbering technique, which limits the number of resolvents, is also examined.

Received June 1986.

* Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60201, USA

§ Department of Computer Science Engineering, The University of Texas at Arlington, P.O. Box 19015, Arlington, TX 76019, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.