{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:53Z","timestamp":1750308113053,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,3,13]],"date-time":"2005-03-13T00:00:00Z","timestamp":1110672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,3,13]]},"DOI":"10.1145\/1066677.1066767","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"388-392","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Limited assignments"],"prefix":"10.1145","author":[{"given":"Roman","family":"Bart\u00e1k","sequence":"first","affiliation":[{"name":"Charles University, Prague, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hana","family":"Rudov\u00e1","sequence":"additional","affiliation":[{"name":"Masaryk University, Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,3,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Bart Selman. Generating Satisfiable Problem Instances. In Proceedings of National Conference on Artificial Intelligence (AAAI-2000)","author":"Achlioptas Dimitris","year":"2000","unstructured":"Dimitris Achlioptas , Carla Gomes , Henry Kautz , and Bart Selman. Generating Satisfiable Problem Instances. In Proceedings of National Conference on Artificial Intelligence (AAAI-2000) . AAAI Press , 2000 , 256--261.]] Dimitris Achlioptas, Carla Gomes, Henry Kautz, and Bart Selman. Generating Satisfiable Problem Instances. In Proceedings of National Conference on Artificial Intelligence (AAAI-2000). AAAI Press, 2000, 256--261.]]"},{"key":"e_1_3_2_1_2_1","first-page":"223","article-title":"A New Approach to Modelling and Solving Minimal Perturbation Problems. In Recent Advances in Constraints, 2003","volume":"3010","author":"Bart\u00e1k Roman","year":"2004","unstructured":"Roman Bart\u00e1k , Tom\u00e1\u0161 M\u00fcller , Hana Rudov\u00e1 . A New Approach to Modelling and Solving Minimal Perturbation Problems. In Recent Advances in Constraints, 2003 . Springer-Verlag LNAI 3010 , 2004 , 223 -- 249 .]] Roman Bart\u00e1k, Tom\u00e1\u0161 M\u00fcller, Hana Rudov\u00e1. A New Approach to Modelling and Solving Minimal Perturbation Problems. In Recent Advances in Constraints, 2003. Springer-Verlag LNAI 3010, 2004, 223--249.]]","journal-title":"Springer-Verlag LNAI"},{"key":"e_1_3_2_1_3_1","volume-title":"D. Partial Search Strategy in CHIP. In 2nd International Conference on Metaheuristics (MIC 97)","author":"Beldiceanu N.","year":"1997","unstructured":"N. Beldiceanu , E. Bourreau , P. Chan , D. Rivreau , D. Partial Search Strategy in CHIP. In 2nd International Conference on Metaheuristics (MIC 97) , 1997 .]] N. Beldiceanu, E. Bourreau, P. Chan, D. Rivreau, D. Partial Search Strategy in CHIP. In 2nd International Conference on Metaheuristics (MIC 97), 1997.]]"},{"key":"e_1_3_2_1_4_1","volume-title":"Programming Languages: Implementations, Logics, and Programming","author":"Carlsson M.","year":"1997","unstructured":"M. Carlsson , G. Ottosson , and B. Carlson . An open-ended finite domain constraint solver . In Programming Languages: Implementations, Logics, and Programming . Springer-Verlag LNCS 1292, 1997 .]] M. Carlsson, G. Ottosson, and B. Carlson. An open-ended finite domain constraint solver. In Programming Languages: Implementations, Logics, and Programming. Springer-Verlag LNCS 1292, 1997.]]"},{"key":"e_1_3_2_1_5_1","volume-title":"Constraint Processing","author":"Dechter R.","year":"2003","unstructured":"R. Dechter . Constraint Processing . Morgan Kaufmann Publishers , 2003 .]] R. Dechter. Constraint Processing. Morgan Kaufmann Publishers, 2003.]]"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of National Conference on Artificial Intelligence. AAAI Press","author":"Matthew","year":"1990","unstructured":"Matthew L. Ginsberg and William D. Harvey. Iterative Broadening . In Proceedings of National Conference on Artificial Intelligence. AAAI Press , 1990 , 216--220.]] Matthew L. Ginsberg and William D. Harvey. Iterative Broadening. In Proceedings of National Conference on Artificial Intelligence. AAAI Press, 1990, 216--220.]]"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"William","year":"1995","unstructured":"William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search . In Proceedings of the International Joint Conference on Artificial Intelligence , 1995 , 607--615.]] William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search. In Proceedings of the International Joint Conference on Artificial Intelligence, 1995, 607--615.]]"},{"key":"e_1_3_2_1_9_1","first-page":"325","article-title":"Random Constraint Satisfaction: theory meets practice. In Michael Maher and Jean-Francois Puget (eds.): Principles and Practice of Constraint Programming - CP98","volume":"1520","author":"MacIntyre Ewan","year":"1998","unstructured":"Ewan MacIntyre , Patrick Prosser , Barbara Smith , and Toby Walsh . Random Constraint Satisfaction: theory meets practice. In Michael Maher and Jean-Francois Puget (eds.): Principles and Practice of Constraint Programming - CP98 . Springer-Verlag LNCS 1520 , 1998 , 325 -- 339 .]] Ewan MacIntyre, Patrick Prosser, Barbara Smith, and Toby Walsh. Random Constraint Satisfaction: theory meets practice. In Michael Maher and Jean-Francois Puget (eds.): Principles and Practice of Constraint Programming - CP98. Springer-Verlag LNCS 1520, 1998, 325--339.]]","journal-title":"Springer-Verlag LNCS"},{"key":"e_1_3_2_1_10_1","unstructured":"Hana Rudov\u00e1. Random Placement Problem. http:\/\/www.fi.muni.cz\/~hanka\/rpp\/ 2002.]]  Hana Rudov\u00e1. Random Placement Problem. http:\/\/www.fi.muni.cz\/~hanka\/rpp\/ 2002.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45157-0_21"}],"event":{"name":"SAC05: The 2005 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Santa Fe New Mexico","acronym":"SAC05"},"container-title":["Proceedings of the 2005 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066677.1066767","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066677.1066767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:13Z","timestamp":1750262893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066677.1066767"}},"subtitle":["a new cutoff strategy for incomplete depth-first search"],"short-title":[],"issued":{"date-parts":[[2005,3,13]]},"references-count":10,"alternative-id":["10.1145\/1066677.1066767","10.1145\/1066677"],"URL":"https:\/\/doi.org\/10.1145\/1066677.1066767","relation":{},"subject":[],"published":{"date-parts":[[2005,3,13]]},"assertion":[{"value":"2005-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}