{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:31:37Z","timestamp":1648953097567},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1007\/bf01531070","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T00:09:06Z","timestamp":1113869346000},"page":"49-73","source":"Crossref","is-referenced-by-count":5,"title":["Interactive scheduling as a constraint satisfiability problem"],"prefix":"10.1007","volume":"1","author":[{"given":"Ronen","family":"Feldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin Charles","family":"Golumbic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1990,9,1]]},"reference":[{"key":"BF01531070_CR1","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/361219.361224","volume":"18","author":"J.R. Bitner","year":"1975","unstructured":"J.R. Bitner and E.M. Reingold, Backtrack programming techniques, Comm. ACM 18 (1975) 651\u2013655.","journal-title":"Comm. ACM"},{"key":"BF01531070_CR2","doi-asserted-by":"crossref","unstructured":"M. Bruynooge, Solving combinatorial search problems by intelligent backtracking, Infor. Process. Lett. 12 (1981).","DOI":"10.1016\/0020-0190(81)90074-0"},{"key":"BF01531070_CR3","unstructured":"R. Feldman and M.C. Golumbic, Optimization algorithms for scheduling via constraint satisfiability, IBM Israel Technical Report (Jan. 1989), submitted for publication."},{"key":"BF01531070_CR4","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1145\/359642.359654","volume":"21","author":"E.C. Freuder","year":"1978","unstructured":"E.C. Freuder, Synthesizing constraint expressions, Comm. ACM 21 (1978) 958\u2013965.","journal-title":"Comm. ACM"},{"key":"BF01531070_CR5","unstructured":"M.C. Golumbic, Knowledge-based techniques in an academic environment,Proc. Int. Conf. on Courseware and Design and Evaluation, Symp. on Artificial Intelligence and Education, Ramat Gan, Israel (April 1986) pp. 355\u2013362."},{"key":"BF01531070_CR6","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/TE.1986.5570612","volume":"E-29","author":"M.C. Golumbic","year":"1986","unstructured":"M.C. Golumbic, M. Markovich, S. Tsur and U.J. Schild, A knowledge-based expert system for student advising, IEEE Trans. Education E-29 (1986) 120\u2013124.","journal-title":"IEEE Trans. Education"},{"key":"BF01531070_CR7","doi-asserted-by":"crossref","unstructured":"M.C. Golumbic, M. Markovich and M. Tiomkin, A knowledge representation language for university requirements, Decision Support Systems 6 (1990).","DOI":"10.1016\/0167-9236(91)90075-M"},{"key":"BF01531070_CR8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"R.M. Haralick and G.L. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence 14 (1980) 263\u2013313.","journal-title":"Artificial Intelligence"},{"key":"BF01531070_CR9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"A.K. Mackworth, Consistency in networks of relations, Artificial Intelligence 8 (1977) 99\u2013118.","journal-title":"Artificial Intelligence"},{"key":"BF01531070_CR10","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, Networks of constraints: Fundamental properties and applications to picture processing, Information Science 7 (1974) 95\u2013132.","journal-title":"Information Science"},{"key":"BF01531070_CR11","unstructured":"S. Nishihara and K. Ikeda, A solution algorithm for the consistent labeling problem using the structure of constraints,Proc. 8th IEEE Int. Conf. on Pattern Recognition, Paris (1986) pp. 198\u2013200."},{"key":"BF01531070_CR12","unstructured":"S. Nishihara, Y. Matsuo and K. Ikeda, Optimization and performance evaluation of inexact consistent labeling problem using merge method, J. Jpn. Soc. Artificial Intelligence (1988) 196\u2013205."},{"key":"BF01531070_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0004-3702(83)80008-3","volume":"21","author":"B. Nudel","year":"1983","unstructured":"B. Nudel, Consistent-labeling problems and their algorithms: expected-complexities and theory-based heuristics, Artificial Intelligence 21 (1983) 135\u2013178.","journal-title":"Artificial Intelligence"},{"key":"BF01531070_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0004-3702(83)80007-1","volume":"21","author":"P.W. Purdom","year":"1983","unstructured":"P.W. Purdom, Search rearrangement backtracking and polynomial average time, Artificial Intelligence 21 (1983) 117\u2013133.","journal-title":"Artificial Intelligence"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01531070\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01531070.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01531070\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01531070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T23:59:44Z","timestamp":1586217584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01531070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":14,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["BF01531070"],"URL":"https:\/\/doi.org\/10.1007\/bf01531070","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}