{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:07Z","timestamp":1725664327354},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615514"},{"type":"electronic","value":"9783540706205"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61551-2_81","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:56:11Z","timestamp":1330293371000},"page":"282-296","source":"Crossref","is-referenced-by-count":1,"title":["Combination of constraint systems II: Rational amalgamation"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Kepser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus U.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"20_CR1","unstructured":"P. Aczel, \u201cNon-well-founded Sets,\u201d CSLI Lecture Notes 14, Stanford Univ., 1988."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(94)90209-7","volume":"122","author":"H. Ait-Kaci","year":"1994","unstructured":"H. Ait-Kaci, A. Podelski, and G. Smolka, \u201cA feature-based constraint system for logic programming with entailment,\u201d Theoretical Comp. Science 122, 1994, pp.263\u2013283.","journal-title":"Theoretical Comp. Science"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"F. Baader and K.U. Schulz, \u201cOn the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers,\u201d in: Proceedings CP'95, U.Montanari, F.Rossi (Eds.), Springer LNCS 976, pp. 380\u2013397.","DOI":"10.1007\/3-540-60299-2_23"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/oso\/9780198537465.003.0002","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"F. Baader","year":"1994","unstructured":"F. Baader, J. Siekmann, \u201cUnification Theory,\u201d in D.M. Gabbay, C. Hogger, and J. Robinson, Editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, UK, 1994, pp. 41\u2013125."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"R. Backofen and R. Treinen, \u201cHow to Win a Game with Features,\u201d in Constraints in Computational Logics, Proc. CCL'94, J.-P. Jouannaud (Ed.), Springer LNCS 845, 1994, pp. 320\u2013335.","DOI":"10.1007\/BFb0016863"},{"key":"20_CR6","unstructured":"A. Colmerauer, \u201cEquations and inequations on finite and infinite trees,\u201d in: Proc. 2nd Int. Conf. on Fifth Generation Computer Systems, 1984, pp.85\u201399."},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/79204.79210","volume":"33","author":"A. Colmerauer","year":"1990","unstructured":"A. Colmerauer, \u201cAn introduction to PROLOG III,\u201d C. ACM 33, 1990, pp. 69\u201390.","journal-title":"C. ACM"},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"B. Courcelle, \u201cFundamental Properties of Infinite Trees,\u201d Theoretical Computer Science 25, 1983, pp. 95\u2013169.","journal-title":"Theoretical Computer Science"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"D.M. Gabbay, \u201cAn Overview of Fibred Semantics and the Combination of Logics,\u201d to appear in Proceedings of the First International Workshop \u201cFrontiers of Combining Systems\u201d FroCoS'96, F. Baader and K.U. Schulz, Eds., Kluwer Academic Publishers, 1996.","DOI":"10.1007\/978-94-009-0349-4_1"},{"key":"20_CR10","unstructured":"S. Kepser and K.U. Schulz, \u201cCombination of Constraint Systems II: Rational Amalgamation,\u201d long version of this paper, available via anonymous ftp from ftp.cis.uni-muenchen.de (directory \u201cschulz\u201d, file name \u201cRationalAmalgamation.ps.Z\u201d)."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"M. J. Maher, \u201cComplete axiomatizations of the algebras of finite, rational and infinite trees,\u201d in: Proceedings of Third Annual Symposium on Logic in Computer Science, LICS'88, pp. 348\u2013357, Edinburgh, Scotland, 1988.","DOI":"10.1109\/LICS.1988.5132"},{"key":"20_CR12","volume-title":"volume 66 of Studies in Logic and the Foundation of Mathematics","author":"A.I. Mal'cev","year":"1971","unstructured":"A.I. Mal'cev, \u201cThe Metamathematics of Algebraic Systems,\u201d volume 66 of Studies in Logic and the Foundation of Mathematics, North Holland, Amsterdam, London, 1971."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"J. Pfalzgraf, \u201cLogical Fiberings and Polycontextural Systems,\u201d In Fundamentals of Artificial Intelligence Research, Ph. Jorrand and J. Kelemen, Eds., Springer LNCS 535 (1991).","DOI":"10.1007\/3-540-54507-7_14"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"J. Pfalzgraf and K. Stokkerman, \u201cOn Robotics Scenarios and Modeling with Fibered Structures,\u201d In Springer series Texts and Monographs in Symbolic Computation, Automated Practical Reasoning: Algebraic Approaches, J. Pfalzgraf and D. Wang, Eds., Springer Verlag, 1994.","DOI":"10.1007\/978-3-7091-6604-8_4"},{"key":"20_CR15","unstructured":"W.C. Rounds, \u201cSet values for unification based grammar formalisms and logic programming,\u201d Research Report CSLI-88-129, Stanford, 1988."},{"issue":"3","key":"20_CR16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0743-1066(94)90044-2","volume":"18","author":"G. Smolka","year":"1994","unstructured":"G. Smolka, R. Treinen, \u201cRecords for Logic Programming,\u201d J. of Logic Programming 18(3) (1994), pp. 229\u2013258.","journal-title":"J. of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61551-2_81.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:34:18Z","timestamp":1713634458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61551-2_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615514","9783540706205"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-61551-2_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}