| 2009 |
|---|
| 21 | EE | C. A. Johnson:
Computing Only Minimal Answers in Disjunctive Deductive Databases.
J. Autom. Reasoning 42(1): 35-76 (2009) |
| 2004 |
|---|
| 20 | EE | C. A. Johnson:
Top-Down Query Processing in First-Order Deductive Databases under the DWFS.
J. Autom. Reasoning 32(2): 167-184 (2004) |
| 2003 |
|---|
| 19 | EE | C. A. Johnson:
Computing only minimal answers in disjunctive deductive databases
CoRR cs.LO/0305007: (2003) |
| 18 | EE | S. Misbah Deen,
C. A. Johnson:
Formalizing an Engineering Approach to Cooperating Knowledge-Based Systems.
IEEE Trans. Knowl. Data Eng. 15(1): 103-117 (2003) |
| 2002 |
|---|
| 17 | | C. A. Johnson:
Processing Indefinite Deductive Databases under the Possible Model Semantics.
Fundam. Inform. 49(4): 325-347 (2002) |
| 2001 |
|---|
| 16 | EE | C. A. Johnson:
Constructing interpretations of deductive databases using reduction and dynamic stratification.
Data Knowl. Eng. 38(2): 173-197 (2001) |
| 15 | | C. A. Johnson:
On the Computation of the Disjunctive Well-Founded Semantics.
J. Autom. Reasoning 26(4): 333-356 (2001) |
| 2000 |
|---|
| 14 | EE | C. A. Johnson:
Top-Down Query Processing in First Order Deductive Databases under the DWFS.
ISMIS 2000: 377-388 |
| 1999 |
|---|
| 13 | | S. Misbah Deen,
C. A. Johnson:
Towards a Theoretical Foundation for Cooperating Knowledge Based Systems.
ISMIS 1999: 144-153 |
| 12 | | C. A. Johnson:
On Cyclic Covers and Perfect Models.
Data Knowl. Eng. 30(1): 25-65 (1999) |
| 11 | | C. A. Johnson:
Processing Deductive Databases under the Disjunctive Stable Model Semantics.
Fundam. Inform. 40(1): 31-51 (1999) |
| 1998 |
|---|
| 10 | EE | C. A. Johnson:
Top-Down Query Processing in Indefinite Stratified Databases.
Data Knowl. Eng. 26(1): 1-36 (1998) |
| 1997 |
|---|
| 9 | | C. A. Johnson:
Deduction Trees and the View Update Problem in Indefinite Deductive Databases.
J. Autom. Reasoning 19(1): 31-85 (1997) |
| 1996 |
|---|
| 8 | EE | C. A. Johnson:
On Computing Minimal and Perfect Model Membership.
Data Knowl. Eng. 18(3): 225-276 (1996) |
| 1994 |
|---|
| 7 | | C. A. Johnson:
On the Termination of Clause Graph Resolution.
J. Autom. Reasoning 13(1): 83-115 (1994) |
| 1993 |
|---|
| 6 | | C. A. Johnson:
Top Down Deduction in Indefinite Databases.
BDA 1993: 119- |
| 5 | EE | C. A. Johnson:
Factorization and Circuit in the Connection Method.
J. ACM 40(3): 536-557 (1993) |
| 1991 |
|---|
| 4 | | C. A. Johnson:
Handling Indefinite and Negative Data in a Deductive Database.
Data Knowl. Eng. 6: 333-348 (1991) |
| 1989 |
|---|
| 3 | | C. A. Johnson:
On Ideals and Stationary Reflection.
J. Symb. Log. 54(2): 568-575 (1989) |
| 1988 |
|---|
| 2 | | C. A. Johnson:
Seminormal lambda-Generated Ideals on Pk lambda.
J. Symb. Log. 53(1): 92-102 (1988) |
| 1986 |
|---|
| 1 | | C. A. Johnson:
Distributive Ideals and Partition Relations.
J. Symb. Log. 51(3): 617-625 (1986) |
