2001 |
71 | | Chris Fernandes,
Lawrence J. Henschen:
Discovering and Resolving User Intent in Heterogeneous Databases.
Fundam. Inform. 47(1-2): 137-154 (2001) |
2000 |
70 | EE | Chris Fernandes,
Lawrence J. Henschen:
Discovering and Resolving User Intent in Heterogeneous Databases.
ISMIS 2000: 389-399 |
69 | EE | Sang-goo Lee,
Lawrence J. Henschen,
Jonghun Chun,
Taehee Lee:
Identifying relevant constraints for semantic query optimization.
Information & Software Technology 42(13): 899-914 (2000) |
1999 |
68 | EE | Suk-Chung Yoon,
Lawrence J. Henschen,
E. K. Park,
S. A. M. Makki:
Using Domain Knowledge in Knowledge Discovery.
CIKM 1999: 243-250 |
1996 |
67 | | Suk-Chung Yoon,
Lawrence J. Henschen:
Finding Interesting Knowledge in Object-Oriented Frameworks for Semantic Query Optimization.
SEKE 1996: 108-115 |
1995 |
66 | EE | Joonyeoub Sung,
Lawrence J. Henschen:
A New Recursive Subclass of Domain Independent Formulas Based on Subimplication.
ICDE 1995: 475-484 |
65 | EE | Sang Ho Lee,
Lawrence J. Henschen:
Evaluation of Recursive Queries with Extended Rules in Deductive Databases.
IEEE Trans. Knowl. Data Eng. 7(2): 328-331 (1995) |
1994 |
64 | EE | Kathleen Neumann,
Lawrence J. Henschen:
Partitioning Algorithms for a Distributed Deductive Databases.
ACM Conference on Computer Science 1994: 288-295 |
63 | | Ta-Cheng Yu,
Lawrence J. Henschen:
Integrating External Functions in an Object Oriented Reasoning System.
ICTAI 1994: 712-715 |
62 | EE | Ismail H. Toroslu,
Ghassan Z. Qadah,
Lawrence J. Henschen:
An efficient database transitive closure algorithm.
Appl. Intell. 4(2): 205-218 (1994) |
61 | EE | Cyril S. Ku,
Heung D. Kim,
Lawrence J. Henschen:
An Efficient Indefiniteness Inference Scheme in Indefinite Deductive Databases.
IEEE Trans. Knowl. Data Eng. 6(5): 713-722 (1994) |
1993 |
60 | EE | Dong-Hoon Choi,
Lawrence J. Henschen:
On Exclusive Disjunctions in Deductive Database.
DASFAA 1993: 353-359 |
59 | | Ismail H. Toroslu,
Lawrence J. Henschen:
An Efficient Transitive Closure Algorithm for Distributed Databases.
ICCI 1993: 185-189 |
58 | | Young K. Nam,
Lawrence J. Henschen:
A Controlling Scheme for Prolog Through Count Terms.
Comput. Lang. 19(4): 235-245 (1993) |
57 | | Sang Ho Lee,
Lawrence J. Henschen:
Semantics and Properties of Existential Quantifiers in Deductive Databases.
Inf. Process. Lett. 47(2): 101-108 (1993) |
56 | | James J. Lu,
Monica D. Barback,
Lawrence J. Henschen:
Interpreting Disjunctive Logic Programs Based on a Strong Sense of Disjunction.
J. Autom. Reasoning 10(3): 345-370 (1993) |
1992 |
55 | | Jonghoon Chun,
Lawrence J. Henschen:
Processing Knowledge-Based Systems Containing Rules With Complex Bodies.
DEXA 1992: 38-43 |
54 | EE | Jonghoon Chun,
Lawrence J. Henschen:
Compiling Rules and Queries in Knowledge Base Systems: A Substitution-Based Approach.
SEKE 1992: 109-115 |
53 | EE | Jung-Hong Kao,
Lawrence J. Henschen:
A Graph Proof Procedure for Real Time Logic.
SEKE 1992: 300-306 |
52 | EE | K. Kim,
Lawrence J. Henschen:
Network-Based Simple Recursive Answer Evaluation for Deductive Databases in Parallel Environment.
SEKE 1992: 63-70 |
51 | | Ismail H. Toroslu,
Ghassan Z. Qadah,
Lawrence J. Henschen:
Method Inheritance with Object Updates in an Object-Oriented Logic Programming Language.
Workshop on Deductive Databases, JICSLP 1992: 106-115 |
50 | EE | Cheong Youn,
Hyoung-Joo Kim,
Lawrence J. Henschen,
Jiawei Han:
Classification and Compilation of Linear Recursive Queries in Deductive Databases.
IEEE Trans. Knowl. Data Eng. 4(1): 52-67 (1992) |
49 | | James J. Lu,
Lawrence J. Henschen:
The Completeness of GP-Resolution for Annotated Logics.
Inf. Process. Lett. 44(3): 135-140 (1992) |
1991 |
48 | | James J. Lu,
Lawrence J. Henschen,
V. S. Subrahmanian,
Newton C. A. da Costa:
Reasoning in Paraconsistent Logics.
Automated Reasoning: Essays in Honor of Woody Bledsoe 1991: 181-210 |
47 | | Young K. Nam,
Lawrence J. Henschen:
Compiling Recursive Functional Prolog Programs with List Structure into Procedural Languages.
Automated Reasoning: Essays in Honor of Woody Bledsoe 1991: 211-230 |
46 | EE | Sang Ho Lee,
Lawrence J. Henschen:
Evaluation of Extended Recursive Queries in Deductive Databases.
DASFAA 1991: 209-215 |
45 | EE | Sang-goo Lee,
Lawrence J. Henschen,
Ghassan Z. Qadah:
Semantic Query Reformulation in Deductive Databases.
ICDE 1991: 232-239 |
44 | | Hichul An,
Lawrence J. Henschen:
Knowledge Based Semantic Query Optimization.
ISMIS 1991: 82-91 |
43 | EE | Ghassan Z. Qadah,
Lawrence J. Henschen,
Jung J. Kim:
Efficient Algorithms for the Instantiated Transitive Closure Queries.
IEEE Trans. Software Eng. 17(3): 296-309 (1991) |
1990 |
42 | | Yusuf Ozturk,
Lawrence J. Henschen:
Hyper Resolution and Equality Axioms without Function Substitutions.
CADE 1990: 456-469 |
41 | | Sang Ho Lee,
Lawrence J. Henschen:
Substitution-based Compilation of Extended Rules in Deductive Databases.
CADE 1990: 57-71 |
40 | | Newton C. A. da Costa,
Lawrence J. Henschen,
James J. Lu,
V. S. Subrahmanian:
Automatic Theorem Proving in Paraconsistent Logics: Theory and Implementation.
CADE 1990: 72-86 |
39 | | Pintsang Chang,
Lawrence J. Henschen:
Parallel Transitive Closure and Transitive Reduction Algorithms.
PARBASE 1990: 152-154 |
38 | | Abdallah Al-Sukairi,
Lawrence J. Henschen:
Query-Independent Compilation of Linear Recursions.
SEKE 1990: 177-182 |
1989 |
37 | | Jiawei Han,
Lawrence J. Henschen:
The Level-Cycle Merging Method.
DOOD 1989: 65-81 |
36 | | Peter C. Nelson,
Lawrence J. Henschen:
Multi-Dimensional Heuristic Searching.
IJCAI 1989: 316-321 |
35 | | Jiawei Han,
Lawrence J. Henschen,
Ning Zhuang:
Derivation of Magic Sets by Compilation.
SEKE 1989: 164-171 |
34 | EE | William McCune,
Lawrence J. Henschen:
Maintaining state constraints in relational databases: a proof theoretic basis.
J. ACM 36(1): 46-68 (1989) |
1988 |
33 | | Shan Chi,
Lawrence J. Henschen:
Recursive Query Answering with Non-Horn Clauses.
CADE 1988: 294-312 |
32 | | Mark Franzen,
Lawrence J. Henschen:
A New Approach to Universal Unification and Its Application to AC-Unification.
CADE 1988: 643-657 |
31 | | Ching-Shyan Wu,
Lawrence J. Henschen:
Answering Linear Recursive Queries in Cyclic Databases.
FGCS 1988: 727-734 |
30 | | Chan Chi,
Lawrence J. Henschen:
CAP - A Three-Phase Query Processing Technique for Indefinite Databases.
FGCS 1988: 735-744 |
29 | | Cheong Youn,
Lawrence J. Henschen,
Jiawei Han:
One-Directional Recursive Formulas.
JCDKB 1988: 69-78 |
28 | EE | Cheong Youn,
Lawrence J. Henschen,
Jiawei Han:
Classification of Recursive Formulas in Deductive Databases.
SIGMOD Conference 1988: 320-328 |
27 | | Lawrence J. Henschen,
Hyung-Sik Park:
Compiling the GCWA in Indefinite Deductive Databases.
Foundations of Deductive Databases and Logic Programming. 1988: 395-438 |
26 | | Lawrence J. Henschen,
Bob P. Weems:
A Top-Down Inference Procedure for Template Dependencies.
Comput. J. 31(1): 51-55 (1988) |
1987 |
25 | EE | Jiawei Han,
Lawrence J. Henschen:
Handling Redundancy in the Processing of Recursive Database Queries.
SIGMOD Conference 1987: 73-81 |
1986 |
24 | | Lawrence J. Henschen,
Hyung-Sik Park:
Indefinite and GCWA Inference in Indefinite Deductive Databases.
AAAI 1986: 191-197 |
1985 |
23 | EE | Michael C. Chen,
Lawrence J. Henschen:
Assumption analysis in compiled logic-based decision support systems (LDSSs) (abstract only).
ACM Conference on Computer Science 1985: 429 |
22 | | Younghwan Lim,
Lawrence J. Henschen:
A New Hyperparamodulation Strategy for the Equality Relation.
IJCAI 1985: 1138-1145 |
21 | | W. W. Bledsoe,
Lawrence J. Henschen:
What Is Automated Theorem Proving?
J. Autom. Reasoning 1(1): 23-28 (1985) |
20 | | Adnan H. Yahya,
Lawrence J. Henschen:
Deduction in Non-Horn Databases.
J. Autom. Reasoning 1(2): 141-160 (1985) |
19 | | William McCune,
Lawrence J. Henschen:
Experiments with Semantic Paramodulation.
J. Autom. Reasoning 1(3): 231-261 (1985) |
1984 |
18 | | Larry Wos,
S. Winker,
B. Smith,
Robert Veroff,
Lawrence J. Henschen:
A New Use of an Automated Reasoning Assistant: Open Questions in Equivalential Calculus and the Study of Infinite Domains.
Artif. Intell. 22(3): 303-356 (1984) |
17 | EE | Lawrence J. Henschen,
Shamim A. Naqvi:
On compiling queries in recursive first-order databases.
J. ACM 31(1): 47-85 (1984) |
1983 |
16 | | Shamim A. Naqvi,
Lawrence J. Henschen:
Synthesizing Least Fixed Point Queries Into Non-Recursive Iterative Programs.
IJCAI 1983: 25-28 |
15 | | William McCune,
Lawrence J. Henschen:
Semantic Paramodula tion for Horn Sets.
IJCAI 1983: 902-908 |
1982 |
14 | | Lawrence J. Henschen,
William McCune,
Shamim A. Naqvi:
Compiling Constraint-Checking Programs from First-Order Formulas.
Advances in Data Base Theory 1982: 145-169 |
13 | | Lawrence J. Henschen,
Shamim A. Naqvi:
Representing Infinite Sequences of Resolvents in recursive First-Order Horn Databases.
CADE 1982: 342-359 |
1981 |
12 | | Robert Veroff,
Lawrence J. Henschen:
Application of Automatic Transformations to Program Verification.
IJCAI 1981: 472-479 |
11 | | Lawrence J. Henschen,
Shamim A. Naqvi:
An Improved Filter for Literal Indexing in Resolution Systems.
IJCAI 1981: 525-529 |
1980 |
10 | | Shamim A. Naqvi,
Lawrence J. Henschen:
Performing Inferences over Recursive Data Bases.
AAAI 1980: 263-265 |
9 | | Larry Wos,
Ross A. Overbeek,
Lawrence J. Henschen:
Hyperparamodulation: A Refinement of Paramodulation.
CADE 1980: 208-219 |
1979 |
8 | EE | Lawrence J. Henschen:
Theorem Proving by Covering Expressions.
J. ACM 26(3): 385-400 (1979) |
1977 |
7 | | S. L. Taylor,
Gilbert K. Krulee,
Lawrence J. Henschen:
Automatic Abstracting of Textual Material.
IJCAI 1977: 117-118 |
6 | | Lawrence J. Henschen,
W. M. Evangelist:
Theorem Proving by Covering Expressions.
IJCAI 1977: 541-542 |
1976 |
5 | | Lawrence J. Henschen:
Introduction: Tutorial on Resolution.
IEEE Trans. Computers 25(8): 769-772 (1976) |
4 | | Lawrence J. Henschen:
Semantic Resolution for Horn Sets.
IEEE Trans. Computers 25(8): 816-822 (1976) |
1975 |
3 | | Lawrence J. Henschen:
Semantic Resolution for Horn Sets.
IJCAI 1975: 46-52 |
1974 |
2 | | Lawrence J. Henschen,
Ross A. Overbeek,
Larry Wos:
A Theorem-Proving Language for Experimentation.
Commun. ACM 17(6): 308-314 (1974) |
1 | EE | Lawrence J. Henschen,
Larry Wos:
Unit Refutations and Horn Sets.
J. ACM 21(4): 590-605 (1974) |