McIlraith, S., & Amir, E. (2001). Theorem proving with structured theories. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence
(IJCAI'01), pp. 624-631.

Papadimitriou, C. H. (1994). Computational Complexity. Addison-Wesley.

Parikh, R. (1996). Beliefs, belief revision, and splitting languages, pp. 266-268. Logic, Language and Computation. CSLI Publications.

Park, T. J., & Gelder, A. V. (1996). Partitioning methods for satisfiability testing on large formulas. In Proceedings of the Thirteenth International Conference on Automated Deduction (CADE'96), pp. 748-762.

Przymusinski, T. C. (1989). An algorithm to compute circumscription. Artificial Intelligence, 38, 49-73.

Reiter, R. (1987). A theory of diagnosis from first principles. Artificial Intelligence, 32, 57-95.

Rintanen, J. (2001). Partial implicit unfolding in the Davis-Putnam procedure for quantified boolean formulae. In Proceedings of the QBF2001 Workshop at IJCAR'01, pp. 84–93.

Ryan, M. D. (1991). Defaults and revision in structured theories. In Proceedings of the Sixth IEEE Symposium on Logic in Computer Science (LICS'91), pp. 362–373.

Ryan, M. D. (1992).  Ordered presentations of theories.  Ph.D. thesis, Imperial College, London.

Sandewall, E. (1995). Features and Fluents. Oxfor University Press. Siegel, P. (1987). Représentation et utilisation des connaissances en calcul propositionnel.

These d'Etat, Universite d'Aix-Marseille 2. (in french).

Simon, L., & del Val, A. (2001). Efficient consequence finding. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), pp.

359-365.

Subramanian, D., Greiner, R., & Pearl, J. (1997). Artificial Intelligence Journal: Special Issue on Relevance, 97 (1-2), 1997.

Tan, S., & Pearl, J. (1994). Specification and evaluation of preferences for planning under uncertainty. In Proceedings of the Fourth International Conference on the Principles of Knowledge Representation and Reasoning (KR'94).

Williams, P. F., Biere, A., Clarke, E. M., & Gupta, A. (2000). Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking. In Proceedings of the Twelfth International Conference on Computer Aided Verification (CAV'00).

Winslett, M. (1990). Updating Logical Databases. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press.