Moore, R. C. (1985). Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25, 75 94.

Niemela, I. (1992). On the decidability and complexity of autoepistemic reasoning. Fundamenta Informaticae, 17 (1,2), 117 156.

Papadimitriou, C. H. (1994). Computational Complexity. Addison Wesley Publ. Co., Reading, Massachussetts.

Reiter, R. (1990). What should a database know?. J. of Logic Programming, 14, 127 153.

Rosati, R. (1997). Reasoning with minimal belief and negation as failure: Algorithms and complexity. In Proc. of the 14th Nat. Conf. on Artificial Intelligence (AAAI'97), pp.

430 435. AAAI Press/The MIT Press.

Rosati, R. (1999). Reasoning about minimal knowledge in nonmonotonic modal logics. J.

of Logic, Language and Information, 8 (2), 187 203.

Schwarz, G. (1991). Autoepistemic logic of knowledge. In Proc. of the 1st Int. Workshop on Logic Programming and Non-monotonic Reasoning (LPNMR'91), pp. 260 274. The MIT Press.

Schwarz, G. (1992). Minimal model semantics for nonmonotonic modal logics. In Proc.

of the Th IEEE Sym. on Logic in Computer Science (LICS'92), pp. 34 43. IEEE Computer Society Press.

Schwarz,  G. (1996).  On embedding default logic into Moore's autoepistemic logic.  Artificial Int elligence, 80, 388 392.

Schwarz, G., & Lifschitz, V. (1993). Extended logic programs as autoepistemic theories. In Proc. of the 2nd Int. Workshop on Logic Programming and Non-monotonic Reasoning
(LPNMR'93), pp. 101 114. The MIT Press.

Schwarz, G., & Truszczyński, M. (1994). Minimal knowledge problem: a new approach.

Artificial Intelligence, 67, 113 141.

Shoham, Y. (1987). Nonmonotonic logics: Meaning and utility. In Proc. of the 10th Int.

Joint Conf. on Artificial Intelligence (IJCAI'87), pp. 388 392.

Stalnaker, R. (1993). A note on non-monotonic modal logic. Artificial Intelligence, 64 (2),
183 196.