TOP-DOWN INFERENCE PROCEDURE FOR TEMPLATE DEPENDENCIES.

L. J. Henschen*, B. P. Weems

*Corresponding author for this work

Research output: Contribution to journalArticle

Abstract

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 known 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.

Original languageEnglish (US)
Pages (from-to)51-55
Number of pages5
JournalComputer Journal
Volume31
Issue number1
DOIs
StatePublished - 1988

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'TOP-DOWN INFERENCE PROCEDURE FOR TEMPLATE DEPENDENCIES.'. Together they form a unique fingerprint.

Cite this