Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("HENSCHEN L")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 14 of 14

  • Page / 1

Export

Selection :

  • and

A THEOREM-PROVING LANGUAGE FOR EXPERIMENTATION.HENSCHEN L; OVERBEEK R; WOS L et al.1974; COMMUNIC. A.C.M.; U.S.A.; DA. 1974; VOL. 17; NO 6; PP. 308-314; BIBL. 6 REF.Article

HYPERPARAMODULATION: A REFINEMENT OF PARAMODULATIONWOS L; OVERBEEK R; HENSCHEN L et al.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 87; PP. 208-219; BIBL. 7 REF.Conference Paper

Maintaining state constraints in relational databases: a proof theoretic basisMCCUNE, W. W; HENSCHEN, L. J.Journal of the Association for Computing Machinery. 1989, Vol 36, Num 1, pp 46-68, issn 0004-5411Article

Semantics and properties of existential quantifiers in deductive databasesSANG HO LEE; HENSCHEN, L. J.Information processing letters. 1993, Vol 47, Num 2, pp 101-108, issn 0020-0190Article

A top-down inference procedure for template dependenciesHENSCHEN, L. J; WEEMS, B. P.Computer journal (Print). 1988, Vol 31, Num 1, pp 51-55, issn 0010-4620Article

Evaluation of recursive queries with extended rules in deductive databasesSANG HO LEE; HENSCHEN, L. J.IEEE transactions on knowledge and data engineering. 1995, Vol 7, Num 2, pp 328-331, issn 1041-4347Article

A controlling scheme for Prolog through count termsNAM, Y. K; HENSCHEN, L. J.Computer languages. 1993, Vol 19, Num 4, pp 235-245, issn 0096-0551Article

On compiling queries in recursive first-order databasesHENSCHEN, L. J; NAQVI, S. A.Journal of the Association for Computing Machinery. 1984, Vol 31, Num 1, pp 47-85, issn 0004-5411Article

The completeness of gp-resolution for annotated logicsLU, J. J; HENSCHEN, L. J.Information processing letters. 1992, Vol 44, Num 3, pp 135-140, issn 0020-0190Article

A solution to the unbounded cycle of recursive formulaWU, R. S; HENSCHEN, L. J; PINTSANG CHANG et al.Control and computers. 1990, Vol 18, Num 2, pp 30-36, issn 0730-9538, 7 p.Article

Requirement of gene transcription and protein synthesis for cold- and norepinephrine-induced stimulation of thyroxine deiodinase in rat brown adipose tissueJONES, R; HENSCHEN, L; MOHELL, N et al.Biochimica et biophysica acta. 1986, Vol 889, Num 3, pp 366-373, issn 0006-3002Article

Classification and compilation of linear recursive queries in deductive databasesCHEONG YOUN; HYOUNG-JOO KIM; HENSCHEN, L. J et al.IEEE transactions on knowledge and data engineering. 1992, Vol 4, Num 1, pp 52-67, issn 1041-4347Article

A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domainsWOS, L; WINKER, S; SMITH, B et al.Artificial intelligence. 1984, Vol 22, Num 3, pp 303-356, issn 0004-3702Article

Efficient algorithms for the instantiated transitive closure queriesQADAH, G. Z; HENSCHEN, L. J; KIM, J. J et al.IEEE transactions on software engineering. 1991, Vol 17, Num 3, pp 296-309, issn 0098-5589, 14 p.Article

  • Page / 1