1. F. Baader and J.H. Siekmann, Unification theory, in: Handbook of Logic in Artificial Intelligence and Logic Programming, eds. D.M. Gabbay, C.J. Hogger and J.A. Robinson (1994) pp. 41–125.
2. M. Cadoli, A. Giovanardi and M. Schaerf, An algorithm to evaluate quantified Boolean formulae, in: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI’98) (1998) pp. 262-267.
3. R. Caferra and N. Peltier, Decision procedures using model building techniques, in: Proceedings of the 9th International Workshop for Computer Science Logic (CSL’95), ed. H. Kleine Büning, Lecture Notes in Computer Science, Vol. 1092 (1996) pp. 130–144.
4. R. Caferra and N. Zabel, Extending resolution for model construction, in: Logics in Artificial Intelligence (JELIA’90), Proceedings, ed. J. van Eijck, Lecture Notes in Computer Science, Vol. 478 (1991) pp. 153–169.
5. A. Colmerauer, Equations and inequations on finite and infinite trees, in: Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS’84) (1984) pp. 85–99.