1. K.R. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in:Foundations of Deductive Databases and Logic Programs, ed. Jack Minker (Morgan Kaufmann, 1988) pp. 89?148.
2. S. Arnborg, D.G. Corneil and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Algeb. Disc. Meth. 8(2) (1987) 277?284.
3. R. Ben-Eliyahu and R. Dechter, Default logic, propositional logic and constraints, in:AAAI-91: Proc. 9th Nat. Conf. on Artificial Intelligence (Anaheim, CA, USA, July 1991) pp. 379?385. Full version submitted for journal publication.
4. R. Ben-Eliyahu and R. Dechter, Inference in inheritance networks using propositional logic and constraints networks techniques, in:AI-92: Proc. 9th Canadian Conf. on AI (Vancouver, B.C., Canada, May 1992) pp. 183?189.
5. N. Bidoit and C. Froidevaux, Minimalism subsumes default logic and circumscription in stratified logic programming, in:LICS-87: Proc. IEEE Symp. on Logic in Computer Science (Ithaca, NY, USA, June 1987) pp. 89?97.