Dominance constraints in stratified context unification

Information Processing Letters

Volumn 101, Issue 4, 2007, Pages 141-147

  Erk, Katrin ^b   Niehren, Joachim ^a  

^a INRIA   (France)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Computational logics; Formal languages; Trees; Unification

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FORMAL LANGUAGES; TREES (MATHEMATICS);

COMPUTATIONAL LOGICS; DOMINANCE CONSTRAINTS; STRATIFIED CONTEXT UNIFICATION;

CONTEXT FREE LANGUAGES;

EID: 33845393320     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.09.009     Document Type: Article

References (23)

1. M. Bodirsky, D. Duchier, S. Miele, J. Niehren, A new algorithm for normal dominance constraints, in: ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 54-78
2. H. Comon, Completion of rewrite systems with membership constraints, in: International Colloquium on Automata, Languages and Programming, 1992, pp. 392-403
3. Comon H., Dauchet M., Gilleron R., Jacquemard F., Lugiez D., Tison S., and Tommasi M. Tree automata techniques and applications. Available online at (1997). http://www.grappa.univ-lille3.fr/tata
4. Duchier D., and Gardent C. Tree descriptions, constraints and incrementality. Computing Meaning 2. Linguistics and Philosophy vol. 77 (2001) 205-227
5. Egg M., Koller A., and Niehren J. The constraint language for lambda structures. Journal of Logic, Language and Information 10 (2001) 457-485
6. E. Filiot, J. Niehren, J.-M. Talbot, S. Tison, On XPath dialects with variables, 2006
7. G. Gottlob, C. Koch, Monadic queries over tree-structured data, in: 17th Annual IEEE Symposium on Logic in Computer Science, 2002, pp. 189-202
8. G. Gottlob, C. Koch, K. U. Schulz, Conjunctive queries over trees, in: 23rd ACM Symposium on Principles of Database Systems, 2004, pp. 189-200
9. Koller A., Niehren J., and Treinen R. Dominance constraints: Algorithms. 3rd International Conference on Logical Aspects of Computational Linguistics (1998). Lecture Notes in Comput. Sci. vol. 2014 (2001), Springer, Berlin 106-125
10. Levy J. Linear second order unification. 7th Int. Conference on Rewriting Techniques and Applications. Lecture Notes in Comput. Sci. vol. 1103 (1996), Springer, Berlin 332-346
11. Libkin L. Logics over unranked trees: an overview. Logical Methods in Computer Science 3 2 (2006) 1-31
12. Levy J., Niehren J., and Villaret M. Well-nested context unification. 20th Internat. Conference on Automated Deduction. Lecture Notes in Artificial Intelligence vol. 3632 (2005) 149-163
13. Levy J., Schmidt-Schauss M., and Villaret M. Stratified context unification is NP-complete. 3rd International Joint Conference on Automated Reasoning. Lecture Notes in Comput. Sci. vol. 4130 (2006), Springer, Berlin 82-96
14. Makanin G. The problem of solvability of equations in a free semigroup. Soviet Akad. Nauk SSSR 223 2 (1977)
15. M.P. Marcus, D. Hindle, M.M. Fleck, D-theory: Talking about talking about trees, in: 21st Meeting of the Assoc. of Computational Linguistics, 1983, pp. 129-136
16. Marx M. Conditional XPath. ACM Transactions on Database Systems 30 4 (2005) 929-959
17. Niehren J., and Koller A. Dominance constraints in context unification. 3rd International Conference on Logical Aspects of Computational Linguistics (1998). Lecture Notes in Comput. Sci. vol. 2014 (2001), Springer, Berlin 199-218
18. Niehren J., Treinen R., and Tison S. On rewrite constraints and context unification. Information Processing Letters 74 1-2 (2000) 35-40
19. Rogers J., and Vijay-Shanker K. Extracting trees from their descriptions: an application to tree-adjoining grammars. Computational Intelligence 10 4 (1994) 401-421
20. Schmidt-Schauss M. A decision algorithm for stratified context unification. Journal of Logic and Computation 12 6 (2002) 929-953
21. Schmidt-Schauss M., and Schulz K.U. Solvability of context equations with two context variables is decidable. Journal of Symbolic Computation 33 1 (2002) 77-122
22. Schmidt-Schauß M., and Schulz K.U. On the exponent of periodicity of minimal solutions of context equation. 9th RTA. Lecture Notes in Comput. Sci. vol. 1379 (1998), Springer, Berlin 61-75
23. Thatcher J.W., and Wright J.B. Generalized finite automata with an application to a decision problem of second-order logic. Mathematical System Theory 2 (1968) 57-82