The SCEAS System
Navigation Menu

Journals in DBLP

Ann. Math. Artif. Intell.
1996, volume: 18, number: 1

  1. Rachel Ben-Eliyahu, Rina Dechter
    On Computing Minimal Models. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:18, n:1, pp:3-27 [Journal]
  2. Marco Cadoli, Marco Schaerf
    On the complexity of Entailment in Propositional Multivalued Logics. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:18, n:1, pp:29-50 [Journal]
  3. James P. Delgrande, Arvind Gupta
    The Complexity of Minimum Partial Truth Assignments and Implication in Negation-Free Formulae. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:18, n:1, pp:51-67 [Journal]
  4. Kutluhan Erol, James A. Hendler, Dana S. Nau
    Complexity Results for HTN Planning. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:18, n:1, pp:69-93 [Journal]
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002