1. R. Ben-Eliyahu and L. Palopoli, Reasoning with minimal models: Efficient algorithms and applications, in:KR-94: Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning, eds. J. Doyle, E. Sandewall and P. Torasso (Morgan-Kaufmann, San Francisco, CA, 1994) pp. 39–50.
2. C. Beeri, R. Fagin, D. Maier and M. Yannakakis, On the desirability of acyclic database schemes,J. ACM 30(3) (1983) 479–513.
3. C. Bell, A. Nerode, R.T. Ng and V.S. Subrahmanian, Computation and implementation of nonmonotonic deductive databases, Technical Report CS-TR-2801, University of Maryland (1991).
4. M. Cadoli, On the complexity of model finding for nonmonotonic propositional logics, in:Proceedings of the 4th Italian Conference on Theoretical Computer Science, eds. A.M. Spaccamela, P. Mentrasti and M. Venturini Zilli (World Scientific Publishing Co., October 1992) pp. 125–139.
5. R. Dechter and A. Dechter, Structure-driven algorithms for truth maintenance, Technical Report R-182, Cognitive Systems Laboratory, Computer Science Department, UCLA (August 1994). A preliminary version in:AAAI-88: Proceedings of 7th National Conference on Artificial Intelligence, under the title “Belief maintenance in dynamics constraint networks”.