European Workshop JELIA'94 , No. 838 in Lecture Notes in Artificial Intelligence, pp.

247 260 York, England. Springer-Verlag.

Brewka, G., & Eiter, T. (1998). Preferred answer sets for extended logic programs. In Cohn, A. G., Schubert, L. K., & Shapiro, S. C. (Eds.), Principles of Knowledge Representation and Reasoning:  Proceedings of the Sixth International Conference (KR
'98), pp. 86  97 Trento, Italy. Morgan Kaufinann Publishers.

Buccafurri, F., Leone, N., & Rullo, P. (1998).  Disjunctive ordered logic: semantics and expressiveness. In Cohn, A. G., Schubert, L. K., & Shapiro, S. C. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), pp. 418–429 Trento, Italy. Morgan Kaufmann Publishers.

Delgrande, J. P., & Schaub, T. H. (1997). Compiling reasoning with and about preferences into default logic. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, pp. 168 174 Nagoya, Japan. Morgan Kaufmann Publishers.

Dowling, W. F., & Gallier, J. H. (1984). Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 1 (3), 267  284.

Etherington, D. W. (1987). Formalizing nonmonotonic reasoning systems. Artificial Intelligence, 31 (1), 41  85. Errata in volume 34 (3), page 395.

Even, S., Itai, A., & Shamir, A. (1976).  On the complexity of timetable and multicommodity flow problems. SIAM Journal of Computing, 5 (4), 691 703.

Geffner, H., & Pearl, J. (1992). Conditional entailment: bridging two approaches to default reasoning. Artificial Intelligence, 53 (2-3), 209 244.

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

Horty, J. F. (1994). Some direct theories of nonmonotonic inheritance. In Gabbay, D. M.,
Hogger, C. J., & Robinson, J. A. (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming: Nonmonotonic Reasoning and Uncertain Reasoning, Vol. 3, p. 111 187. Clarendon Press, Oxford.

Kautz, H., & Selman, B. (1991). Hard problems for simple default theories. Artificial Intelligence, 49 (1-3), 243 279.

Krentel, M. W. (1992). Generalizations of Opt P to the polynomial hierarchy. Theoretical Computer Science, 97 (2), 183 198.

Lifschitz, V. (1985). Computing circumscription. In Joshi, A. (Ed.), Proceedings of the 9th International Joint Conference on Artificial Intelligence, pp. 121 127 Los Angeles.

Morgan Kaufmann Publishers.

Marek, V. W., & Truszczy´nski, M. (1993). Nonmonotonic Logic: Context-Dependent Reasoning.  Springer-Verlag, Berlin,