The SCEAS System
Navigation Menu

Journals in DBLP

Artif. Intell.
1994, volume: 70, number: 1-2

  1. David C. Wilkins, Yong Ma
    The Refinement of Probabilistic Rule Sets: Sociopathic Interactions. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:1-32 [Journal]
  2. Giangiacomo Gerla
    Inferences in Probability Logic. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:33-52 [Journal]
  3. Vladimir Lifschitz
    Minimal Belief and Negation as Failure. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:53-72 [Journal]
  4. Colin P. Williams, Tad Hogg
    Exploiting the Deep Structure of Constraint Problems. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:73-117 [Journal]
  5. Geoffrey G. Towell, Jude W. Shavlik
    Knowledge-Based Artificial Neural Networks. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:119-165 [Journal]
  6. James P. Delgrande, Torsten Schaub, W. Ken Jackson
    Alternative Approaches to Default Logic. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:167-237 [Journal]
  7. Pietro Parodi, Vincent Torre
    On the Complexity of Labeling Perspective Projections of Polyhedral Scenes. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:239-276 [Journal]
  8. P. Pandurang Nayak
    Causal Approximations. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:277-334 [Journal]
  9. Ian P. Gent, Toby Walsh
    Easy Problems are Sometimes Hard. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:335-345 [Journal]
  10. Alfonso Gerevini, Lenhart K. Schubert
    On Point-Based Temporal Disjointness. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:347-361 [Journal]
  11. Luc Lismont, Philippe Mongin
    A Non-Minimal But Very Weak Axiomatization of Common Belief. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:363-374 [Journal]
  12. Luc De Raedt, Saso Dzeroski
    First-Order jk-Clausal Theories are PAC-Learnable. [Citation Graph (4, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:375-392 [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