default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC. A. Johnson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j18]C. A. Johnson:
Computing Only Minimal Answers in Disjunctive Deductive Databases. J. Autom. Reason. 42(1): 35-76 (2009)- 2004
- [j17]C. A. Johnson:
Top-Down Query Processing in First-Order Deductive Databases under the DWFS. J. Autom. Reason. 32(2): 167-184 (2004) - 2003
- [j16]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) - [i1]C. A. Johnson:
Computing only minimal answers in disjunctive deductive databases. CoRR cs.LO/0305007 (2003) - 2002
- [j15]C. A. Johnson:
Processing Indefinite Deductive Databases under the Possible Model Semantics. Fundam. Informaticae 49(4): 325-347 (2002) - 2001
- [j14]C. A. Johnson:
Constructing interpretations of deductive databases using reduction and dynamic stratification. Data Knowl. Eng. 38(2): 173-197 (2001) - [j13]C. A. Johnson:
On the Computation of the Disjunctive Well-Founded Semantics. J. Autom. Reason. 26(4): 333-356 (2001) - 2000
- [c3]C. A. Johnson:
Top-Down Query Processing in First Order Deductive Databases under the DWFS. ISMIS 2000: 377-388
1990 – 1999
- 1999
- [j12]C. A. Johnson:
On Cyclic Covers and Perfect Models. Data Knowl. Eng. 31(1): 25-65 (1999) - [j11]C. A. Johnson:
Processing Deductive Databases under the Disjunctive Stable Model Semantics. Fundam. Informaticae 40(1): 31-51 (1999) - [c2]S. Misbah Deen, C. A. Johnson:
Towards a Theoretical Foundation for Cooperating Knowledge Based Systems. ISMIS 1999: 144-153 - 1998
- [j10]C. A. Johnson:
Top-Down Query Processing in Indefinite Stratified Databases. Data Knowl. Eng. 26(1): 1-36 (1998) - 1997
- [j9]C. A. Johnson:
Deduction Trees and the View Update Problem in Indefinite Deductive Databases. J. Autom. Reason. 19(1): 31-85 (1997) - 1996
- [j8]C. A. Johnson:
On Computing Minimal and Perfect Model Membership. Data Knowl. Eng. 18(3): 225-276 (1996) - 1994
- [j7]C. A. Johnson:
On the Termination of Clause Graph Resolution. J. Autom. Reason. 13(1): 83-115 (1994) - 1993
- [j6]C. A. Johnson:
Factorization and Circuit in the Connection Method. J. ACM 40(3): 536-557 (1993) - [c1]C. A. Johnson:
Top Down Deduction in Indefinite Databases. BDA 1993: 119- - 1991
- [j5]C. A. Johnson:
Handling Indefinite and Negative Data in a Deductive Database. Data Knowl. Eng. 6: 333-348 (1991)
1980 – 1989
- 1989
- [j4]C. A. Johnson:
On Ideals and Stationary Reflection. J. Symb. Log. 54(2): 568-575 (1989) - 1988
- [j3]C. A. Johnson:
Seminormal lambda-Generated Ideals on Pk lambda. J. Symb. Log. 53(1): 92-102 (1988) - 1986
- [j2]C. A. Johnson:
Distributive Ideals and Partition Relations. J. Symb. Log. 51(3): 617-625 (1986) - [j1]C. A. Johnson:
Precipitous Ideals on Singular Cardinals. Math. Log. Q. 32(25-30): 461-465 (1986)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
