Search the dblp DataBase
C. A. Johnson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- C. A. Johnson
Top Down Deduction in Indefinite Databases. [Citation Graph (0, 0)][DBLP]
BDA, 1993, pp:119-0 [Conf] - S. Misbah Deen, C. A. Johnson
Towards a Theoretical Foundation for Cooperating Knowledge Based Systems. [Citation Graph (0, 0)][DBLP]
ISMIS, 1999, pp:144-153 [Conf] - C. A. Johnson
Top-Down Query Processing in First Order Deductive Databases under the DWFS. [Citation Graph (0, 0)][DBLP]
ISMIS, 2000, pp:377-388 [Conf] - C. A. Johnson
Computing only minimal answers in disjunctive deductive databases [Citation Graph (0, 0)][DBLP]
CoRR, 2003, v:0, n:, pp:- [Journal] - C. A. Johnson
Constructing interpretations of deductive databases using reduction and dynamic stratification. [Citation Graph (0, 0)][DBLP]
Data Knowl. Eng., 2001, v:38, n:2, pp:173-197 [Journal] - C. A. Johnson
Handling Indefinite and Negative Data in a Deductive Database. [Citation Graph (0, 0)][DBLP]
Data Knowl. Eng., 1991, v:6, n:, pp:333-348 [Journal] - C. A. Johnson
On Computing Minimal and Perfect Model Membership. [Citation Graph (0, 0)][DBLP]
Data Knowl. Eng., 1996, v:18, n:3, pp:225-276 [Journal] - C. A. Johnson
Top-Down Query Processing in Indefinite Stratified Databases. [Citation Graph (0, 0)][DBLP]
Data Knowl. Eng., 1998, v:26, n:1, pp:1-36 [Journal] - C. A. Johnson
On Cyclic Covers and Perfect Models. [Citation Graph (0, 0)][DBLP]
Data Knowl. Eng., 1999, v:30, n:1, pp:25-65 [Journal] - C. A. Johnson
Processing Indefinite Deductive Databases under the Possible Model Semantics. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 2002, v:49, n:4, pp:325-347 [Journal] - C. A. Johnson
Processing Deductive Databases under the Disjunctive Stable Model Semantics. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 1999, v:40, n:1, pp:31-51 [Journal] - C. A. Johnson
Factorization and Circuit in the Connection Method. [Citation Graph (0, 0)][DBLP]
J. ACM, 1993, v:40, n:3, pp:536-557 [Journal] - C. A. Johnson
On the Computation of the Disjunctive Well-Founded Semantics. [Citation Graph (0, 0)][DBLP]
J. Autom. Reasoning, 2001, v:26, n:4, pp:333-356 [Journal] - C. A. Johnson
Top-Down Query Processing in First-Order Deductive Databases under the DWFS. [Citation Graph (0, 0)][DBLP]
J. Autom. Reasoning, 2004, v:32, n:2, pp:167-184 [Journal] - C. A. Johnson
On the Termination of Clause Graph Resolution. [Citation Graph (0, 0)][DBLP]
J. Autom. Reasoning, 1994, v:13, n:1, pp:83-115 [Journal] - C. A. Johnson
Deduction Trees and the View Update Problem in Indefinite Deductive Databases. [Citation Graph (0, 0)][DBLP]
J. Autom. Reasoning, 1997, v:19, n:1, pp:31-85 [Journal] - C. A. Johnson
Distributive Ideals and Partition Relations. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1986, v:51, n:3, pp:617-625 [Journal] - C. A. Johnson
Seminormal lambda-Generated Ideals on Pk lambda. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1988, v:53, n:1, pp:92-102 [Journal] - C. A. Johnson
On Ideals and Stationary Reflection. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1989, v:54, n:2, pp:568-575 [Journal] - S. Misbah Deen, C. A. Johnson
Formalizing an Engineering Approach to Cooperating Knowledge-Based Systems. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Knowl. Data Eng., 2003, v:15, n:1, pp:103-117 [Journal]
Search in 0.002secs, Finished in 0.003secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002