Grid structures and undecidable constraint theories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1214, Issue , 1997, Pages 357-368

  Seynhaeve, Franck ^a   Tommasi, Marc ^a   Treinen, Ralf ^b  

^a UNIV LILLE   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY;

EQUALITY TESTS; FINITE GRID; FORBIDDEN PATTERN; GRID STRUCTURES; REWRITE SYSTEMS; SET CONSTRAINTS; UNDECIDABILITY;

SOFTWARE DESIGN;

EID: 84956969212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030610     Document Type: Conference Paper

References (24)

1. A. Aiken, D. Kozen, and E. Wimmers. Decidability of systems ofset constraints with negative constraints. Information and Computation, 122(1):30-44, Oct. 1995.
2. B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In Lectures Notes in Computer Science, volume 577, pages 161-171, Paris, 1992. Symposium on Theoretical Aspects of Computer Science.
3. A. Caron, H. Comon, J. Coquidé, M. Dauchet, and F. Jacquemard. Pumping, cleaning and symbolic constraints solving. In Lectures Notes in Computer Science volume 820, pages 436-449, Jerusalem, july 1994. 21st international colloquium on Automata, Languages and Programming.
4. W. Charatonik and L. Pacholski. Set constraints with projections are in NEXP- TIME. In IEEE, editor, Proc. 35 th Symp. Foundations of Computer Science, pages 642-653, 1994.
5. H. Comon, M. Haberstrau, and J.-P. Jouannaud. Syntacticness, cycle-syntacticness and shallow theories. Information and Computation, 111(1):154-191, May 1994.
6. B. Courcelle. The monadic second-order logic of graphs I. recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990.
7. R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints with negated subset relationships. In Proceedings of the 34th Symp. on Foundations of Computer Science, pages 372-380, 1993. Full version in the LIFL Tech. Rep. IT-247.
8. R. Gilleron, S. Tison, and M. Tommasi. Some new decidability results on positive and negative set constraints. In Proceedings, First International Conference on Constraints in Computational Logics, volume 845 of LLNCS, pages 336-351, 1994.
9. N. Heintze. Set Based Program Analysis. PhD thesis, Carnegie Mellon University, 1992.
10. N. Heintze and J. Jaffar. A Decision Procedure for a Class of Set Constraints. In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 42-51, Philadelphia, Pennsylvania, 4-7 June 1990. IEEE Computer Society Press.
11. N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Proceedings of the 17th ACM Symp. on Principles of Programming Languages, pages 197-209, 1990. Full version in the IBM tech. rep. RC 16089 (#71415).
12. P. R. Joachim Niehren, Manfred Pinkal. On equality up-to constraints over finite trees, context unification, and one-step rewriting, Dec. 1996.
13. D. Kozen. Logical aspects of set constraints. In Proceedings of Conf. Computer Science Logic (CSL’93), volume 832 of LNCS, pages 175-188, 1993.
14. H. Läuchli and C. Savioz. Monadic second order definable relation on the binary tree. Journal of Symbolic Logic, 52:219-226, 1987.
15. H. Lewis and C. Papadimitriou. Elements of the Theory of Computation. Prentice-Hall, 1981.
16. J. Marcinkowski. Undecidability of the first-order theory of one-step right ground rewriting. To appear in RTA’97, 1997.
17. J. Mongy. Transformation de noyaux reconnaissables d’arbres. Forêts RATEG. PhD thesis, Laboratoire d’Informatique Fondamentale de Lille, Université des Sciences et Technologies de Lille, Villeneuve d’Ascq, France, 1981.
18. M. Rabin. Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the American Mathematical Society, 141:1-35, 1969.
19. D. Seese. The structure of the models of decidable monadic theories of graphs. Annals of Pure and Applied Logic, 53:169-195, 1991.
20. M. Taitslin. Some further examples of undecidable theories. Algebra and Logic, 7:127-129 1968. Original paper (russian) in Algebra i Logica 6(3):105-111, 1967.
21. W. Thomas. On logics, tilings, and automata. In Annual International Colloquium on Automata, Languages and Programming, 1991.
22. R. Treinen. The first-order theory of one-step rewriting by a linear term rewriting system is undecidable (extended abstract), June 1996.
23. R. Treinen The first-order theory of one-step rewriting is undecidable. In ‘H Ganzinger, editor, 7th International Conference on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 276-286, New Brunswick, NJ, USA, July 1996. Springer-Verlag.
24. S. Vorobyov. The first-order theory of one step rewriting in linear noethenan systems is undecidable. To appear in RTA’97, 1997.