{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:15:01Z","timestamp":1725484501451},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000112"},{"type":"electronic","value":"9783540360797"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36079-4_14","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T02:56:06Z","timestamp":1180666566000},"page":"159-172","source":"Crossref","is-referenced-by-count":0,"title":["Disjunction of Non-binary and Numeric Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Miguel A.","family":"Salido","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Barber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"14_CR1","unstructured":"F. Bacchus and P. vanBeek, \u2018On the conversion between non-binary and binary constraint satisfaction problems\u2019, In proceeding of AAAI-98, 311\u2013318, (1998)."},{"key":"14_CR2","unstructured":"R. Bart\u00e1k, \u2018Constraint programming: In pursuit of the holy grail\u2019, in Proceedings of WDS99 (invited lecture), Prague, June, (1999)."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"C. Bessi\u00e9re, \u2018Non-binary constraints\u2019, In Proc. Principles and Practice of Constraint Programming (CP-99), 24\u201327, (1999).","DOI":"10.1007\/978-3-540-48085-3_2"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"C. Bessi\u00e9re, P. Meseguer, E.C. Freuder, and J. Larrosa, \u2018On forward checking for non-binary constraint satisfaction\u2019, In Proc. Principles and Practice of Constraint Programming (CP-99), 88\u2013102, (1999).","DOI":"10.1007\/978-3-540-48085-3_7"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"M. Koubarakis, \u2018Tractable disjunction of linear constraints\u2019, In Proc. 2nd International Conference on Principles and Practice of Constraint Programming (CP-96), 297\u2013307, (1999).","DOI":"10.1007\/3-540-61551-2_82"},{"key":"14_CR6","series-title":"Phd Dissertation","volume-title":"Algorithms and Heuristics for total and partial Constraint Satisfaction","author":"J. Larrosa","year":"1998","unstructured":"J. Larrosa, Algorithms and Heuristics for total and partial Constraint Satisfaction, Phd Dissertation, UPC, Barcelona, 1998."},{"key":"14_CR7","unstructured":"J.L. Lassez and K. McAloon, \u2018A canonical form for generalizad linear constraints\u2019, In Advanced Seminar on Foundations of Innovative Software Development, 19\u201327, (1989)."},{"key":"14_CR8","unstructured":"O. Lhomme, \u2018Consistency techniques for numeric CSPs\u2019, In International Joint Conference on Artificial Intelligence (IJCAI-93), 232\u2013238, (1993)."},{"key":"14_CR9","unstructured":"F. Rossi, C. Petrie, and V. Dhar, \u2018On the equivalence of constraint satisfaction problems\u2019, In proceeding of European Conference of Artificial Intelligence, 550\u2013556, (1990)."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"D. Sabin and E.C. Freuder, \u2018Understanding and improving the MAC algorithm\u2019, In proceeding of Principles and Practice of Constraint Programming, 167\u2013181, (1997).","DOI":"10.1007\/BFb0017438"},{"key":"14_CR11","series-title":"Lect Notes Comput Sci","first-page":"799","volume-title":"Proc. of 7th International Conference on Principles and Practice of Constraint Programming (CP-01)","author":"M.A. Salido","year":"2001","unstructured":"M.A. Salido and F. Barber, \u2018An incremental and non-binary CSP solver: The Hyperpolyhedron Search Algorithm\u2019, In Proc. of 7th International Conference on Principles and Practice of Constraint Programming (CP-01), LNCS 2239, 799\u2013780, (2001)."},{"key":"14_CR12","unstructured":"M.A. Salido and F. Barber, \u2018POLYSA: A polinomial algorithm for non-binary constraint satisfaction problems with \u2266 and <>\u2019, In Proceeding of EPIA-2001 Worshop on Constraint Satisfaction and Operation Research (CSOR01), 99\u2013113, (2001)."},{"key":"14_CR13","first-page":"405","volume":"1","author":"M.A. Salido","year":"2001","unstructured":"M.A. Salido, A. Giret, and F. Barber, \u2018Constraint satisfaction by means of dynamic polyhedra\u2019, In Operational Research Proceedings 2001, Springer Verlag, 1, 405\u2013412, (2001).","journal-title":"In Operational Research Proceedings 2001"},{"key":"14_CR14","first-page":"313","volume":"1","author":"M.A. Salido","year":"2001","unstructured":"M.A. Salido, A. Giret, and F. Barber, \u2018A non-binary constraint satisfaction solver: The One-Face Hyperpolyhedron Heuristic\u2019, Research and Development in Intelligent Systems XVIII, Springer Verlag, 1, 313\u2013324, (2001).","journal-title":"Research and Development in Intelligent Systems XVIII"},{"key":"14_CR15","unstructured":"M.A. Salido, A. Giret, and F. Barber, \u2018Integration of Discrete and Non-binary CSPs with Linear Programming Techniques\u2019, To appear in Proc. of CP-2002 Workshop on Cooperative Solvers in Constraint Programming, (2002)."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(85)90076-6","volume":"20","author":"E. Sontag","year":"1985","unstructured":"E. Sontag, \u2018Real addition and the polynomial time hierarchy\u2019, Information Processing Letter, 20, 115\u2013120, (1985).","journal-title":"Information Processing Letter"},{"key":"14_CR17","volume-title":"Foundation of Constraint Satisfaction","author":"E. Tsang","year":"1993","unstructured":"E. Tsang, Foundation of Constraint Satisfaction, Academic Press, London and San Diego, 1993."}],"container-title":["Lecture Notes in Computer Science","Topics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36079-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:18:53Z","timestamp":1556464733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36079-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000112","9783540360797"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36079-4_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}