H. Aït-kaci, A. Podelski, and G. Smolka, A feature-based constraint system for logic programming with entailment. Theor, Comput. Sci, vol.122, issue.1-2, pp.263-283, 1994.

M. Bach, The Design of the UNIX Operating System, 1986.

R. Backofen, A complete axiomatization of a theory with feature and arity constraints, Journal of Logic Programming, vol.24, issue.1&2, pp.37-71, 1995.

R. Backofen and G. Smolka, A complete and recursive feature theory, Theor. Comput. Sci, vol.146, issue.1-2, pp.243-268, 1995.

R. Backofen and R. Treinen, How to win a game with features, Information and Computation, vol.142, issue.1, pp.76-101, 1998.

H. Comon and P. Lescanne, Equational problems and disunification, Journal of Symbolic Computation, vol.7, pp.371-425, 1989.
URL : https://hal.archives-ouvertes.fr/inria-00075652

, Debian Policy Mailing List: Debian Policy Manual, 2017.

N. Dershowitz and Z. Manna, Proving termination with multiset orderings, Communication of the ACM, vol.22, issue.8, pp.465-476, 1979.

W. Hodges, Model Theory, Encyclopedia of Mathematics and its Applications, vol.42, 1993.

N. Jeannerod, C. Marché, and R. Treinen, A formally verified interpreter for a shelllike programming language, Verified Software. Theories, Tools, and Experiments, vol.10712, pp.1-18, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01534747

N. Jeannerod and R. Treinen, Deciding the first-order theory of an algebra of feature trees with updates, IJCAR'18, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01807474

M. J. Maher, Complete axiomatizations of the algebras of finite, rational and infinite trees, LICS, pp.348-357, 1988.

A. I. Malc'ev, Axiomatizable classes of locally free algebras of various type, The Metamathematics of Algebraic Systems: Collected Papers, pp.262-281, 1936.

G. Smolka, Feature constraint logics for unification grammars, Journal of Logic Programming, vol.12, pp.51-87, 1992.

G. Smolka and R. Treinen, Records for logic programming, Journal of Logic Programming, vol.18, issue.3, pp.229-258, 1994.

R. Treinen, Feature constraints with first-class features, Mathematical Foundations of Computer Science, vol.711, pp.734-743, 1993.

R. Treinen, Feature trees over arbitrary structures, Specifying Syntactic Structures, pp.185-211, 1997.

S. Vorobyov, An improved lower bound for the elementary theories of trees, CADE'96, vol.1104, pp.275-287, 1996.