Get started
Author

Lawrence J. Henschen

Observed names: L Henschen, L. Henschen, L. J. Henschen, L.J. Henschen, Lawrence Henschen, Lawrence J Henschen, LawrenceJ. Henschen
OpenAlex ID: A5113910241
On compiling queries in recursive first-order databases
1984 · Lawrence J. Henschen, Shamim A. Naqvi · Journal of the ACM · 284
PDF
Unit Refutations and Horn Sets
1974 · L. Henschen, L. Wos · Journal of the ACM · 149
PDF
Deduction in non-Horn databases
1985 · Adnan Yahya, LawrenceJ. Henschen · Journal of Automated Reasoning · 145
Maintaining state constraints in relational databases: a proof theoretic basis
1989 · William W. McCune, Lawrence J. Henschen · Journal of the ACM · 67
PDF
Compiling Constraint-Checking Programs from First-Order Formulas
1984 · Lawrence J. Henschen, William W. McCune, et al. · Springer eBooks · 65
Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.
1983 · L. Henschen, B. Smith, et al. · Notre Dame Journal of Formal Logic · 56
PDF
Using domain knowledge in knowledge discovery
1999 · Suk-Chung Yoon, Lawrence J. Henschen, et al. · ACM International Conference on Information and Knowledge Management (CIKM) · 41
PDF
Automatic theorem proving in paraconsistent logics: Theory and implementation
1990 · Newton C. A. Costa, Lawrence J. Henschen, et al. · Lecture notes in computer science · 37
A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains
1984 · L. Wos, S. Winker, et al. · Artificial Intelligence · 34
Handling redundancy in the processing of recursive database queries
1987 · Jiawei Han, Lawrence J. Henschen · ACM SIGMOD International Conference on Management of Data (SIGMOD) · 31
PDF
Automated Theorem Proving 1965–1970
1983 · L. Wos, L. Henschen · Springer eBooks · 28
Efficient algorithms for the instantiated transitive closure queries
1991 · G.Z. Qadah, L.J. Henschen, et al. · IEEE Transactions on Software Engineering · 26
Compiling the GCWA in Indefinite Deductive Databases
1988 · Lawrence J. Henschen, Hyung-Sik Park · Elsevier eBooks · 25
Hyperparamodulation: A refinement of paramodulation
1980 · L. Wos, R. Overbeek, et al. · Lecture notes in computer science · 25
Reasoning in Paraconsistent Logics
1991 · James J. Lu, Lawrence J. Henschen, et al. · Automated reasoning series · 24
Classification of recursive formulas in deductive databases
1988 · Cheong Youn, Lawrence J. Henschen, et al. · ACM SIGMOD Record · 23
On the use and internal structure of logic-based decision support systems
1985 · Michael C. Chen, Lawrence J. Henschen · Decision Support Systems · 22
An overview of automated reasoning and related fields
1985 · L. Wos, Fernando Pereira, et al. · Journal of Automated Reasoning · 19
N-sorted logic for automatic theorem-proving in higher-order logic
1972 · Lawrence J. Henschen · ACM Annual Conference · 17
Semantic query reformulation in deductive databases
2002 · S. Lee, L.J. Henschen, et al. · IEEE International Conference on Data Engineering (ICDE) · 16
Performing inferences over recursive data bases
1980 · Shamim A. Naqvi, Lawrence J. Henschen · 16
Classification of recursive formulas in deductive databases
1988 · Cheong Youn, Lawrence J. Henschen, et al. · ACM SIGMOD International Conference on Management of Data (SIGMOD) · 15
Classification and compilation of linear recursive queries in deductive databases
1992 · C. Youn, H.-J. Kim, et al. · IEEE Transactions on Knowledge and Data Engineering · 14
Answering Linear Recursive Queries in Cyclic Databases.
1988 · Ching-Shyan Wu, Lawrence J. Henschen · Future Generation Computer Systems · 14
The Level-Cycle Merging Method
1990 · Jiawei Han, Lawrence J. Henschen · Elsevier eBooks · 11
Works count: 147
Citation count: 1,393
H-index: 18
I10-index: 26
Year
Topic
Type