Ordering constraints over feature trees expressed in second-order monadic logic

Information and Computation

Volumn 159, Issue 1-2, 2000, Pages 22-58

  Müller, Martin ^a   Niehren, Joachim ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Complexity; Decidability; Entailment; Feature logic; Second order monadic logic; Tree orderings

Indexed keywords

COMPUTATIONAL COMPLEXITY; THEOREM PROVING; TREES (MATHEMATICS);

FEATURE LOGIC;

COMPUTATIONAL METHODS;

EID: 0034713207     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2878     Document Type: Article

References (38)

1. Aït-Kaci, Hassan, and Nasr, Roger (1986), A logic programming language with built-in inheritance, J. Logic Programming 3, 185-215.
2. Aït-Kaci, Hassan, and Podelski, Andreas (1993), Towards a meaning of life, J. Logic Programming 16, 195-234.
3. Aït-Kaci, Hassan, Podelski, Andreas, and Smolka, Gert (1994), A feature-based constraint system for logic programming with entailment, Theoret. Comput. Sci 122, 263-283.
4. Aït-Kaci, Hassan (1986), An algebraic semantics approach to the effective resolution of type equations, Theoret. Comput. Sci. 45, 293-351.
5. Backofen, Rolf, and Smolka, Gert (1995), A complete and recursive feature theory, Theoret. Comput. Sci. 146, 243-268.
6. Backofen, Rolf (1994), "Expressivity and Decidability of First-order Languages over Feature Trees," Doctoral Dissertation, Universität des Saarlandes, Technische Fakultät, D-66041 Saarbrücken.
7. Backofen, Rolf (1995), A complete axiomatization of a theory with feature and arity constraints, J. Logic Programming 24, 37-71. [Special Issue on Computational Linguistics and Logic Programming]
8. Brachman, Ronald J., and Levesque, Hector J. (1984), The tractability of subsumption in frame-based description languages, in "Proceedings of the National Conference on Artificial Intelligence," pp. 34-37.
9. Carpenter, Bob (1992), "The Logic of Typed Feature Structures," Cambridge Tracts in Theoretical Computer Science, Vol. 32, Cambridge University Press, Cambridge, UK.
10. nd International Conference on Fifth Generation Computer Systems," pp. 85-99, Omsha, Tokyo and North-Holland, Amsterdam.
11. Comon, Hubert, Dauchet, Max, Gilleron, Remi, Lugiez, Denis, Tison, Sophie, and Tommasi, Marc (1998), "Tree automata: Techniques and Applications," book draft. [http://www.grappa.univ-lille3.fr/tata].
12. th IEEE Symposium on Logic in Computer Science," San Diego, June 1995, pp. 508-517, IEEE Computer Society Press, Los Alamitos, CA.
13. Doner, J. (1970), Tree acceptors and some of their applications, J. Comput. Systems Sci. 4, 406-451.
14. Dörre, Jochen, and Rounds, William C. (1992), On subsumption and semi-unification in feature algebras, J. Symbolic Comput. 13, 441-461.
15. Dörre, Jochen (1991), Feature logics with weak subsumption constraints, in "Annual Meeting of the Association of Computational Linguistics," pp. 256-263.
16. Dörre, Jochen (1993), "Feature-Logik und Semiunfikation," Ph.D. thesis, Philosophische Fakultät der Universität Stuttgart. [In German]
17. Gecseg, F., and Steinby, M. (1984), "Tree Automata," Akad. Kiado, Budapest.
18. Kaplan, Ronald M., and Bresnan, Joan (1982), Lexical-functional grammar: A formal system for grammatical representation, in "The Mental Representation of Grammatical Relations" (J. Bresnan, Ed.), pp. 173-281, MIT Press, Cambridge, MA.
19. Kay, Martin (1979), Functional grammar, in "Proceedings of the 5th Annual Meeting of the Berkeley Linguistics Society" (C. Chiarello et al., Eds.), pp. 142-158.
20. Mukai, Kuniaki (1988), Partially specified terms in logic programming for linguistic analysis, in "Proceedings of the 6th International Conference on Fifth Generation Computer Systems, Tokyo, Japan."
21. Müller, Martin, Niehren, Joachim, and Podelski, Andreas (2000), Ordering constraints over feature trees, Constraints 5. [Special Issue on CP'97, Linz, Austria]
22. Müller, Martin, and Niehren, Joachim (1998), Ordering constraints over feature trees expressed in second-order monadic logic, in "Tobias Nipkow, editor, International Conference on Rewriting Techniques and Applications, Tsukuba, Japan," Lecture Notes in Computer Science, Vol. 1379, pp. 196-210, Springer-Verlag, Berlin.
23. Müller, Martin, Niehren, Joachim, and Treinen, Ralf (1998), The first-order theory of ordering constraints over feature trees, in "Proceedings of the 13th IEEE Symposium on Logic in Computer Science," pp. 432-443, IEEE Computer Society Press, Los Alamitos, CA.
24. Müller, Martin, Niehren, Joachim, and Treinen, Ralf (2000), The first-order theory of ordering constraints over feature trees. Accepted in Discrete Math. Theor. Comput. Sci.
25. Müller, Martin (1998), Ordering Constraints over Feature Trees with Ordered Sorts, in "Computational Logic and Natural Language Understanding." Technical Report, Programming Systems Lab., Universität des Saarlandes. [Available at http://www.ps.uni-sb.de/~mmueller/papers/clnlp.ps.Z]
26. Nebel, Bernhard, and Smolka, Gert (1990), Representation and reasoning with attributive descriptions, in "Sorts and Types in Artificial Intelligence" (K. H. Bläsius, U. Hedtstück, and C.-R. Rollinger, Eds.), Lecture Notes in Artificial Intelligence, Vol. 418, pp. 112-139, Springer-Verlag, Berlin.
27. Nebel, Bernhard (1990), "Reasoning and Revision in Hybrid Representation Systems," Lecture Notes in Artificial Intelligence, Vol. 422, Springer-Verlag, Berlin.
28. Pollard, C., and Sag, Ivan (1994), "Head-Driven Phrase Structure Grammar," Studies in Contemporary Linguistics, Cambridge University Press, Cambridge, England.
29. Rabin, Michael O. (1969), Decidability of second-order theories and automata on infite trees, Trans. Amer. Math. Soc. 141, 1-35.
30. Rounds, William C. (1997), Feature logics, in "Handbook of Logic and Language" (J. van Benthem and A. ter Meulen, Eds.), pp. 475-533, Elsevier Science, North-Holland, Amsterdam. Part 2: General Topics.
31. Shieber, Steward, Uszkoreit, Hans, Pereira, Fernando, Robinson, J. Alan, and Tyson, M (1983), The formalism and implementation of PATR-II, in "Research on Interactive Acquisition and Use of Knowledge" (Joan Bresnan, Ed.), SRI International, Menlo Park, CA.
32. Shieber, Steward (1986), "An Introduction to Unification-based Approaches to Grammar," CSLI Lecture Notes No. 4. Center for the Study of Language and Information.
33. Smolka, Gert, and Treinen, Ralf (1994), Records for logic programming, J. Logic Programming 18, 229-258.
34. Smolka, Gert (1995), The Oz programming model, in "Computer Science Today" (Jan van Leeuwen, Ed.), Vol. 1000, Lecture Notes in Computer Science, pp. 324-343, Springer-Verlag, Berlin.
35. Thatcher, J. W., and Wright, J. B. (1968), Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Systems Theory 2, 57-81.
36. Thomas, Wolfgang (1990), Automata on infinite objects, in "Handbook of Theoretical Computer Science" (Jan van Leeuwen, Ed.), Vol. B, Formal Models and Semantics, Chap. 4, pp. 133-191, The MIT Press, Cambridge, MA.
37. Thomas, Wolfgang (1997), Languages, automata, and logic, in "Handbook of Formal Languages" (Grzegorz Rozenberg and Arto Salomaa, Ed.), Vol. 3, Springer-Verlag, Berlin.
38. Vorobyov, Sergei (1996), An improved lower bound for the elementary theories of trees, in "Proceedings of the Conference on Automated Deduction, Rutgers, NJ," Lecture Notes in Computer Science, Vol. 1104, pp. 275-287, Springer-Verlag, Berlin.