{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:32:51Z","timestamp":1725485571744},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000105"},{"type":"electronic","value":"9783540360780"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36078-6_21","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T02:48:36Z","timestamp":1180666116000},"page":"311-326","source":"Crossref","is-referenced-by-count":1,"title":["Parallelism and Tree Regular Constraints"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Niehren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"21_CR1","unstructured":"Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel. An efficient algorithm for the configuration problem of dominance graphs. In 12th ACM-SIAM Symposium on Discrete Algorithms, pages 815\u2013824, 2001."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01048403","volume":"4","author":"R. Backofen","year":"1995","unstructured":"R. Backofen, J. Rogers, and K. Vijay-Shanker. A first-order axiomatization of the theory of finite trees. Journal of Logic, Language, and Information, 4:5\u201339, 1995.","journal-title":"Journal of Logic, Language, and Information"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-45127-7_5","volume-title":"RTA\u201901","author":"M. Bodirsky","year":"2001","unstructured":"Manuel Bodirsky, Katrin Erk, Alexander Koller, and Joachim Niehren. Beta reduction constraints. In RTA\u201901, volume 2051 of LNCS, pages 31\u201346, 2001."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Manuel Bodirsky, Katrin Erk, Alexander Koller, and Joachim Niehren. Underspecified beta reduction. In ACL\u2019 01, pages 74\u201381, 2001.","DOI":"10.3115\/1073012.1073023"},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1006\/jsco.1997.0185","volume":"25","author":"H. Comon","year":"1998","unstructured":"Hubert Comon. Completion of rewrite systems with membership constraints. Symbolic Computation, 25(4):397\u2013453, 1998. Extends on a paper at ICALP\u201992.","journal-title":"Symbolic Computation"},{"issue":"1-2","key":"21_CR6","first-page":"63","volume":"244","author":"B. Courcelle","year":"2000","unstructured":"Bruno Courcelle. The monadic second-order logic of graphs XIII: Graph drawings with edge crossings. Computational Intelligence, 244(1-2):63\u201394, 2000.","journal-title":"Computational Intelligence"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00630923","volume":"14","author":"M. Dalrymple","year":"1991","unstructured":"Mary Dalrymple, Stuart Shieber, and Fernando Pereira. Ellipsis and higher-order unification. Linguistics & Philosophy, 14:399\u2013452, 1991.","journal-title":"Linguistics & Philosophy"},{"key":"21_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44693-1_15","volume-title":"STACS 2001","author":"V. Diekert","year":"2001","unstructured":"Volker Diekert, Claudio Guterrez, and Christian Hagenah. The existential theory of equations with rational constraints in free groups is pspace-complete. In STACS 2001, volume 2010 of LNCS, pages 170\u2013182, 2001."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"John Doner. Tree acceptors and some of their applications. Journal of Computer System Science, 4:406\u2013451, 1970. Received December 1967, Revised May 1970.","journal-title":"Journal of Computer System Science"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Denys Duchier and Claire Gardent. Tree descriptions, constraints and incrementality. In Computing Meaning, volume 77 of Studies In Linguistics And Philosophy, pages 205\u2013227. Kluwer Academic Publishers, 2001.","DOI":"10.1007\/978-94-010-0572-2_12"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1023\/A:1017964622902","volume":"10","author":"M. Egg","year":"2001","unstructured":"Markus Egg, Alexander Koller, and Joachim Niehren. The constraint language for lambda structures. Logic, Language, and Information, 10:457\u2013485, 2001.","journal-title":"Logic, Language, and Information"},{"key":"21_CR12","unstructured":"Katrin Erk, Alexander Koller, and Joachim Niehren. Processing underspecified semantic representations in the constraint language for lambda structures. Journal of Language and Computation, 2002. To appear."},{"key":"21_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/10721975_8","volume-title":"RTA\u2019 00","author":"K. Erk","year":"2000","unstructured":"Katrin Erk and Joachim Niehren. Parallelism constraints. In RTA\u2019 00, volume 1833 of LNCS, pages 110\u2013126, 2000."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Alexander Koller and Joachim Niehren. On underspecified processing of dynamic semantics. In 18th Int. Conf. on Computational Linguistics, pages 460\u2013466, July 2000.","DOI":"10.3115\/990820.990887"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Alexander Koller, Joachim Niehren, and Ralf Treinen. Dominance constraints: Algorithms and complexity. In LACL\u201998, volume 2014 of LNAI, 2001.","DOI":"10.1007\/3-540-45738-0_7"},{"key":"21_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/10721975_11","volume-title":"RTA\u201900","author":"J. Levy","year":"2000","unstructured":"Jordi Levy and Mateu Villaret. Linear second-order unification and context unification with tree-regular constraints. In RTA\u201900, volume 1833 of LNCS, pages 156\u2013171, 2000."},{"key":"21_CR17","series-title":"Lect Notes Comput Sci","first-page":"167","volume-title":"RTA\u2019 01","author":"J. Levy","year":"2001","unstructured":"Jordi Levy and Mateu Villaret. Context unification and traversal equations. In RTA\u2019 01, volume 2051 of LNCS, pages 167\u2013184, 2001."},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Mitchell P. Marcus, Donald Hindle, and Margaret M. Fleck. D-theory: Talking about talking about trees. In Proceedings of the 21st ACL, pages 129\u2013136, 1983.","DOI":"10.3115\/981311.981337"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Joachim Niehren and Alexander Koller. Dominance constraints in context unification. In Logical Aspects of Computational Linguistics (1998), volume 2014 of LNAI, 2001.","DOI":"10.1007\/3-540-45738-0_12"},{"key":"21_CR20","unstructured":"Joachim Niehren and Mateu Villaret. On lambda binding, parallelism constraints and context unification, 2002. Available at http:\/\/www.ps.uni-sb.de\/Papers ."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1111\/j.1467-8640.1994.tb00005.x","volume":"10","author":"J. Rogers","year":"1994","unstructured":"J. Rogers and K. Vijay-Shanker. Obtaining trees from their descriptions: An application to tree-adjoining grammars. Computational Intelligence, 10:401\u2013421, 1994.","journal-title":"Computational Intelligence"},{"key":"21_CR22","unstructured":"M. Schmidt-Schau\u03b2. A decision algorithm for stratified context unification. Technical Report F-rep.-12, FB Informatik, J.W. Goethe Universit\u00e4t Frankfurt, 1999."},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Manfred Schmidt-Schau\u03b2 and Klaus U. Schulz. Solvability of context equations with two context variables is decidable. In CADE-16, LNAI, pages 67\u201381, 1999.","DOI":"10.1007\/3-540-48660-7_5"},{"key":"21_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55124-7","volume-title":"Proceedings of the First International Workshop of Word Equations and Related Topics","author":"K. U. Schulz","year":"1992","unstructured":"Klaus U. Schulz. Makanin\u2019s algorithm for word equations-two improvements and a generalization. In Proceedings of the First International Workshop of Word Equations and Related Topics, volume 572 of LNCS, T\u00fcbingen, Germany, 1992."},{"issue":"1","key":"21_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J. W. Thatcher","year":"1967","unstructured":"J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57\u201381, 1967.","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36078-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:18:03Z","timestamp":1556464683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36078-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000105","9783540360780"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-36078-6_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}