Person: Lawrence J. Henschen

DBLP: Henschen:Lawrence_J=

Contributed to:

2014

2013

2013

1999

1996

1992

1990

1990

1989

1988

1988

1987

1982

1980

Wrote 19 papers:

HCI-TMT-2014-HenschenLSZL #design #documentation #mvc #user interface #using

Intelligent Document User Interface Design Using MVC and UIML (LJH, NL, YS, YZ, JCL), pp. 423–432.

HCI-AS-2013-KosnikH #data transformation #design #framework #health #interface #monitoring

Design and Interface Considerations for Web-Enabled Data Management in Civil Infrastructure Health Monitoring (DEK, LJH), pp. 107–116.

HCI-IMT-2013-HenschenL #design #interface #network

A Web-Based Interface for a System That Designs Sensor Networks (LJH, JCL), pp. 688–697.

CIKM-1999-YoonHPM #information management #using

Using Domain Knowledge in Knowledge Discovery (SCY, LJH, EKP, SAMM), pp. 243–250.

SEKE-1996-YoonH #framework #object-oriented #optimisation #query #semantics

Finding Interesting Knowledge in Object-Oriented Frameworks for Semantic Query Optimization (SCY, LJH), pp. 108–115.

SEKE-1992-ChunH #approach #compilation #knowledge base #query

Compiling Rules and Queries in Knowledge Base Systems: A Substitution-Based Approach (JC, LJH), pp. 109–115.

SEKE-1992-KaoH #graph #logic #proving #realtime

A Graph Proof Procedure for Real Time Logic (JHK, LJH), pp. 300–306.

SEKE-1992-KimH #database #deduction #evaluation #parallel #recursion

Network-Based Simple Recursive Answer Evaluation for Deductive Databases in Parallel Environment (KK, LJH), pp. 63–70.

CADE-1990-CostaHLS #automation #implementation #logic #proving #theorem proving

Automatic Theorem Proving in Paraconsistent Logics: Theory and Implementation (NCAdC, LJH, JJL, VSS), pp. 72–86.

CADE-1990-LeeH #compilation #database #deduction

Substitution-based Compilation of Extended Rules in Deductive Databases (SHL, LJH), pp. 57–71.

CADE-1990-OzturkH #axiom #similarity

Hyper Resolution and Equality Axioms without Function Substitutions (YO, LJH), pp. 456–469.

SEKE-1990-Al-SukairiH #compilation #independence #linear #recursion

Query-Independent Compilation of Linear Recursions (AAS, LJH), pp. 177–182.

SEKE-1989-HanHZ #compilation #set

Derivation of Magic Sets by Compilation (JH, LJH, NZ), pp. 164–171.

CADE-1988-ChiH #horn clause #query #recursion

Recursive Query Answering with Non-Horn Clauses (SC, LJH), pp. 294–312.

CADE-1988-FranzenH #approach #unification

A New Approach to Universal Unification and Its Application to AC-Unification (MF, LJH), pp. 643–657.

SIGMOD-1988-YounHH #classification #database #deduction #recursion

Classification of Recursive Formulas in Deductive Databases (CY, LJH, JH), pp. 320–328.

SIGMOD-1987-HanH #database #query #recursion

Handling Redundancy in the Processing of Recursive Database Queries (JH, LJH), pp. 73–81.

CADE-1982-HenschenN #database #first-order #infinity #recursion #representation #sequence

Representing Infinite Sequences of Resolvents in recursive First-Order Horn Databases (LJH, SAN), pp. 342–359.

CADE-1980-WosOH #named #refinement

Hyperparamodulation: A Refinement of Paramodulation (LW, RAO, LJH), pp. 208–219.