T. Baumgartner, U. Furbach, and U. Petermann, A unified approach to theory reasoning. Research report, pp.15-92, 1992.

H. J. Burckert, A resolution principle for constraint logics. Artificial intelligence, pp.235-271, 1994.

K. L. Clark, H. Gallaire, and J. Minker, Negation as failure. Logic and Data bases, 1978.

A. Colmerauer, Total Precedence Relations, Journal of the ACM, vol.17, issue.1, pp.14-30, 1970.
DOI : 10.1145/321556.321559

A. Colmerauer, Equations and inequations on finite and infinite trees, Proc. of the Int. Conf. on the Fifth Generation of Computer Systems, pp.85-99, 1984.

A. Colmerauer, Prolog in 10 figures, Communications of the ACM, vol.28, issue.12, pp.1296-1310, 1985.
DOI : 10.1145/214956.214958

A. Colmerauer, A view of the origins and development of Prolog, Communications of the ACM. Vol, vol.31, pp.26-36, 1988.

A. Colmerauer, An introduction to Prolog III, Communication of the ACM, vol.33, issue.7, pp.68-90, 1990.

A. Colmerauer, Specification of Prolog IV, 1996.

A. Colmerauer and T. Dao, Expressiveness of full first-order constraints in the structure of finite or infinite trees, Constraints, vol.8, issue.3, pp.283-302, 2003.
DOI : 10.1023/A:1025675127871

T. Dao, Résolution de contraintes du premier ordre dans la théorie des arbres finis or infinis, Thèse d'informatique, 2000.

K. Djelloul and T. Dao, Extension of First-Order Theories into Trees
DOI : 10.1007/11856290_7

URL : https://hal.archives-ouvertes.fr/hal-00202317

K. Djelloul, Complete theories around trees, 2006.

K. Djelloul, About the Combination of Trees and Rational Numbers in a Complete First-Order Theory, Proceeding of the 5th Int. Conf. on Frontiers of Combining Systems FroCoS 2005, Vienna Austria. LNAI, pp.106-122
DOI : 10.1007/11559306_6

E. Domenjoud, F. Klay, and C. Ringeissen, Combination techniques for nondisjoint equational theories, proceedings of the 12th international conference on automated deduction, pp.267-281, 1994.

T. Fruehwirth and S. Abdelnnadher, Essentials of constraints programming, 2002.
DOI : 10.1007/978-3-662-05138-2

B. Gramlich, On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems, Theoretical Computer Science, vol.165, issue.1, pp.97-131, 1996.
DOI : 10.1016/0304-3975(96)00042-4

J. Jaffar and M. Maher, Constraint logic programing: a survey, Journal of logic programming, vol.1920, pp.503-581, 1994.

M. Maher, Complete axiomatization of the structure of finite, rational and infinite trees, 1988.

G. Nelson and D. Oppen, Simplification by Cooperating Decision Procedures, ACM Transactions on Programming Languages and Systems, vol.1, issue.2, pp.245-251, 1979.
DOI : 10.1145/357073.357079

G. Nelson, Combining satisfiability procedures by equality sharing Automated theorem proving: After 25 years, pp.201-211, 1984.

E. Ohelbush, Modular Properties of Composable Term Rewriting Systems, Journal of Symbolic Computation, vol.20, issue.1, pp.1-41, 1995.
DOI : 10.1006/jsco.1995.1036

D. Oppen, Complexity, convexity and combinations of theories, Theoretical Computer Science, vol.12, issue.3, 1980.
DOI : 10.1016/0304-3975(80)90059-6

C. Ringeissen, co-operation of decision procedure for the satisfiability problem, proceedings of the 1st international workshop on frontiers of combining systems, pp.121-140, 1996.

C. Ringeissen, Combinaison de resolution de contraintes, These de doctorat, 1993.

R. Shostak, A Practical Decision Procedure for Arithmetic with Function Symbols, Journal of the ACM, vol.26, issue.2, pp.351-360, 1979.
DOI : 10.1145/322123.322137

R. Shostak, Deciding Combinations of Theories, Journal of the ACM, vol.31, issue.1, pp.1-12, 1984.
DOI : 10.1145/2422.322411

C. Tinelli and C. Ringeissen, Unions of non-disjoint theories and combinations of satisfiability procedures, Theoretical Computer Science, vol.290, issue.1, pp.291-353, 2003.
DOI : 10.1016/S0304-3975(01)00332-2

URL : https://hal.archives-ouvertes.fr/inria-00099668

C. Tinelli and M. Harandi, A New Correctness Proof of the Nelson-Oppen Combination Procedure, proceedings of the 1st international workshop on frontiers of combining systems, pp.103-120, 1996.
DOI : 10.1007/978-94-009-0349-4_5