{"id":"https://openalex.org/W2083523511","doi":"https://doi.org/10.1017/s0269888910000202","title":"New trends in constraint satisfaction, planning, and scheduling: a survey","display_name":"New trends in constraint satisfaction, planning, and scheduling: a survey","publication_year":2010,"publication_date":"2010-08-23","ids":{"openalex":"https://openalex.org/W2083523511","doi":"https://doi.org/10.1017/s0269888910000202","mag":"2083523511"},"language":"en","primary_location":{"id":"doi:10.1017/s0269888910000202","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269888910000202","pdf_url":null,"source":{"id":"https://openalex.org/S137506714","display_name":"The Knowledge Engineering Review","issn_l":"0269-8889","issn":["0269-8889","1469-8005"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Knowledge Engineering Review","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048241440","display_name":"Roman Bart\u00e1k","orcid":"https://orcid.org/0000-0002-6717-8175"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Roman Bart\u00e1k","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University in Prague, Malostransk\u00e9 n\u00e1m. 2/25, 118 00 Praha 1, Czech Republic; e-mail:","Faculty of Mathematics and Physics, Charles University in Prague, Malostransk\u00e9 n\u00e1m. 2/25, 118 00 Praha 1, Czech Republic","e-mail:"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University in Prague, Malostransk\u00e9 n\u00e1m. 2/25, 118 00 Praha 1, Czech Republic; e-mail:","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University in Prague, Malostransk\u00e9 n\u00e1m. 2/25, 118 00 Praha 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"e-mail:","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010042002","display_name":"Miguel \u00c1. Salido","orcid":"https://orcid.org/0000-0002-4835-4057"},"institutions":[{"id":"https://openalex.org/I4210134847","display_name":"Centro Tecnol\u00f3gico de Investigaci\u00f3n, Desarrollo e Innovaci\u00f3n en tecnolog\u00edas de la Informaci\u00f3n y las Comunicaciones (TIC)","ror":"https://ror.org/02s69db58","country_code":"ES","type":"nonprofit","lineage":["https://openalex.org/I4210134847"]},{"id":"https://openalex.org/I60053951","display_name":"Universitat Polit\u00e8cnica de Val\u00e8ncia","ror":"https://ror.org/01460j859","country_code":"ES","type":"education","lineage":["https://openalex.org/I60053951"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Miguel A. Salido","raw_affiliation_strings":["Instituto de Autom\u00e1tica e Inform\u00e1tica Industrial, Universidad Polit\u00e9cnica de Valencia, Camino de vera s/n 46020, Valencia, Spain; e-mail:","Instituto de Autom\u00e1tica e Inform\u00e1tica Industrial, Universidad Polit\u00e9cnica de Valencia, Camino de vera s/n 46020, Valencia, Spain","e-mail:"],"affiliations":[{"raw_affiliation_string":"Instituto de Autom\u00e1tica e Inform\u00e1tica Industrial, Universidad Polit\u00e9cnica de Valencia, Camino de vera s/n 46020, Valencia, Spain; e-mail:","institution_ids":["https://openalex.org/I60053951","https://openalex.org/I4210134847"]},{"raw_affiliation_string":"Instituto de Autom\u00e1tica e Inform\u00e1tica Industrial, Universidad Polit\u00e9cnica de Valencia, Camino de vera s/n 46020, Valencia, Spain","institution_ids":["https://openalex.org/I60053951"]},{"raw_affiliation_string":"e-mail:","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000527699","display_name":"Francesca Rossi","orcid":"https://orcid.org/0000-0001-8898-219X"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]},{"id":"https://openalex.org/I4210157811","display_name":"Centro di Ricerca in Matematica Pura ed Applicata","ror":"https://ror.org/04fv5g904","country_code":"IT","type":"nonprofit","lineage":["https://openalex.org/I4210157811"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Francesca Rossi","raw_affiliation_strings":["Dipartimento di Matematica Pura ed Applicata, Universit\u00e1 di Padova, Via Trieste 63, 35121 Padova, Italy; e-mail:","e-mail:","Dipartimento di Matematica Pura ed Applicata, Universit\u00e1 di Padova, Via Trieste 63, 35121 Padova, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica Pura ed Applicata, Universit\u00e1 di Padova, Via Trieste 63, 35121 Padova, Italy; e-mail:","institution_ids":["https://openalex.org/I138689650","https://openalex.org/I4210157811"]},{"raw_affiliation_string":"e-mail:","institution_ids":[]},{"raw_affiliation_string":"Dipartimento di Matematica Pura ed Applicata, Universit\u00e1 di Padova, Via Trieste 63, 35121 Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000527699","https://openalex.org/A5010042002","https://openalex.org/A5048241440"],"corresponding_institution_ids":["https://openalex.org/I138689650","https://openalex.org/I21250087","https://openalex.org/I4210134847","https://openalex.org/I4210157811","https://openalex.org/I60053951"],"apc_list":null,"apc_paid":null,"fwci":3.7191,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.93361388,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"25","issue":"3","first_page":"249","last_page":"279"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9876999855041504,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.7626749277114868},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6350909471511841},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6314935684204102},{"id":"https://openalex.org/keywords/automated-planning-and-scheduling","display_name":"Automated planning and scheduling","score":0.5902788043022156},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5520716309547424},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.48650044202804565},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4497773051261902},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.4264855682849884},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42187464237213135},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.41992878913879395},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.3841571807861328},{"id":"https://openalex.org/keywords/industrial-engineering","display_name":"Industrial engineering","score":0.3628399968147278},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3481370210647583},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2607501745223999},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.15668228268623352},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1515595018863678}],"concepts":[{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.7626749277114868},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6350909471511841},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6314935684204102},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.5902788043022156},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5520716309547424},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.48650044202804565},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4497773051261902},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4264855682849884},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42187464237213135},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.41992878913879395},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.3841571807861328},{"id":"https://openalex.org/C13736549","wikidata":"https://www.wikidata.org/wiki/Q4489420","display_name":"Industrial engineering","level":1,"score":0.3628399968147278},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3481370210647583},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2607501745223999},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.15668228268623352},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1515595018863678},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0269888910000202","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269888910000202","pdf_url":null,"source":{"id":"https://openalex.org/S137506714","display_name":"The Knowledge Engineering Review","issn_l":"0269-8889","issn":["0269-8889","1469-8005"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Knowledge Engineering Review","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.306.9870","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.9870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.dsic.upv.es/~msalido/papers/KER-SALIDO.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":109,"referenced_works":["https://openalex.org/W4789806","https://openalex.org/W11305597","https://openalex.org/W47957325","https://openalex.org/W121593559","https://openalex.org/W125130877","https://openalex.org/W183136686","https://openalex.org/W1484780672","https://openalex.org/W1487478819","https://openalex.org/W1487483459","https://openalex.org/W1488422606","https://openalex.org/W1489183362","https://openalex.org/W1490499382","https://openalex.org/W1501066815","https://openalex.org/W1508419498","https://openalex.org/W1512327467","https://openalex.org/W1512541792","https://openalex.org/W1513818038","https://openalex.org/W1517248951","https://openalex.org/W1526788855","https://openalex.org/W1527987966","https://openalex.org/W1535560884","https://openalex.org/W1545562596","https://openalex.org/W1545688112","https://openalex.org/W1548650523","https://openalex.org/W1559427309","https://openalex.org/W1589232796","https://openalex.org/W1597474747","https://openalex.org/W1597732331","https://openalex.org/W1606408728","https://openalex.org/W1614026214","https://openalex.org/W1667362966","https://openalex.org/W1733011895","https://openalex.org/W1733489975","https://openalex.org/W1760227883","https://openalex.org/W1964636930","https://openalex.org/W1980098990","https://openalex.org/W1988095917","https://openalex.org/W1992721217","https://openalex.org/W2001897285","https://openalex.org/W2002478775","https://openalex.org/W2011800728","https://openalex.org/W2020459421","https://openalex.org/W2024182184","https://openalex.org/W2025460523","https://openalex.org/W2028613991","https://openalex.org/W2043100293","https://openalex.org/W2043829066","https://openalex.org/W2049934619","https://openalex.org/W2061734130","https://openalex.org/W2061742563","https://openalex.org/W2063515892","https://openalex.org/W2068852367","https://openalex.org/W2073032446","https://openalex.org/W2087393302","https://openalex.org/W2088304441","https://openalex.org/W2096138715","https://openalex.org/W2096750140","https://openalex.org/W2098333147","https://openalex.org/W2099266627","https://openalex.org/W2102016680","https://openalex.org/W2102433499","https://openalex.org/W2107766840","https://openalex.org/W2114199233","https://openalex.org/W2114660707","https://openalex.org/W2119227482","https://openalex.org/W2119815134","https://openalex.org/W2120647900","https://openalex.org/W2122967269","https://openalex.org/W2130182605","https://openalex.org/W2133212815","https://openalex.org/W2148546044","https://openalex.org/W2154339894","https://openalex.org/W2157740753","https://openalex.org/W2159140800","https://openalex.org/W2161414194","https://openalex.org/W2161484642","https://openalex.org/W2212585515","https://openalex.org/W2294663333","https://openalex.org/W2295268496","https://openalex.org/W2337098149","https://openalex.org/W2337392266","https://openalex.org/W2341350247","https://openalex.org/W2402164836","https://openalex.org/W2426452510","https://openalex.org/W2491415491","https://openalex.org/W2497660909","https://openalex.org/W2615497679","https://openalex.org/W2886362482","https://openalex.org/W2984454117","https://openalex.org/W3023057973","https://openalex.org/W3044911583","https://openalex.org/W3101355526","https://openalex.org/W3121020235","https://openalex.org/W4230781079","https://openalex.org/W4231165118","https://openalex.org/W4231314381","https://openalex.org/W4234582748","https://openalex.org/W4235170780","https://openalex.org/W4252785764","https://openalex.org/W4254292280","https://openalex.org/W4285719527","https://openalex.org/W6600439005","https://openalex.org/W6635490985","https://openalex.org/W6636950635","https://openalex.org/W6637515170","https://openalex.org/W6666479396","https://openalex.org/W6681680402","https://openalex.org/W6697572930","https://openalex.org/W6817016471"],"related_works":["https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W4303044088","https://openalex.org/W1550482496","https://openalex.org/W2141935412","https://openalex.org/W1486916474","https://openalex.org/W115413730","https://openalex.org/W2032348095","https://openalex.org/W2495408185"],"abstract_inverted_index":{"Abstract":[0],"During":[1],"recent":[2],"years,":[3],"the":[4,51,61,77],"development":[5],"of":[6,55,70,79],"new":[7],"techniques":[8,30],"for":[9],"constraint":[10,45,80,98],"satisfaction,":[11,46],"planning,":[12,47,95],"and":[13,19,48,64,66,84,86,97],"scheduling":[14,49],"has":[15,22],"received":[16],"increased":[17],"attention,":[18],"substantial":[20],"effort":[21],"been":[23],"invested":[24],"in":[25,82],"trying":[26],"to":[27,31,34,94],"exploit":[28],"such":[29,72],"find":[32],"solutions":[33],"real-life":[35],"problems.":[36],"In":[37,57],"this":[38],"paper,":[39],"we":[40,59],"present":[41,60],"a":[42],"survey":[43],"on":[44],"from":[50],"Artificial":[52],"Intelligence":[53],"point":[54],"view.":[56],"particular,":[58],"main":[62],"definitions":[63],"techniques,":[65],"discuss":[67],"possible":[68],"ways":[69],"integrating":[71],"techniques.":[73],"We":[74],"also":[75],"analyze":[76],"role":[78],"satisfaction":[81],"planning":[83],"scheduling,":[85,96],"hint":[87],"at":[88],"some":[89],"open":[90],"research":[91],"issues":[92],"related":[93],"satisfaction.":[99]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}