&. A¨?ta¨?t-kaci, R. &. Nasr-]-hassan-a¨?ta¨?t-kaci, and . Nasr, Login: a logic programming language with built-in inheritance, The Journal of Logic Programming, vol.3, issue.3, pp.185-215, 1986.
DOI : 10.1016/0743-1066(86)90013-0

&. A¨?ta¨?t-kaci, A. &. Podelski-]-hassan-a¨?ta¨?t-kaci, and . Podelski, Towards a meaning of life, The Journal of Logic Programming, vol.16, pp.3-4195, 1993.

. A¨?ta¨?t-kaci, A feature constraint system for logic programming with entailment, Theoretical Computer Science, vol.122, issue.1-2, pp.263-283, 1994.
DOI : 10.1016/0304-3975(94)90209-7

&. Backofen, &. Smolka-]-rolf-backofen, and . Smolka, A complete and recursive feature theory, Theoretical Computer Science, vol.146, issue.1-2, pp.243-268, 1995.
DOI : 10.1016/0304-3975(94)00188-O

&. Brachman, . Levesque, J. Ronald, &. Brachman, . J. Hector et al., The tractability of subsumption in frame-based description languages, Proceedings of the National Conference on Artificial Intelligence, pp.34-37, 1984.

]. J. Doner, Tree acceptors and some of their applications, Journal of Computer and System Sciences, vol.4, issue.5, pp.406-451, 1970.
DOI : 10.1016/S0022-0000(70)80041-1

&. Kaplan, . Bresnan, M. Ronald, &. Kaplan, and . Bresnan, Lexical-functional grammar: A formal system for grammatical representation The Mental Representation of Grammatical Relations, pp.173-281, 1982.

]. Kay, Functional Grammar, Proceedings of the 5 th Annual Meeting of the Berkeley Linguistics Society, pp.142-158, 1979.
DOI : 10.3765/bls.v5i0.3262

. Müller, Ordering constraints over feature trees, Constraints, an International Journal, vol.5, issue.12, 2000.
DOI : 10.1007/BFb0017447

]. Mukai, Partially specified terms in logic programming for linguistic analysis, Proceedings of the 6 th International Conference on Fifth Generation Computer Systems, 1988.

&. Müller, &. Niehren-]-martin-müller, and . Niehren, Ordering constraints over feature trees expressed in second-order monadic logic, International Conference on Rewriting Techniques and Applications, pp.196-210, 1998.
DOI : 10.1007/BFb0052371

. Müller, The first-order theory of ordering constraints over feature trees, Proceedings of the 13 th IEEE Symposium on Logic in Computer Science, pp.432-443, 1998.

. Müller, The first-order theory of ordering constraints over feature trees, 1998.

M. Müller and . Müller, Ordering constraints over feature trees with ordered sorts, Computational Logic and Natural Language Understanding

&. Nebel and G. Smolka, Representation and reasoning with attributive descriptions, Sorts and Types in Artificial Intelligence, pp.112-139, 1990.
DOI : 10.1007/3-540-52337-6_21

]. Nebel, Reasoning and Revision in Hybrid Representation Systems, Lecture Notes in Artificial Intelligence, vol.422, 1990.

&. Pollard and . Sag, Carl Pollard & Ivan Sag. Head-Driven Phrase Structure Grammar . Studies in Contemporary Linguistics, 1994.

O. Michael and . Rabin, Decidability of second-order theories and automata on infinite trees. Transactions of the, pp.1-35, 1969.

. Shieber, The formalism and implementation of PATR-II, Research on Interactive Acquisition and Use of Knowledge. SRI International, 1983.

]. Shieber, An Introduction to Unification-based Approaches to Grammar. CSLI Lecture Notes No, Center for the Study of Language and Information, 1986.

&. Smolka, G. Treinen, R. Smolka, and . Treinen, Records for logic programming, The Journal of Logic Programming, vol.18, issue.3, pp.229-258, 1994.
DOI : 10.1016/0743-1066(94)90044-2

G. Smolka, The Oz Programming Model, Computer Science Today Lecture Notes in Computer Science, vol.1000, pp.324-343, 1995.
DOI : 10.1007/BFb0015252

&. Thatcher, ]. J. Wright, &. J. Thatcher, and . Wright, Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical Systems Theory, vol.12, issue.1, pp.57-81, 1968.
DOI : 10.1007/BF01691346

]. Thomas, Automata on infinite objects Handbook of Theoretical Computer Science, volume B (Formal Models and Semantics), chapter 4, pp.133-191, 1990.

S. Vorobyov, An improved lower bound for the elementary theories of trees, Proceedings of the Conference on Automated Deduction, pp.275-287, 1996.
DOI : 10.1007/3-540-61511-3_91