TOP-DOWN INFERENCE PROCEDURE FOR TEMPLATE DEPENDENCIES.

L. J. Henschen; B. P. Weems

doi:10.1093/comjnl/31.1.51

TOP-DOWN INFERENCE PROCEDURE FOR TEMPLATE DEPENDENCIES.

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

^*Corresponding author for this work

Computer Science

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	51-55
Number of pages	5
Journal	Computer Journal
Volume	31
Issue number	1
DOIs	https://doi.org/10.1093/comjnl/31.1.51
State	Published - 1988

ASJC Scopus subject areas

General Computer Science

Access to Document

10.1093/comjnl/31.1.51

Cite this

@article{552db2e3c5fc4ce2bc4d1e109c7ad652,

title = "TOP-DOWN INFERENCE PROCEDURE FOR TEMPLATE DEPENDENCIES.",

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.",

author = "Henschen, {L. J.} and Weems, {B. P.}",

year = "1988",

doi = "10.1093/comjnl/31.1.51",

language = "English (US)",

volume = "31",

pages = "51--55",

journal = "Computer Journal",

issn = "0010-4620",

publisher = "Oxford University Press",

number = "1",

}

TY - JOUR

T1 - TOP-DOWN INFERENCE PROCEDURE FOR TEMPLATE DEPENDENCIES.

AU - Henschen, L. J.

AU - Weems, B. P.

PY - 1988

Y1 - 1988

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

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

UR - http://www.scopus.com/inward/record.url?scp=0023960422&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023960422&partnerID=8YFLogxK

U2 - 10.1093/comjnl/31.1.51

DO - 10.1093/comjnl/31.1.51

M3 - Article

AN - SCOPUS:0023960422

SN - 0010-4620

VL - 31

SP - 51

EP - 55

JO - Computer Journal

JF - Computer Journal

IS - 1

ER -

TOP-DOWN INFERENCE PROCEDURE FOR TEMPLATE DEPENDENCIES.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this