Gottlob, G. (1992). Complexity results for nonmonotonic logics. J. of Logic and Computation, 2, 397 425.

Gottlob, G. (1995). NP trees and Carnap's modal logic. J. of the ACM, 42(2), 421 457. Halpern, J. Y., & Moses, Y. (1985). Towards a theory of knowledge and ignorance: Preliminary report. In Apt, K. (Ed.), Logic and models of concurrent systems. Springer¬
Verlag .

Halpern, J. Y., & Moses, Y. (1992). A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54, 319 379.

Inoue, K., & Sakama, C. (1994). On positive occurrences of negation as failure. In Proc.

of the 4th Int. Conf. on the Principles of Knowledge Representation and Reasoning
(KR'94), pp. 293 304. Morgan Kaufmann, Los Altos.

Janhunen, T. (1998). On the intertranslatability of autoepistemic, default and priority logics. In Proc. of the 6th European Workshop on Logics in Artificial Intelligence
(JELIA'98), pp. 216 232.

Johnson, D. S. (1990). A catalog of complexity classes. In van Leuven, J. (Ed.), Handbook of Theoretical Computer Science, Vol. A, chap. 2. Elsevier Science Publishers (North-
Holland), Amsterdam.

Kaminski, M. (1991). Embedding a default system into nonmonotonic logics.  Fundamenta Informaticae, 14, 345 354.

Levesque, H. J. (1990). All I know: a study in autoepistemic logic. Artificial Intelligence, 42, 263 310.

Lifschitz, V., & Woo, T. (1992). Answer sets in general nonmonotonic reasoning (preliminary report). In Proc. of the Srd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'92), pp. 603 614. Morgan Kaufmann, Los Altos.

Lifschitz, V. (1991). Nonmonotonic databases and epistemic queries. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91), pp. 381 386.

Lifschitz, V. (1994). Minimal belief and negation as failure. Artificial Intelligence, 70, 53 72.

Lin, F., & Shoham, Y. (1992). Epistemic semantics for fixed-point non-monotonic logics.

Artificial Intelligence, 57, 271 289.

Marek, W., & Truszczynski, M. (1993). Nonmonotonic Logics Context-Dependent Reasoning. Springer-Verlag.

Marek, W., Truszczynski, M., & Rajasekar, A. (1995).  Complexity of computing with extended propositional logic programs. Annals of Mathematics and Artificial intelligence, 15 (3,4).