{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:40:43Z","timestamp":1725471643673},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540459149"},{"type":"electronic","value":"9783540459156"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11881216_29","type":"book-chapter","created":{"date-parts":[[2006,10,12]],"date-time":"2006-10-12T01:36:47Z","timestamp":1160617007000},"page":"269-279","source":"Crossref","is-referenced-by-count":1,"title":["Improving the Computational Efficiency in Symmetrical Numeric Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"R. M.","family":"Gasca","sequence":"first","affiliation":[]},{"given":"C.","family":"Del Valle","sequence":"additional","affiliation":[]},{"given":"V.","family":"Cejudo","sequence":"additional","affiliation":[]},{"given":"I.","family":"Barba","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Automated Deduction - CADE-11","author":"F. Benhamou","year":"1992","unstructured":"Benhamou, F., Sais, L.: Theoretical study of symmetries in propositional calculus and applications. In: Kapur, D. (ed.) CADE 1992. LNCS, vol.\u00a0607, Springer, Heidelberg (1992)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Benhamou, F., Older, W.: Applying Interval Arithmetic to Real, Integer and Boolean Constraints. The Journal of Logic Programming, 1\u201324 (1997)","DOI":"10.1016\/S0743-1066(96)00142-2"},{"key":"29_CR3","unstructured":"Collavizza, H., Delobel, F., Rueher, M.: Extending consistent domains of numeric CSP. In: Proceedings of Sixteenth IJCAI 1999, Stockholm, pp. 406\u2013411 (1999)"},{"key":"29_CR4","unstructured":"Crawford, J., Ginsberg, M., Luks, E., Roy, A.: Symmetry-breaking Predicates for search problems. In: Proc. of KR 1996, pp. 148\u2013159 (1996)"},{"key":"29_CR5","unstructured":"Dague, P.: Numeric Reasoning with relative orders of magnitude. In: Proc. of the Thirteenth IJCAI, Cambery, pp. 541\u2013547 (1993)"},{"key":"29_CR6","unstructured":"Fox, M., Long, D.: The Detection and Explotation of Symmetry in Planning Problems. In: Proceedings IJCAI\u201999, pp. 956\u2013961 (1999)"},{"key":"29_CR7","unstructured":"Gent, I.P., Smith, B.M.: Symmetry Breaking During Search in Constraint Programming. In: Report 99.02 University of Leeds (1999)"},{"key":"29_CR8","unstructured":"Gent, I.P., Smith, B.M.: Symmetry Breaking in Constraint Programming. In: Proc. ECAI 2000 (2000)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(92)90005-I","volume":"58","author":"E. Hyv\u00f6nen","year":"1992","unstructured":"Hyv\u00f6nen, E.: Constraint reasoning based on interval arithmetic: the tolerance propagation. Artificial Intelligence\u00a058, 1\u2013112 (1992)","journal-title":"Artificial Intelligence"},{"key":"29_CR10","unstructured":"Jussien, N., Lhomme, O.: Dynamic domain splitting for numeric CSPs. In: Proceedings ECAI 1998, pp. 224\u2013228 (1998)"},{"key":"29_CR11","unstructured":"Lhomme, O.: Contribution \u00e0 la r\u00e9solution de constraintes sur les r\u00e9els par propagation d\u2019intervalles. Ph. D. Nice-Sophia University. Antipolis (1994)"},{"issue":"9-10","key":"29_CR12","first-page":"67","volume":"12","author":"M.L. Mavovrouniotis","year":"1988","unstructured":"Mavovrouniotis, M.L., Stephanopoulos, G.: Formal Order of Magnitude Reasoning in process engineering. Comput. Chem Engineering\u00a012(9-10), 67\u2013880 (1988)","journal-title":"Comput. Chem Engineering"},{"key":"29_CR13","unstructured":"Meseguer, P., Torras, C.: Solving Strategies for Highly Symmetric CSPs. In: Proceedings IJCAI 1999, pp. 400\u2013411 (1999)"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-56804-2_33","volume-title":"Methodologies for Intelligent Systems","author":"J.F. Puget","year":"1993","unstructured":"Puget, J.F.: On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Ra\u015b, Z.W. (eds.) ISMIS 1993. LNCS, vol.\u00a0689, pp. 350\u2013361. Springer, Heidelberg (1993)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-540-45193-8_40","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"J.F. Puget","year":"2003","unstructured":"Puget, J.F.: Symmetry Breaking using stabilizers. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 585\u2013589. Springer, Heidelberg (2003)"},{"key":"29_CR16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5073.001.0001","volume-title":"A modeling language for global optimization","author":"P. Hentenryck Van","year":"1997","unstructured":"Van Hentenryck, P., Michel, L., Numerica, D.Y.: A modeling language for global optimization. The MIT Press, Cambridge (1997)"}],"container-title":["Lecture Notes in Computer Science","Current Topics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11881216_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T13:13:49Z","timestamp":1555852429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11881216_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540459149","9783540459156"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11881216_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}