{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T11:10:08Z","timestamp":1727608208496},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540568681"},{"type":"electronic","value":"9783662215517"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/978-3-662-21551-7_9","type":"book-chapter","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T09:30:08Z","timestamp":1658223008000},"page":"106-120","source":"Crossref","is-referenced-by-count":0,"title":["Equational and membership constraints for infinite trees"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Niehren","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Treinen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"H. A\u00eft-Kaci and A. Podelski. Towards a meaning of LIFE. In Third PLIPS, pages 255\u2013274. Springer-Verlag, LNCS 528, August 1991.","DOI":"10.1007\/3-540-54444-5_104"},{"key":"9_CR2","unstructured":"H. A\u00eft-Kaci, A. Podelski, and G. Smolka. A feature-based constraint system for logic programming with entailment. In 5th FGCS, pages 1012\u20131022, June 1992."},{"volume-title":"Research Report RR-92-30","year":"1992","author":"R. Backofen","key":"9_CR3","unstructured":"R. Backofen and G. Smolka. A complete and recursive feature theory. Research Report RR-92-30, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, 6600 Saarbr\u00fccken 11, Germany, September 1992."},{"key":"9_CR4","unstructured":"A. Colmerauer. Equations and inequations on finite and infinite trees. In 2nd FGCS, pages 85\u201399, 1984."},{"issue":"4","key":"9_CR5","first-page":"255","volume":"2","author":"A. Colmerauer","year":"1983","unstructured":"A. Colmerauer, H. Kanoui, and M. V. Caneghem. Prolog, theoretical principles and current trends. Technology and Science of Informatics, 2(4):255\u2013292, 1983.","journal-title":"Technology and Science of Informatics"},{"volume-title":"Rapport de Recherche 649","year":"1991","author":"H. Comon","key":"9_CR6","unstructured":"H. Comon and C. Delor. Equational formulae with membership constraints. Rapport de Recherche 649, LRI, Universit\u00e9 de Paris Sud, Orsay,France, Mar. 1991."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"I. Guessarian. Some fixpoint techniques in algebraic structures and applications to computer science. In A\u00eft-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 1, pages 263\u2013292. Academic Press, 1989.","DOI":"10.1016\/B978-0-12-046370-1.50013-9"},{"key":"9_CR8","first-page":"31","volume-title":"7th ICLP","author":"S. Haridi","year":"1990","unstructured":"S. Haridi and S. Janson. Kernel andorra prolog and its computation model. In 7th ICLP, pages 31\u201348, Cambridge, June 1990. MIT Press."},{"key":"9_CR9","unstructured":"M. Henz, G. Smolka, and J. W\u00fcrtz. Oz \u2014 a programming language for multi-agent systems. In 13th IJCAI, Chamb\u00e9ry, France, Aug. 1993."},{"volume-title":"LILOG Report 53","year":"1988","author":"M. H\u00f6hfeld","key":"9_CR10","unstructured":"M. H\u00f6hfeld and G. Smolka. Definite relations over constraint languages. LILOG Report 53, IWBS, IBM Deutschland, Postfach 80 08 80, 7000 Stuttgart 80, Germany, Oct. 1988."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez. Constraint logic programming. In 14th POPL, pages 111\u2013119, Munich, Germany, Jan. 1987.","DOI":"10.1145\/41625.41635"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-96826-6"},{"key":"9_CR13","unstructured":"M. J. Maher. Logic semantics for a class of committed-choice programs. In Fourth ICLP, pages 858\u2013876. MIT Press, 1987."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"M. J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Third LICS, pages 348\u2013357. IEEE Computer Society, 1988.","DOI":"10.1109\/LICS.1988.5132"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"J. Niehren and A. Podelski. Feature automata and recognizable sets of feature trees. In Tapssoft, Apr. 1993.","DOI":"10.1007\/3-540-56610-4_76"},{"volume-title":"Research Report RR-93-14","year":"1993","author":"J. Niehren","key":"9_CR16","unstructured":"J. Niehren, A. Podelski, and R. Treinen. Equational and membership constraints for infinite trees. Research Report RR-93-14, Deutsches Forschungszentrum f\u00fcr K\u00fcnstliche Intelligenz, Stuhlsatzenhausweg 3, D-W-6600 Saarbr\u00fccken, Germany, 1993."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"V. Saraswat and M. Rinard. Semantic foundations of concurrent constraint programming. In 18th POPL, pages 333\u2013351, Jan. 1991.","DOI":"10.1145\/99583.99627"},{"volume-title":"Research report","year":"1993","author":"G. Smolka","key":"9_CR18","unstructured":"G. Smolka. A calculus for higher-order concurrent constraint programming. Research report, Deutsches Forschungszentrum f\u00fcr K\u00fcnstliche Intelligenz, Stuhlsatzenhausweg 3, D-W-6600 Saarbr\u00fccken, Germany, 1993. Forthcomming."},{"key":"9_CR19","first-page":"240","volume-title":"Records for logic programming","author":"G. Smolka","year":"1992","unstructured":"G. Smolka and R. Treinen. Records for logic programming. In Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 240\u2013254, Washington, USA, 1992. The MIT Press."},{"volume-title":"Research Report RR-92-23","year":"1992","author":"G. Smolka","key":"9_CR20","unstructured":"G. Smolka and R. Treinen. Records for logic programming. Research Report RR-92-23, Deutsches Forschungszentrum f\u00fcr K\u00fcnstliche Intelligenz, Stuhlsatzenhausweg 3, D-W-6600 Saarbr\u00fccken, Germany, Aug. 1992."},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B \u2014 Formal Models and Semantics, chapter 4, pages 133\u2013191. Elsevier Science Publishers and The MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"T. E. Uribe. Sorted unification using set constraints. In 11th CADE LNCS vol. 607, pages 163\u2013177, June 1992. Springer-Verlag.","DOI":"10.1007\/3-540-55602-8_163"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-21551-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T10:54:42Z","timestamp":1727607282000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-21551-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540568681","9783662215517"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-21551-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}