{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T09:58:16Z","timestamp":1648547896216},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4337,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0304-3975(00)00164-x","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T21:53:12Z","timestamp":1036101192000},"page":"113-157","source":"Crossref","is-referenced-by-count":0,"title":["Combination of constraint systems II: Rational amalgamation"],"prefix":"10.1016","volume":"266","author":[{"given":"Klaus U.","family":"Schulz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Kepser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00164-X_BIB1","unstructured":"P. Aczel, Non-well-founded sets, CSLI Lecture Notes, vol. 14, Stanford University, 1988."},{"key":"10.1016\/S0304-3975(00)00164-X_BIB2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(94)90209-7","article-title":"A feature-based constraint system for logic programming with entailment","volume":"122","author":"Ait-Kaci","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00164-X_BIB3","doi-asserted-by":"crossref","unstructured":"F. Baader, K.U. Schulz, Combination of constraint solving techniques: an algebraic point of view, Research Report CIS-Rep-94-75, University of Munich, 1994, short version in Proc. RTA\u201995, Lecture Notes in Computer Science, vol. 914, Springer, Berlin, 1995, pp. 352\u2013366.","DOI":"10.1007\/3-540-59200-8_69"},{"key":"10.1016\/S0304-3975(00)00164-X_BIB4","series-title":"Proc. CP\u201995","first-page":"380","article-title":"On the combination of symbolic constraints, solution domains, and constraint solvers","volume":"vol. 976","author":"Baader","year":"1995"},{"key":"10.1016\/S0304-3975(00)00164-X_BIB5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0304-3975(97)00147-3","article-title":"Combination of constraint solvers for free and quasi-free structures","volume":"192","author":"Baader","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00164-X_BIB6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(94)00188-O","article-title":"A complete and recursive feature theory","volume":"146","author":"Backofen","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00164-X_BIB7","series-title":"Constraints in Computational Logics, Proc. CCL\u201994","first-page":"320","article-title":"How to win a game with features","volume":"vol. 845","author":"Backofen","year":"1994"},{"key":"10.1016\/S0304-3975(00)00164-X_BIB8","unstructured":"A. Colmerauer, Equations and inequations on finite and infinite trees, Proc. 2nd Int. Conf. on Fifth Generation Computer Systems, 1984, pp. 85\u201399."},{"key":"10.1016\/S0304-3975(00)00164-X_BIB9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/79204.79210","article-title":"An introduction to PROLOG III","volume":"33","author":"Colmerauer","year":"1990","journal-title":"C. ACM"},{"key":"10.1016\/S0304-3975(00)00164-X_BIB10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","article-title":"Fundamental properties of infinite trees","volume":"25","author":"Courcelle","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00164-X_BIB11","doi-asserted-by":"crossref","unstructured":"D.M. Gabbay, An overview of fibred semantics and the weaving of logics, in: F. Baader, K.U. Schulz (Eds.), Proc. 1st Internat. Workshop \u201cFrontiers of Combining Systems\u201d FroCoS\u201996,Applied Logics Series, vol. 3, Kluwer Academic Publishers, Dordrecht, 1996.","DOI":"10.1007\/978-94-009-0349-4_1"},{"key":"10.1016\/S0304-3975(00)00164-X_BIB12","unstructured":"S. Kepser, Combination of Constraint Solvers, Doctoral Dissertation, CIS, University of Munich, 1998."},{"key":"10.1016\/S0304-3975(00)00164-X_BIB13","doi-asserted-by":"crossref","unstructured":"M.J. Maher, Complete axiomatizations of the algebras of finite, rational and infinite trees, in: Proc. 3rd Annu. Symp. on Logic in Computer Science, LICS\u201988, Edinburgh, Scotland, IEEE Computer Society Press, Silver Spring, MD, 1988, pp. 348\u2013357.","DOI":"10.1109\/LICS.1988.5132"},{"key":"10.1016\/S0304-3975(00)00164-X_BIB14","volume":"vol. 66","author":"Mal'cev","year":"1971"},{"key":"10.1016\/S0304-3975(00)00164-X_BIB15","article-title":"Logical fiberings and polycontextural systems","volume":"vol. 535","author":"Pfalzgraf","year":"1991"},{"key":"10.1016\/S0304-3975(00)00164-X_BIB16","series-title":"Springer Series Texts and Monographs in Symbolic Computation, Automated Practical Reasoning: Algebraic Approaches","article-title":"On robotics scenarios and modeling with fibered structures","author":"Pfalzgraf","year":"1994"},{"key":"10.1016\/S0304-3975(00)00164-X_BIB17","unstructured":"W.C. Rounds, Set values for unification based grammar formalisms and logic programming,Research Report CSLI-88-129, Stanford, 1988."},{"issue":"3","key":"10.1016\/S0304-3975(00)00164-X_BIB18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0743-1066(94)90044-2","article-title":"Records for Logic Programming","volume":"18","author":"Smolka","year":"1994","journal-title":"J. Logic Programming"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000164X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000164X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T09:59:44Z","timestamp":1578909584000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750000164X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S030439750000164X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00164-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}