, Principles of constraint programming, 2003.
DOI : 10.1017/CBO9780511615320
, Negation as Failure, Logic and Data bases. Ed Gallaire, H. and Minker, 1978.
DOI : 10.1007/978-1-4684-3384-5_11
, Expressiveness of full firstorder constraints in the algebra of finite or infinite trees, Constraints, vol.8, issue.3, pp.283-302, 2003.
DOI : 10.1023/A:1025675127871
URL : https://hal.archives-ouvertes.fr/hal-00144931
, Resolution de contraintes du premier ordre dans la theorie des arbres finis ou infinis, Thèse d'informatique, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00144920
, Theory of finite or infinite trees revisited Theory and practice of logic programming (TPLP), 2008.
, Decomposable theories Theory and practice of logic programming (TPLP), pp.583-632, 2007.
, Extension into trees of firstorder theories, Proc of AISC'06 The 8th International Conference on Artificial Intelligence and Symbolic Computation. LNAI, pp.53-67, 2006.
, About the Combination of Trees and Rational Numbers in a Complete First-Order Theory, Proc of FroCoS'05 the 5th International Workshop on Frontiers of Combining Systems. LNAI, pp.106-122, 2005.
DOI : 10.1007/11559306_6
, Essentials of Constraint Programming, 2003.
DOI : 10.1007/978-3-662-05138-2
, Complete axiomatizations of the algebras of finite, rational and infinite trees, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, pp.348-357, 1988.
DOI : 10.1109/LICS.1988.5132
, A decision procedure for term algebras with queues, ACM Transactions on Computational Logic, vol.2, issue.2, pp.155-181, 2001.
DOI : 10.1145/371316.371494
, A Categorial Approch to the Theory of Lists, Proc of Mathematics of Program Construction, 375th Anniversary of the Groningen University, International Conference, pp.399-408, 1989.
, An improved lower bound for the elementary theories of trees, Proc of CADE'96 the 13th International Conference on Automated Deduction. LNAI, pp.275-287, 1996.
DOI : 10.1007/3-540-61511-3_91