{"id":"https://openalex.org/W2612887001","doi":"https://doi.org/10.29007/1g5q","title":"Matching Qualitative Constraint Networks with Online Reinforcement Learning","display_name":"Matching Qualitative Constraint Networks with Online Reinforcement Learning","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2612887001","doi":"https://doi.org/10.29007/1g5q","mag":"2612887001"},"language":"en","primary_location":{"id":"doi:10.29007/1g5q","is_oa":true,"landing_page_url":"https://doi.org/10.29007/1g5q","pdf_url":"https://easychair.org/publications/open/TJF","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/TJF","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000566262","display_name":"Malumbo Chipofya","orcid":"https://orcid.org/0000-0001-8061-6339"},"institutions":[{"id":"https://openalex.org/I4210161783","display_name":"GeoInformation (United Kingdom)","ror":"https://ror.org/05t4zqc79","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210161783"]},{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE","GB"],"is_corresponding":true,"raw_author_name":"Malumbo Chipofya","raw_affiliation_strings":["Institut fr Geoinformatik Westflische Wilhelms-Universitt Mnster Mnster, Germany","Institut f\u00fcr Geoinformatik Westf\u00e4lische Wilhelms-Universit\u00e4t M\u00fcnster M\u00fcnster, Germany"],"affiliations":[{"raw_affiliation_string":"Institut fr Geoinformatik Westflische Wilhelms-Universitt Mnster Mnster, Germany","institution_ids":["https://openalex.org/I4210161783"]},{"raw_affiliation_string":"Institut f\u00fcr Geoinformatik Westf\u00e4lische Wilhelms-Universit\u00e4t M\u00fcnster M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000566262"],"corresponding_institution_ids":["https://openalex.org/I22465464","https://openalex.org/I4210161783"],"apc_list":null,"apc_paid":null,"fwci":0.3691,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61655981,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"41","issue":null,"first_page":"266","last_page":"251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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.9998999834060669,"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.9955000281333923,"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.993399977684021,"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/heuristics","display_name":"Heuristics","score":0.800766110420227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7097127437591553},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6429882645606995},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.587602972984314},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4182341694831848},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4159734845161438},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4155368208885193},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.41312381625175476},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4118889570236206},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3662862181663513},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1561373472213745}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.800766110420227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7097127437591553},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6429882645606995},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.587602972984314},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4182341694831848},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4159734845161438},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4155368208885193},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.41312381625175476},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4118889570236206},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3662862181663513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1561373472213745},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/1g5q","is_oa":true,"landing_page_url":"https://doi.org/10.29007/1g5q","pdf_url":"https://easychair.org/publications/open/TJF","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.29007/1g5q","is_oa":true,"landing_page_url":"https://doi.org/10.29007/1g5q","pdf_url":"https://easychair.org/publications/open/TJF","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2612887001.pdf","grobid_xml":"https://content.openalex.org/works/W2612887001.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W41554520","https://openalex.org/W85631447","https://openalex.org/W207038862","https://openalex.org/W1548867233","https://openalex.org/W1596930516","https://openalex.org/W1597095978","https://openalex.org/W1939065686","https://openalex.org/W1984217603","https://openalex.org/W1995219079","https://openalex.org/W2024780670","https://openalex.org/W2025364155","https://openalex.org/W2043242772","https://openalex.org/W2045179650","https://openalex.org/W2116537119","https://openalex.org/W2148179544","https://openalex.org/W2158256890","https://openalex.org/W2405830163","https://openalex.org/W4214717370","https://openalex.org/W6660744307","https://openalex.org/W6682759379"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W1690653314","https://openalex.org/W1483279355","https://openalex.org/W2257516073","https://openalex.org/W2107731844","https://openalex.org/W1976289370"],"abstract_inverted_index":{"Local":[0],"Compatibility":[1],"Matrices":[2],"(LCMs)":[3],"are":[4,13],"mechanisms":[5],"for":[6,9,16],"computing":[7],"heuristics":[8],"graph":[10],"matching":[11,17,42,59],"that":[12,89,119],"particularly":[14],"suited":[15],"qualitative":[18,25,29],"constraint":[19],"networks":[20],"enabling":[21],"the":[22,56,70,74,77,82,95,100,111,126],"transfer":[23],"of":[24,36,55,58,62,76,110,131],"spatial":[26],"knowledge":[27],"between":[28],"reasoning":[30],"systems":[31],"or":[32],"agents.":[33],"A":[34],"system":[35],"LCMs":[37],"can":[38],"be":[39],"used":[40],"during":[41],"to":[43,93],"compute":[44],"a":[45,51,60,65,86,121],"pre-move":[46],"evaluation,":[47],"which":[48,68],"acts":[49],"as":[50],"prior":[52,71,96],"optimistic":[53],"estimate":[54,72],"value":[57,79],"pair":[61],"nodes,":[63],"and":[64,128],"post-move":[66],"evaluation":[67],"adjusts":[69],"in":[73],"direction":[75],"true":[78],"upon":[80],"completing":[81],"move.":[83],"We":[84,114],"present":[85,116],"metaheuristic":[87],"method":[88],"uses":[90],"reinforcement":[91],"learning":[92],"improve":[94],"estimates":[97],"based":[98],"on":[99],"posterior":[101],"evaluation.":[102],"The":[103],"learned":[104],"values":[105],"implicitly":[106],"identify":[107],"unprofitable":[108],"regions":[109],"search":[112],"space.":[113],"also":[115],"data":[117],"structures":[118],"allow":[120],"more":[122],"compact":[123],"implementation,":[124],"limiting":[125],"space":[127],"time":[129],"complexity":[130],"our":[132],"algorithm.":[133]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}