Joseph Y. Halpern Set-theoretic completeness for epistemic and conditional logic. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1999, v:26, n:1-4, pp:1-27 [Journal]
Peter Jonsson Strong bounds on the approximability of two Pspace-hard problems in propositional planning. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1999, v:26, n:1-4, pp:133-147 [Journal]
Daniel Frost, Rina Dechter Maintenance scheduling problems as benchmarks for constraint algorithms. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1999, v:26, n:1-4, pp:149-170 [Journal]
Zippora Arzi-Gonczarowski Perceive this as that - Analogies, artificial perception, and category theory. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1999, v:26, n:1-4, pp:215-252 [Journal]
Joseph Y. Halpern Errata: ``The relationship between knowledge, belief, and certainty''. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1999, v:26, n:1-4, pp:253-256 [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