{"id":"https://openalex.org/W1514298554","doi":null,"title":"Constraint Programming - What is behind?","display_name":"Constraint Programming - What is behind?","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1514298554","mag":"1514298554"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.3515","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.3515","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://kti.ms.mff.cuni.cz/~bartak/html/../downloads/CPDC99.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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","observed_orcids":["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":["Charles University in Prague"],"raw_orcid":"https://orcid.org/0000-0002-6717-8175","affiliations":[{"raw_affiliation_string":"Charles University in Prague","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048241440"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":0.7548,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.73876364,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint-programming","display_name":"constraint programming","score":1.0},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"constraint satisfaction","score":0.984000027179718},{"id":"https://openalex.org/keywords/constraint-satisfaction-algorithms","display_name":"constraint satisfaction algorithms","score":0.7120000123977661},{"id":"https://openalex.org/keywords/constraint-propagation","display_name":"constraint propagation","score":0.7310000061988831},{"id":"https://openalex.org/keywords/consistency-techniques","display_name":"consistency techniques","score":0.9559999704360962},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7760000228881836},{"id":"https://openalex.org/keywords/over-constrained-problems","display_name":"over-constrained problems","score":0.8640000224113464},{"id":"https://openalex.org/keywords/planning-and-scheduling","display_name":"planning and scheduling","score":0.7760000228881836}],"concepts":[{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.9298316240310669},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.8386547565460205},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.7699354887008667},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.7280604243278503},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6139695644378662},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6086174249649048},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5785911679267883},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4957667291164398},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4561232626438141},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45022955536842346},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.4400121569633484},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.4339580535888672},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3431682586669922},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.3421032428741455},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2806614637374878},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22293347120285034},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1936199963092804},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.14334020018577576},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.13375318050384521},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.3515","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.3515","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://kti.ms.mff.cuni.cz/~bartak/html/../downloads/CPDC99.pdf","raw_type":"text"},{"id":"mag:1514298554","doi":null,"is_oa":false,"landing_page_url":"http://ktiml.mff.cuni.cz/~bartak/downloads/CPDC99.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W100691759","https://openalex.org/W125178576","https://openalex.org/W130813729","https://openalex.org/W1589232796","https://openalex.org/W1597474747","https://openalex.org/W1988095917","https://openalex.org/W2043193943","https://openalex.org/W2063727779","https://openalex.org/W2068852367","https://openalex.org/W2072755230","https://openalex.org/W2078404830","https://openalex.org/W2096138715","https://openalex.org/W2119456262","https://openalex.org/W2121766240","https://openalex.org/W2123396057","https://openalex.org/W2132233302","https://openalex.org/W2132575453","https://openalex.org/W2135432705","https://openalex.org/W2137174949","https://openalex.org/W2144931885","https://openalex.org/W2148546044","https://openalex.org/W2152475379","https://openalex.org/W2296513191","https://openalex.org/W2569549435","https://openalex.org/W2608471403","https://openalex.org/W2911701053","https://openalex.org/W4212899374"],"related_works":["https://openalex.org/W2131245595","https://openalex.org/W4252772866","https://openalex.org/W7217025681","https://openalex.org/W2310438587","https://openalex.org/W7097144748","https://openalex.org/W7095249712","https://openalex.org/W4250038907","https://openalex.org/W2974898621","https://openalex.org/W139861349","https://openalex.org/W7098428176"],"abstract_inverted_index":{":":[0],"Constraint":[1],"programming":[2,67,80],"is":[3,29,38],"an":[4,100],"emergent":[5],"software":[6],"technology":[7,64],"for":[8],"declarative":[9],"description":[10],"and":[11,24,53,84,106,109],"effective":[12],"solving":[13,112],"of":[14,22,49,63,89,95,102,111,122],"large,":[15],"particularly":[16],"combinatorial,":[17],"problems":[18],"especially":[19],"in":[20,45,47,81],"areas":[21,48,121],"planning":[23],"scheduling.":[25],"Not":[26],"only":[27],"it":[28,37],"based":[30],"on":[31,72],"a":[32,61],"strong":[33],"theoretical":[34],"foundation":[35],"but":[36],"attracting":[39],"widespread":[40],"commercial":[41],"interest":[42],"as":[43],"well,":[44],"particular,":[46],"modelling":[50],"heterogeneous":[51],"optimisation":[52],"satisfaction":[54,74,105],"problems.":[55,75,114],"In":[56,91],"the":[57,78,86,92,96],"paper":[58],"we":[59,98],"give":[60,99],"survey":[62],"behind":[65],"constraint":[66,73,79,104,123,126,131],"(CP)":[68],"with":[69],"particular":[70],"emphasis":[71],"We":[76,115],"place":[77],"history":[82],"context":[83],"highlight":[85],"interdisciplinary":[87],"character":[88],"CP.":[90],"main":[93,119],"part":[94],"paper,":[97],"overview":[101],"basic":[103],"optimization":[107,133],"algorithms":[108],"methods":[110],"over-constrained":[113],"also":[116],"list":[117],"some":[118],"application":[120],"programming.":[124],"Keywords:":[125],"satisfaction,":[127],"search,":[128],"consistency":[129],"techniques,":[130],"propagation,":[132],"1...":[134]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}