Lawrence J. Henschen

Research Areas

• Automated Reasoning/First-order Logic
• Deductive Databases
• Distributed Heterogenous Databases
• Visual Interfaces for Program Development

Significant Publications

• Henschen, L., Overbeek, R. and Wos, L.
  "A Theorem-Proving Language for Experimentation,"
  Communications of the ACM, June, 1974, pp. 308-314.
  

• Henschen, L. and Wos, L.,
  "Unit Refutations and Horn Sets,"
  Journal of the ACM, October, 1974, pp. 590-605.
  

• Henschen, L.,
  "Theorem Proving by Covering Expressions,"
  Journal of the ACM, July, 1979, pp. 385-400.
  

• Henschen, L. and Naqvi, S.,
  "On Compiling Queries in Recursive First-order Databases,"
  Journal of the ACM, January, 1984, pp. 47-86.
  

• Henschen, L. and Lim, Y.,
  "A New Hyperparamodulation Strategy for the Equality Relation,"
  Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, August, 1985, pp. 1138-1145.
  

• McCune, W. and Henschen, L.,
  "Maintaining State Constraints in Relational Databases: A Proof Theoretic Basis,"
  Journal of the ACM, Vol. 36, No. 1, 1989, pp. 46-68.
  

• Henschen, L., Neild, T., Fernandes, C.,
  "An Object-oriented Graph Traversal Algorithm for Data Mediation,"
  Proc. 2nd America Conference on Information Systems, Phoenix, AZ, August 16-18, 1996.