{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:28:27Z","timestamp":1725474507666},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650805"},{"type":"electronic","value":"9783540496564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0095428","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T09:28:18Z","timestamp":1164360498000},"page":"57-68","source":"Crossref","is-referenced-by-count":1,"title":["Finding regions for local repair in partial constraint satisfaction"],"prefix":"10.1007","author":[{"given":"Harald Meyer","family":"auf\u2019m Hofe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,20]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01807506","volume":"5","author":"A. Borning","year":"1992","unstructured":"Alan Borning, Bjorn Freeman-Benson, and Molly Wilson. constraint hierarchies. Lisp and Symbolic Computation, 5: 233\u2013270, 1992.","journal-title":"Lisp and Symbolic Computation"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E. C. Freuder","year":"1992","unstructured":"Eugene C. Freuder and Rick J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58: 21\u201370, 1992.","journal-title":"Artificial Intelligence"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Philippe Galinier and Jin-Kao Hao. Tabu search for maximal constraint satisfaction problems. In CP-97: Proceedings of the Third International Conference on Principles and Practice of Constraint Processing, volume 1330 of LNCS. Springer Verlag, pages 196\u2013208, 1997.","DOI":"10.1007\/BFb0017440"},{"key":"6_CR4","volume-title":"Finite Domain Constraints: Declarativity meets Efficiency, Theory meets Application","author":"M. Meyer","year":"1994","unstructured":"Manfred Meyer. Finite Domain Constraints: Declarativity meets Efficiency, Theory meets Application. Dissertation, Universit\u00e4t Kaiserslautern, Infix Verlag, Sankt Augustin, 1994."},{"key":"6_CR5","unstructured":"Harald Meyer auf\u2019m Hofe. ConPlan\/SIEDA plan: Personnel assignment as a problem of hierarchical constraint satisfaction. In PACT-97: Proceedings of the Third International Conference on the Practical Application of Constraint Technology, pages 257\u2013272, London, UK, April 1997. Practical Application Company, Ltd."},{"key":"6_CR6","unstructured":"Harald Meyer auf\u2019m Hofe. Finding regions for local repair in hierarchical constraint satisfaction. Research Report RR-97-05, Deutsches Forschungszentrum f\u00fcr K\u00fcnstliche Intelligenz, December 1997."},{"key":"6_CR7","unstructured":"Harald Meyer auf\u2019m Hofe and Andreas Abecker. Zur Verarbeitung \u201cweicher\u201d Constraints. KI-K\u00fcnstliche Intelligenz, (4): 31\u201336, 1997."},{"key":"6_CR8","unstructured":"Harald Meyer auf\u2019m Hofe and Enno Tolzmann. ConPlan\/SIEDAplan: Personaleinsatzplanung als Constraintproblem. KI-K\u00fcnstliche Intelligenz, (1): 37\u201340, 1997."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Steven Minton, Mark Johnston, Andrew Philips, and Philip Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction problem and scheduling problems. Artificial Intelligence, 58: 161\u2013205, 1992.","journal-title":"Artificial Intelligence"},{"key":"6_CR10","unstructured":"Paul Snow and Eugene C. Freuder. Improved relaxation and search methods for approximate constraint satisfaction with a maximin criterion. In Proc. of the 8 th biennal conf. of the canadian society for comput. studies of intelligence, pages 227\u2013230, May 1990."},{"key":"6_CR11","unstructured":"G. Verfaillie and T. Schiex. Solution reuse in dynamic constraint satisfaction problems. In AAAI-94: Proceedings of the 12th national conf. on AI, pages 307\u2013312, Seattle, WA, August 1994. AAAI Press\/The MIT Press."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Richard J. Wallace. Analysis of heuristic methods for partial constraint satisfaction problems. In CP-96: Proceedings of the Second International Conference o Principles and Practice of Constraint Processing, volume 1118 of LNCS. Springer Verlag, pages 482\u2013495, 1996.","DOI":"10.1007\/3-540-61551-2_95"},{"key":"6_CR13","unstructured":"N. Yugami, Y. Ohta, and H. Hara. Improving repair-based constraint satisfaction methods by value propagation. In AAAI-94: Proceedings of the 12th National Conference on Artificial Intelligence, pages 344\u2013349, 1994."}],"container-title":["Lecture Notes in Computer Science","KI-98: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0095428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T10:54:20Z","timestamp":1555930460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0095428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650805","9783540496564"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0095428","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}