{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:58Z","timestamp":1725663778499},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578116"},{"type":"electronic","value":"9783540483373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57811-0_12","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:23:37Z","timestamp":1330262617000},"page":"136-151","source":"Crossref","is-referenced-by-count":0,"title":["Dynamization of backtrack-free search for the constraint satisfaction problem"],"prefix":"10.1007","author":[{"given":"Daniele","family":"Frigioni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umberto","family":"Nanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"12_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, Reading, MA, 1974."},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0215029","volume":"15","author":"G. Ausiello","year":"1986","unstructured":"G. Ausiello, A. D'Atri, D. Sacc\u00e0. Minimal representation of directed Hypergraphs. SIAM J. Comput., 15:418\u2013431, 1986.","journal-title":"SIAM J. Comput."},{"key":"12_CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"C. Berge. Graphs and Hypergraphs. North Holland, Amsterdam, 1973."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"R. Detcher. Enhancement schemes for constraint processing: Backjumping, Learning and Cutset decomposition. Artificial Intelligence, 41, 1989.","DOI":"10.1016\/0004-3702(90)90046-3"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"R. Detcher, J. Pearl. Network based heuristic for constraint satisfaction problems. Artificial Intelligence, 34, 1988.","DOI":"10.1016\/0004-3702(87)90002-6"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/359642.359654","volume":"21","author":"E. C. Freuder","year":"1978","unstructured":"E. C. Freuder. Synthesizing constraint expression. Commun. ACM, 21, 11, 1978.","journal-title":"Commun. ACM"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322290.322292","volume":"29","author":"E. C. Freuder","year":"1982","unstructured":"E. C. Freuder. A sufficient condition for Backtrack-free search. J. ACM, 29, 1, 1982.","journal-title":"J. ACM"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/4221.4225","volume":"32","author":"E. C. Freuder","year":"1985","unstructured":"E. C. Freuder. A sufficient condition for Backtrack-bounded search. J. ACM, 32, 4, 1985.","journal-title":"J. ACM"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"E. C. Freuder, A. K. Mackworth. The complexity of some polynomial network consistency algorithms for Constraint Satisfaction Problems. Artificial Intelligence, 25, 1985.","DOI":"10.1016\/0004-3702(85)90041-4"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8, 1977.","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"U. Montanari. Network of constraints: fundamental properties and application to picture processing. Information Science, 7:95\u2013132, 1974.","journal-title":"Information Science"},{"key":"12_CR12","volume-title":"Lecture Notes in Computer Science, 291","author":"U. Montanari","year":"1986","unstructured":"U. Montanari, F. Rossi. An efficient algorithm for the solution of hierarchical networks of constraints. Lecture Notes in Computer Science, 291, Springer Verlag, Berlin, 1986."},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/978-1-4613-8788-6_12","volume-title":"Search in Artificial Intelligence","author":"U. Montanari","year":"1988","unstructured":"U. Montanari, F. Rossi. Fundamental properties of networks of constraints: a new formulation. In: L. Kanal and V. Kumar, eds., Search in Artificial Intelligence, Springer Verlag, Berlin, 426\u2013449, 1988."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"U. Montanari, F. Rossi. Constraint relaxation may be perfect, Artificial Intelligence, 48, 1991.","DOI":"10.1016\/0004-3702(91)90059-S"},{"key":"12_CR15","unstructured":"U. Nanni, P. Terrevoli. A fully dynamic data structure for path expressions on dags. R.A.I.R.O. Theoretical Informatics and Applications, to appear. Technical Report ESPRIT-ALCOM."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan. Data structures and network algorithms, volume 44 of CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"12_CR17","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan. Amortized computational complexity. SIAM J. Alg. Disc. Meth., 6:306\u2013318, 1985.","journal-title":"SIAM J. Alg. Disc. Meth."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:14:14Z","timestamp":1605647654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}