1. C. Baral, J. Lobo and J. Minker, Generalized well-founded semantics for logic programs: in:Proc. 10th Int. Conf. on Automated Deduction, ed. M.E. Stickel, Kaiserslautern, Germany (Springer, 1990) pp. 102?116.
2. C. Baral and V.S. Subrahmanian, Stable and extension class theory for logic programs and default logics, Technical Report CS-TR-2402, Dept of Computer Science, University of Maryland (February 1990), presented at the3rd Int. Workshop on Non-Monotonic Reasoning, South Lake Tahoe (May 90), extended version to appear in J. Auto. Reasoning.
3. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming: inProc. Int. Conf. and Symp. on Logic Programming, eds. R.A. Kowalski and K.A. Bowen, Seattle, Washington (1988) pp. 1070?1080.
4. R.A. Kowalski and D. Kuehner, Linear resolution with selection function, Art. Int. 2 (1971) 227?260.
5. J.W. Lloyd,Foundations of Logic Programming (Springer, 1984).