{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:15:13Z","timestamp":1725560113726},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221746"},{"type":"electronic","value":"9783540259381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25938-1_17","type":"book-chapter","created":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T12:45:52Z","timestamp":1280061952000},"page":"198-213","source":"Crossref","is-referenced-by-count":7,"title":["Integration and Optimization of Rule-Based Constraint Solvers"],"prefix":"10.1007","author":[{"given":"Slim","family":"Abdennadher","sequence":"first","affiliation":[]},{"given":"Thom","family":"Fr\u00fchwirth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017444","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"S. Abdennadher","year":"1997","unstructured":"Abdennadher, S.: Operational semantics and confluence of constraint propagation rules. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, Springer, Heidelberg (1997)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-49481-2_4","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"S. Abdennadher","year":"1998","unstructured":"Abdennadher, S., Fr\u00fchwirth, T.: On completion of constraint handling rules. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, p. 25. Springer, Heidelberg (1998)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-540-48085-3_4","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"S. Abdennadher","year":"1999","unstructured":"Abdennadher, S., Fr\u00fchwirth, T.: Operational equivalence of constraint handling rules. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 43\u201357. Springer, Heidelberg (1999)"},{"key":"17_CR4","unstructured":"Abdennadher, S., Fr\u00fchwirth, T.: Using program analysis for integration and optimization of rule-based constraint solvers. In: Onziemes Journees Francophones de Programmation Logique et Programmation par Contraintes (JFPLC 2002) (2002)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Abdennadher, S., Fr\u00fchwirth, T., Meuss, H.: Confluence and semantics of constraint simplification rules. Constraints Journal 4(2) (May 1999)","DOI":"10.1023\/A:1009842826135"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jsco.2002.0541","volume":"34","author":"T. Arts","year":"2002","unstructured":"Arts, T., Giesl, J., Ohlebusch, E.: Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation\u00a034(1), 21\u201358 (2002)","journal-title":"Journal of Symbolic Computation"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-45406-3_3","volume-title":"Constraints in Computational Logics. Theory and Applications","author":"F. Baader","year":"2001","unstructured":"Baader, F., Schulz, K.U.: Combining constraint solving. In: Comon, H., March\u00e9, C., Treinen, R. (eds.) CCL 1999. LNCS, vol.\u00a02002, pp. 104\u2013158. Springer, Heidelberg (2001)"},{"key":"17_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/3-540-44990-6_11","volume-title":"Artificial Intelligence and Symbolic Computation","author":"C. Castro","year":"2001","unstructured":"Castro, C., Monfroy, E.: Basic operators for solving constraints via collaboration of solvers. In: Campbell, J., Roanes-Lozano, E. (eds.) AISC 2000. LNCS (LNAI), vol.\u00a01930, p. 142. Springer, Heidelberg (2001)"},{"issue":"1-3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming\u00a037(1-3), 95\u2013138 (1998)","journal-title":"Journal of Logic Programming"},{"key":"17_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-44654-0_15","volume-title":"New Trends in Constraints","author":"T. Fr\u00fchwirth","year":"2000","unstructured":"Fr\u00fchwirth, T.: Proving termination of constraint solver programs. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS (LNAI), vol.\u00a01865, p. 298. Springer, Heidelberg (2000)"},{"key":"17_CR11","unstructured":"Fr\u00fchwirth, T.: Constraint handling rules web pages (2004), www.informatik.uniulm.de\/pm\/mitarbeiter\/fruehwirth\/chr-intro.html"},{"key":"17_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05138-2","volume-title":"Essentials of Constraint Programming","author":"T. Fr\u00fchwirth","year":"2003","unstructured":"Fr\u00fchwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer, Heidelberg (2003)"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(96)00042-4","volume":"165","author":"B. Gramlich","year":"1996","unstructured":"Gramlich, B.: On termination and confluence properties of disjoint and constructorsharing conditional rewrite systems. Theoretical Computer Science\u00a0165(1), 97\u2013131 (1996)","journal-title":"Theoretical Computer Science"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Granvilliers, L., Monfroy, E., Benhamou, F.: Cooperative solvers in constraint programming: A short introduction. In: Workshop on Cooperative Solvers in Constraint Programming (CoSolv) at CP 2001 (2001)","DOI":"10.1145\/384101.384123"},{"key":"17_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-44957-4_23","volume-title":"Computational Logic - CL 2000","author":"P. Hofstedt","year":"2000","unstructured":"Hofstedt, P.: Better communication for tighter cooperation. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, p. 342. Springer, Heidelberg (2000)"},{"key":"17_CR16","unstructured":"Monfroy, E.: The constraint solver collaboration language of BALI. In: Frontiers of Combining Systems 2. Studies in Logic and Computation, vol.\u00a07, Research Studies Press\/Wiley (2000)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Ohlebusch, E.: Modular properties of composable term rewriting systems. Journal of Symbolic Computation 20(1) (1995)","DOI":"10.1006\/jsco.1995.1036"},{"issue":"1","key":"17_CR18","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(01)00332-2","volume":"290","author":"C. Tinelli","year":"2003","unstructured":"Tinelli, C., Ringeissen, C.: Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science\u00a0290(1), 291\u2013353 (2003)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25938-1_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:58:55Z","timestamp":1605761935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25938-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221746","9783540259381"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25938-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}
