Journals in DBLP

ACM Trans. Comput. Log.
2005, volume: 6, number: 2

1. Chiaki Sakama
   Induction from answer sets in nonmonotonic logic programs. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Comput. Log., 2005, v:6, n:2, pp:203-231 [Journal]
   
2. Marco Cadoli, Thomas Eiter, Georg Gottlob
   Complexity of propositional nested circumscription and nested abnormality theories. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Comput. Log., 2005, v:6, n:2, pp:232-272 [Journal]
   
3. Orna Kupferman, Moshe Y. Vardi
   From linear time to branching time. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Comput. Log., 2005, v:6, n:2, pp:273-294 [Journal]
   
4. Kewen Wang, Lizhu Zhou
   Comparisons and computation of well-founded semantics for disjunctive logic programs. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Comput. Log., 2005, v:6, n:2, pp:295-327 [Journal]
   
5. Sara Cohen, Yehoshua Sagiv, Werner Nutt
   Equivalences among aggregate queries with negation. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Comput. Log., 2005, v:6, n:2, pp:328-360 [Journal]
   
6. Konstantin Korovin, Andrei Voronkov
   Knuth-Bendix constraint solving is NP-complete. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Comput. Log., 2005, v:6, n:2, pp:361-388 [Journal]
   
7. Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits
   Reasoning about evolving nonmonotonic knowledge bases. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Comput. Log., 2005, v:6, n:2, pp:389-440 [Journal]
   
8. Panos Rondogiannis, William W. Wadge
   Minimum model semantics for logic programs with negation-as-failure. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Comput. Log., 2005, v:6, n:2, pp:441-467 [Journal]
   
9. Klaus Aehlig, Jan Johannsen
   An elementary fragment of second-order lambda calculus. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Comput. Log., 2005, v:6, n:2, pp:468-480 [Journal]