The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Paper info

Marco Cadoli, Maurizio Lenzerini
The Complexity of Propositional Closed World Reasoning and Circumscription. [Citation Graph (2, 0)][DBLP]
J. Comput. Syst. Sci., 1994, v:48, n:2, pp:255-310 [Journal]

Scores and Rank
SCEAS: 0.48861
SCEAS_PS: 0.01147
SCEAS_BPS: 0.02233
SCEAS_EPS: 0.03276
SCEAS_BEPS: 0.06645
SCEAS_B0: 3.18149
PAGE_RANK: 0.51034
HITS_H: 0
HITS_A: 0.03284
BHITS_H: 0
BHITS_A: 0.00041
SALSA_A: 0.33113
SALSA_H: 0
BSALSA_A: 0.06865
BSALSA_H: 0
P: 0.00000
BCC: 0.09425
citations_to_me: 2
citations_from_me: 0



Graph produced by graphviz-1.8.5
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:

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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002