{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T10:46:49Z","timestamp":1655635609925},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540421177","type":"print"},{"value":"9783540451273","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45127-7_15","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:25:25Z","timestamp":1184603125000},"page":"185-200","source":"Crossref","is-referenced-by-count":2,"title":["Weakly Regular Relations and Applications"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Limet","sequence":"first","affiliation":[]},{"given":"Pierre","family":"R\u00e9ty","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,8]]},"reference":[{"key":"15_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of 10th Conference RTA","author":"A.C. Caron","year":"1999","unstructured":"A.C. Caron, F. Seynhaeve, S. Tison, and M. Tommasi. Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting. In Proceedings of 10th Conference RTA, Trento (Italy), volume 1631 of LNCS. Springer-Verlag, 1999."},{"key":"15_CR2","unstructured":"H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications (TATA). http:\/\/l3ux02.univ-lille3.fr\/tata ."},{"key":"15_CR3","unstructured":"L. Fribourg. SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In proceedings IEEE Symposium on Logic Programming, pages 172\u2013185, Boston, 1985."},{"key":"15_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of FoSSaCs","author":"V. Gouranton","year":"2001","unstructured":"V. Gouranton, P. R\u00e9ty, and H. Seidl. Synchronized Tree Languages Revisited and New Applications. In Proceedings of FoSSaCs, volume to appear of LNCS. Springer-Verlag, 2001."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"M. Hermann and R. Galbav\u00fd. Unification of Infinite Sets of Terms Schematized by Primal Grammars. Theoretical Computer Science, 176, 1997.","DOI":"10.1016\/S0304-3975(96)00052-7"},{"key":"15_CR6","unstructured":"F. Jacquemard. Automates d\u2019Arbres et R\u00e9\u00e9criture de Termes. Th\u00e8se de Doctorat d\u2019Universit\u00e9, Universit\u00e9 de Paris-sud, 1996. In French."},{"key":"15_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BFb0030616","volume-title":"Proceedings of 6th Colloquium on Trees in Algebra and Programming","author":"S. Limet","year":"1997","unstructured":"S. Limet and P. R\u00e9ty. E-Unification by Means of Tree Tuple Synchronized Grammars. In Proceedings of 6th Colloquium on Trees in Algebra and Programming, volume 1214 of LNCS, pages 429\u2013440. Springer-Verlag, 1997. Full version in DMTCS ( http:\/\/dmtcs.loria.fr\/ ), volume 1, pages 69\u201398, 1997."},{"key":"15_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of 10th Conference on Rewriting Techniques and Applications","author":"S. Limet","year":"1999","unstructured":"S. Limet and P. R\u00e9ty. A New Result about the Decidability of the Existential One-step Rewriting Theory. In Proceedings of 10th Conference on Rewriting Techniques and Applications, Trento (Italy), volume 1631 of LNCS. Springer-Verlag, 1999."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"S. Limet, P. R\u00e9ty, and H. Seidl. Weakly Regular Relations and Applications. Research Report RR-LIFO-00-17, LIFO, 2000. http:\/\/www.univ-orleans.fr\/SCIENCES\/LIFO\/Members\/rety\/publications.html .","DOI":"10.1007\/3-540-45127-7_15"},{"key":"15_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BFb0000483","volume-title":"proc of the 6th Conf. on Algebraic Methodology and Software Technology","author":"S. Limet","year":"1997","unstructured":"S. Limet and F. Saubion. On partial validation of logic programs. In M. Johnson, editor, proc of the 6th Conf. on Algebraic Methodology and Software Technology, Sydney (Australia), volume 1349 of LNCS, pages 365\u2013379. Springer Verlag, 1997."},{"key":"15_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/BFb0056619","volume-title":"proc of PLILP-ALP\u201998","author":"S. Limet","year":"1998","unstructured":"S. Limet and F. Saubion. A general framework for R-unification. In C. Palamidessi, H. Glaser, and K. Meinke, editors, proc of PLILP-ALP\u201998, volume 1490 of LNCS, pages 266\u2013281. Springer Verlag, 1998."},{"key":"15_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-62950-5_75","volume-title":"Proceedings 8th Conference RTA","author":"J. Marcinkowski","year":"1997","unstructured":"J. Marcinkowski. Undecidability of the First-order Theory of One-step Right Ground Rewriting. In Proceedings 8th Conference RTA, Sitges (Spain), volume 1232 of LNCS, pages 241\u2013253. Springer-Verlag, 1997."},{"key":"15_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-63104-6_4","volume-title":"Proc. of CADE\u201997","author":"J. Niehren","year":"1997","unstructured":"J. Niehren, M. Pinkal, and P. Ruhrberg. On Equality up-to Constraints over Finite Trees, Context Unification and One-step Rewriting. In W. Mc Cune, editor, Proc. of CADE\u201997, Townsville (Australia), volume 1249 of LNCS, pages 34\u201348, 1997."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"P. R\u00e9ty. Regular Sets of Descendants for Constructor-based Rewrite Systems. In Proceedings of the 6th international conference on Logic for Programming and Automated Reasoning (LPAR), Tbilisi (Republic of Georgia), Lecture Notes in Artificial Intelligence. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48242-3_10"},{"key":"15_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BFb0030610","volume-title":"Proceedings of 6th Colloquium on Trees in Algebra and Programming","author":"F. Seynhaeve","year":"1997","unstructured":"F. Seynhaeve, M. Tommasi, and R. Treinen. Grid Structures and Undecidable Constraint Theories. In Proceedings of 6th Colloquium on Trees in Algebra and Programming, volume 1214 of LNCS, pages 357\u2013368. Springer-Verlag, 1997."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(98)00083-8","volume":"208","author":"R. Treinen","year":"1998","unstructured":"R. Treinen. The First-order Theory of One-step Rewriting is Undecidable. Theoretical Computer Science, 208:179\u2013190, 1998.","journal-title":"Theoretical Computer Science"},{"key":"15_CR17","series-title":"Lect Notes Comput Sci","first-page":"241","volume-title":"Proceedings 8th Conference RTA","author":"S. Vorobyov","year":"1997","unstructured":"S. Vorobyov. The First-order Theory of One-step Rewriting in Linear Noetherian Systems is Undecidable. In Proceedings 8th Conference RTA, Sitges (Spain), volume 1232 of LNCS, pages 241\u2013253. Springer-Verlag, 1997."}],"container-title":["Rewriting Techniques and Applications","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45127-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T01:49:43Z","timestamp":1587779383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45127-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421177","9783540451273"],"references-count":17,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45127-7_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2001]]}}}