{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T04:02:24Z","timestamp":1747627344433,"version":"3.40.5"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Intelligence"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1023\/a:1011242703014","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T09:18:21Z","timestamp":1040635101000},"page":"263-272","source":"Crossref","is-referenced-by-count":2,"title":["State Space Search with Prioritised Soft Constraints"],"prefix":"10.1007","volume":"14","author":[{"given":"Natasha","family":"Alechina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Logan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"335003_CR1","unstructured":"C. Campbell, R. Hull, E. Root, and L. Jackson, \u201cRoute planning in CCTT,\u201d in Proceedings of the Fifth Conference on Computer Generated Forces and Behavioural Representation, Institute for Simulation and Training, 1995, pp. 233-244."},{"issue":"2","key":"335003_CR2","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"SSC-4","author":"P.E. Hart","year":"1968","unstructured":"P.E. Hart, N.J. Nilsson, and B. Raphael, \u201cA formal basis for the heuristic determination of minimum cost paths,\u201d IEEE Transactions on Systems Science and Cybernetics, vol. SSC-4, no. 2, pp. 100-107, 1968.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"issue":"4","key":"335003_CR3","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/TPAMI.1982.4767270","volume":"4","author":"J. Pearl","year":"1982","unstructured":"J. Pearl, \u201cA\n*\u2209-an algorithm using search effort estimates,\u201d IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 4, no. 4, pp. 392-399, 1982.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"335003_CR4","unstructured":"B. Logan, \u201cRoute planning with ordered constraints,\u201d in Proceedings of the 16thWorkshop of the UK Planning and Scheduling Special Interest Group, University of Durham, Dec. 1997, pp. 133-144."},{"key":"335003_CR5","unstructured":"B. Logan and N. Alechina, \u201cA* with bounded costs,\u201d in Proceedings of the Fifteenth National Conference on Artificial Intelligence, AAAI-98, AAAI, AAAI Press\/MIT Press, 1998, pp. 444-449."},{"key":"335003_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E.C. Freuder","year":"1992","unstructured":"E.C. Freuder and R.J. Wallace, \u201cPartial constraint satisfaction,\u201d Artificial Intelligence, vol. 58, pp. 21-70, 1992.","journal-title":"Artificial Intelligence"},{"key":"335003_CR7","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1145\/115234.115368","volume":"38","author":"B.S. Stewart","year":"1991","unstructured":"B.S. Stewart and C.C. White III, \u201cMultiobjective A*,\u201d Journal of the Association for Computing Machinery, vol. 38, pp. 775-814, 1991.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"335003_CR8","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0377-2217(92)90318-4","volume":"56","author":"C.C. White III","year":"1992","unstructured":"C.C. White III, B.S. Stewart, and R.L. Carraway. \u201cMultiobjective, preference-based search in acyclic or-graphs,\u201d European Journal of Operational Research, vol. 56, pp. 357-363, 1992.","journal-title":"European Journal of Operational Research"},{"key":"335003_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00132735","volume":"6","author":"D. Dubois","year":"1996","unstructured":"D. Dubois, H. Fargier, and H. Prade, \u201cPossibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty,\u201d Applied Intelligence, vol. 6, pp. 287-309, 1996.","journal-title":"Applied Intelligence"},{"key":"335003_CR10","first-page":"631","volume":"1","author":"T. Schiex","year":"1995","unstructured":"T. Schiex, H. Fargier, and G. Verfaillie, \u201cValued constraint satisfaction problems: Hard and easy problems,\u201d in Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, vol. 1, Morgan Kaufmann, 1995, pp. 631-639.","journal-title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95"},{"key":"335003_CR11","unstructured":"H. Kautz and B. Selman, \u201cPushing the envelope: Planning, propositional logic, and stochastic search,\u201d in Proceedings of the Thirteenth National Conference on Artificial Intelligence, AAAI-96, AAAI Press\/MIT Press, 1996, pp. 1194-1201."},{"key":"335003_CR12","unstructured":"V. Liatsos and B. Richards, \u201cLeast commitment-an optimal planning strategy,\u201d in Proceedings of the 16th Workshop of the UK Planning and Scheduling Special Interest Group, University of Durham, Dec. 1997, pp. 119-133."}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011242703014.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011242703014\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011242703014.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:50:50Z","timestamp":1747579850000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011242703014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["335003"],"URL":"https:\/\/doi.org\/10.1023\/a:1011242703014","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}