The SCEAS System
Navigation Menu

Journals in DBLP

Ann. Math. Artif. Intell.
1995, volume: 15, number: 3-4

  1. John S. Schlipf
    Complexity and Undecidability Results for Logic Programming. [Citation Graph (1, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:3-4, pp:257-288 [Journal]
  2. Thomas Eiter, Georg Gottlob
    On the Computational Cost of Disjunctive Logic Programming: Propositional Case. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:3-4, pp:289-323 [Journal]
  3. Audrey Ferry
    A Topological Characterization of the Stable and Minimal Model Classes of Propositional Logic Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:3-4, pp:325-355 [Journal]
  4. V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski
    Complexity of Computing with Extended Propositional Logic Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:3-4, pp:357-378 [Journal]
  5. Yael Moscowitz, Ehud Y. Shapiro
    On the Structural Simplicity of Machines and Languages. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:3-4, pp:379-405 [Journal]
  6. Inderpal Singh Mumick, Oded Shmueli
    How Expressive is Statified Aggregation? [Citation Graph (2, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:3-4, pp:407-434 [Journal]
  7. Andrei Voronkov
    On Computability by Logic Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:3-4, pp:437-456 [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