Alternation.

@article{DBLP:journals/jacm/ChandraKS81,
  author    = {Ashok K. Chandra and
               Dexter Kozen and
               Larry J. Stockmeyer},
  title     = {Alternation},
  journal   = {J. ACM},
  volume    = {28},
  number    = {1},
  year      = {1981},
  pages     = {114-133},
  ee        = {db/journals/jacm/ChandraKS81.html, http://doi.acm.org/10.1145/322234.322243},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Online Edition

Referenced by

1. Georg Gottlob, Nicola Leone, Francesco Scarcello: Hypertree Decompositions and Tractable Queries. PODS 1999: 21-32
2. Anthony J. Bonner: Workflow, Transactions, and Datalog. PODS 1999: 294-305
3. Nicholas Q. Trân, Rajiv Bagai: Infinite Relations in Paraconsistent Databases. ADBIS 1999: 275-287
4. Sergei G. Vorobyov, Andrei Voronkov: Complexity of Nonrecursive Logic Programs with Complex Values. PODS 1998: 244-253
5. Ron van der Meyden: The Complexity of Querying Indefinite Data about Linearly Ordered Domains. PODS 1992: 331-345
6. Surajit Chaudhuri, Moshe Y. Vardi: On the Equivalence of Recursive and Nonrecursive Datalog Programs. PODS 1992: 55-66
7. Anthony J. Bonner: The Complexity of Reusing and Modifying Rulebases. PODS 1992: 316-330
8. Ron van der Meyden: Recursively Indefinite Databases. ICDT 1990: 364-378
9. V. S. Lakshmanan, Alberto O. Mendelzon: Inductive Pebble Games and the Expressive Power of Datalog. PODS 1989: 301-310
10. Jeffrey D. Ullman, Moshe Y. Vardi: The Complexity of Ordering Subgoals. PODS 1988: 74-81
11. Gabriel M. Kuper, Moshe Y. Vardi: On the Complexity of Queries in the Logical Data Model (Extended Abstract). ICDT 1988: 267-280
12. Anthony J. Bonner: Hypothetical Datalog: Complexity and Expressiblity. ICDT 1988: 144-160
13. Paris C. Kanellakis: Logic Programming and Parallel Complexity. ICDT 1986: 1-30
14. Christos H. Papadimitriou, Mihalis Yannakakis: The Complexity of Reliable Concurrency Control. PODS 1985: 230-234