{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:23:58Z","timestamp":1725582238421},"publisher-location":"London","reference-count":25,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852337803"},{"type":"electronic","value":"9780857294128"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-0-85729-412-8_24","type":"book-chapter","created":{"date-parts":[[2011,4,30]],"date-time":"2011-04-30T03:16:34Z","timestamp":1304133394000},"page":"323-335","source":"Crossref","is-referenced-by-count":1,"title":["Constraint Relaxation Techniques to Aid the Reuse of Knowledge Bases and Problem Solvers"],"prefix":"10.1007","author":[{"given":"Tomas","family":"Nordlander","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derek","family":"Sleeman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","first-page":"155","volume":"4","author":"S White","year":"2000","unstructured":"White, S. & Sleeman, D., A Constraint-Based Approach to the Description & Detection of Fitness-for-Purpose, ETAI, vol. 4, pp. 155\u2013183,2000.","journal-title":"ETAI"},{"key":"24_CR2","first-page":"21","volume-title":"Providing Advice on the Acquisition and Reuse of Knowledge Bases in Problem Solving, 11th Banff Knowledge Acquisition Workshop","author":"S White","year":"1998","unstructured":"White, S. & Sleeman, D., Providing Advice on the Acquisition and Reuse of Knowledge Bases in Problem Solving, 11th Banff Knowledge Acquisition Workshop. SRDG Publications, Calgary Canada, 1998, pp. 21."},{"key":"24_CR3","unstructured":"AKT, Reuse Knowledge, [WWW],Available from: \n                  http:\/\/www.aktors.org\/publications\/reuse\/\n                  \n                , [Accessed 1 June 2003]."},{"key":"24_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3228-6","volume-title":"Case-BasedReasoning","author":"J Kolodner","year":"1993","unstructured":"Kolodner, J., Case-BasedReasoning. San Mateo, CA: Morgan Kaufinann, 1993."},{"key":"24_CR5","volume-title":"Building Expert Systems","author":"F Hayes-Roth","year":"1983","unstructured":"Hayes-Roth, F., Waterman, D. & Lenat, D., Building Expert Systems. London: Addison-Wesley, 1983."},{"key":"24_CR6","first-page":"314","volume-title":"Experience using EMYCIN. In Rule-Based Expert Systems","author":"J Bennett","year":"1983","unstructured":"Bennett, J. & Engelmore, R., Experience using EMYCIN. In Rule-Based Expert Systems, in Experience using EMYCIN. In Rule-Based Expert Systems, B. Buchanan and E. Shortliffe, Eds. London: Addison-Wesley, 1983, pp. 314\u2013328."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1071-5819(02)00127-1","volume":"58","author":"JH Gennari","year":"2003","unstructured":"Gennari J. H., Musen, M. A., Fergerson, R., et al., The Evolution of Prot\u00e9g\u00e9: An Environment for Knowledge-Based Systems Development., International Journal ofHuman-Computer Studies, vol. 58, pp. 89\u2013123, 2003.","journal-title":"International Journal ofHuman-Computer Studies"},{"key":"24_CR8","unstructured":"Bartak, R., Online Guide to Constraint Programming, [WWW], Available from: \n                  http:\/\/kti.ms.mff.cuni.cz\/-bartak\/constraintslbinarv.html\n                  \n                \/-bartak\/constraintslbinarv.html, [Accessed March 2003 1998]."},{"key":"24_CR9","volume-title":"Foundations of Constraint Satisfaction","author":"E Tsang","year":"1993","unstructured":"Tsang, E., Foundations of Constraint Satisfaction. London & San Diego: Academic Press, 1993."},{"key":"24_CR10","unstructured":"ILOG Solver, 5.3 ed. Paris: ILOG Inc., \n                  http:\/\/www.ilog.coml.\n                  \n                . 2003"},{"key":"24_CR11","unstructured":"SICStus Prolog, 3.9.1 ed. Kista: Swedish Institute of Computer Science, \n                  http:\/\/www.sics.se\/sicstus\/.\n                  \n                \/sicstus\/. 2001"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Freuder, E., Synthesizing constraint expressions, CACM, 1978, pp. 958\u2013966.","DOI":"10.1145\/359642.359654"},{"key":"24_CR13","first-page":"2170","volume":"58","author":"E Freuder","year":"1992","unstructured":"Freuder, E. & Wallace, R., Partial Constraint Satisfaction, Artificial Intelligence, vol. 58, pp. 2170, 1992.","journal-title":"Artificial Intelligence"},{"key":"24_CR14","unstructured":"Bistarelli, S., Montanari, U. & Rossi, F., Constraint Solving over Semirings, IJCAI\u201995, 1995, pp. 624\u2013630."},{"key":"24_CR15","unstructured":"Schiex, T., Fargier, H. & Verfaillie, G., Valued Constraint Satisfaction Problems: hard and easy problems, IJCAI\u201995, 1995, pp. 631\u2013637."},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Hooker, J., Logic-based methods for optimization: combining optimization and constraint satisfaction. New York, 2000, pp. 209.","DOI":"10.1002\/9781118033036"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"MacIntyre, E., Prosser, P., Smith, B., et al., Random Constraint Satisfaction: Theory meets Practice, CP-98, 1998, pp. 325\u2013339.","DOI":"10.1007\/3-540-49481-2_24"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(02)00210-2","volume":"140","author":"F Bacchus","year":"2002","unstructured":"Bacchus, F., Chen, X., Beek, P. V., et al., Binary vs. non-binary constraints, Artificial Intelligence, vol. 140, pp. 1\u201337, 2002.","journal-title":"Artificial Intelligence"},{"key":"24_CR19","unstructured":"Prosser, P., Binary constraint satisfaction problems: Some are harder than others, Proceedings ECAI-94 (11 th European Conference on Artificial Intelligence), 1994, pp. 95\u201399."},{"key":"24_CR20","unstructured":"CSP-Suite, 1.90 ed. Aberdeen: University of Aberdeen, \n                  http:\/\/www.csd.abdn.ac.uk\/-tnordlanIProglog%20programs\n                  \n                \/-tnordlanIProglog%20programs. 2002"},{"key":"24_CR21","unstructured":"SICStus, Constraint Logic Programming over Finite Domains, in SICStus Prolog User\u2019s Manual, vol. Release 3.9.1, R. 3.9.1, Ed. Kista: Intelligent Systems Laboratory Swedish Institute ofComputer Science, 2002, pp. 345\u2013381."},{"key":"24_CR22","unstructured":"Nordlander, T., First Year Report, Aberdeen University, 2002."},{"key":"24_CR23","unstructured":"Walsh, T., Search on high degree graphs, IJCAl-2001, 2001, pp. 266\u2013274."},{"key":"24_CR24","unstructured":"Rajpathak, D., Motta, E. & Roy, R., The Generic Task Ontology For Scheduling Applications, International Conference on Artificial Intelligence, Las Vegas, 2001."},{"key":"24_CR25","unstructured":"Smith, S. F. & Becker, M. A., An Ontology for Constructing Scheduling Systems, AAAI Symposium on Ontological Engineering, Mars 1997."}],"container-title":["Research and Development in Intelligent Systems XX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-85729-412-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T22:21:21Z","timestamp":1605651681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-85729-412-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9781852337803","9780857294128"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-0-85729-412-8_24","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}