{"id":"https://openalex.org/W2591440311","doi":"https://doi.org/10.1080/08839514.2017.1279110","title":"Polynomial and Extensible Solutions in Lock-Chart Solving","display_name":"Polynomial and Extensible Solutions in Lock-Chart Solving","publication_year":2017,"publication_date":"2017-02-22","ids":{"openalex":"https://openalex.org/W2591440311","doi":"https://doi.org/10.1080/08839514.2017.1279110","mag":"2591440311"},"language":"en","primary_location":{"id":"doi:10.1080/08839514.2017.1279110","is_oa":false,"landing_page_url":"https://doi.org/10.1080/08839514.2017.1279110","pdf_url":null,"source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"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/A5084857556","display_name":"Radom\u00edr \u010cernoch","orcid":"https://orcid.org/0000-0002-8442-4315"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Radom\u00edr \u010cernoch","raw_affiliation_strings":["Department of Computer Science, Czech Technical University in Prague, Praha, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Czech Technical University in Prague, Praha, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021262042","display_name":"Ond\u0159ej Ku\u017eelka","orcid":"https://orcid.org/0000-0002-6523-9114"},"institutions":[{"id":"https://openalex.org/I79510175","display_name":"Cardiff University","ror":"https://ror.org/03kk7td41","country_code":"GB","type":"education","lineage":["https://openalex.org/I79510175"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ond\u0159ej Ku\u017eelka","raw_affiliation_strings":["Department of Computer Science, Cardiff University, Cardiff, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cardiff University, Cardiff, UK","institution_ids":["https://openalex.org/I79510175"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062388770","display_name":"Filip \u017delezn\u00fd","orcid":"https://orcid.org/0000-0001-9780-3376"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Filip \u017delezn\u00fd","raw_affiliation_strings":["Department of Computer Science, Czech Technical University in Prague, Praha, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Czech Technical University in Prague, Praha, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084857556"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":{"value":2195,"currency":"USD","value_usd":2195},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03863506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8464004993438721},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.816659688949585},{"id":"https://openalex.org/keywords/lock","display_name":"Lock (firearm)","score":0.5946723818778992},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.554772675037384},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5173022747039795},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5143088102340698},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5086294412612915},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.49934911727905273},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4804525077342987},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.47961387038230896},{"id":"https://openalex.org/keywords/extensibility","display_name":"Extensibility","score":0.46167609095573425},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4181844890117645},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41202524304389954},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32525739073753357},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3188634514808655},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2862483859062195},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12889227271080017}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8464004993438721},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.816659688949585},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.5946723818778992},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.554772675037384},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5173022747039795},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5143088102340698},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5086294412612915},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.49934911727905273},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4804525077342987},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.47961387038230896},{"id":"https://openalex.org/C32833848","wikidata":"https://www.wikidata.org/wiki/Q4115054","display_name":"Extensibility","level":2,"score":0.46167609095573425},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4181844890117645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41202524304389954},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32525739073753357},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3188634514808655},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2862483859062195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12889227271080017},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/08839514.2017.1279110","is_oa":false,"landing_page_url":"https://doi.org/10.1080/08839514.2017.1279110","pdf_url":null,"source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W27267440","https://openalex.org/W47957325","https://openalex.org/W59411647","https://openalex.org/W1518705996","https://openalex.org/W1586970573","https://openalex.org/W1988443389","https://openalex.org/W1994520092","https://openalex.org/W2003665833","https://openalex.org/W2097844290","https://openalex.org/W2141400316","https://openalex.org/W2569549435","https://openalex.org/W6601091264"],"related_works":["https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2354343466","https://openalex.org/W3014398131","https://openalex.org/W3122634451","https://openalex.org/W2997121997","https://openalex.org/W2097415053","https://openalex.org/W1486916474","https://openalex.org/W2495408185"],"abstract_inverted_index":{"Lock-chart":[0],"(also":[1],"known":[2],"as":[3,35,137],"master-key":[4],"system)":[5],"solving":[6],"is":[7,54,73,103,115],"a":[8,26,36,74,84,96,106,112,122,126,142],"process":[9],"for":[10,98,141],"designing":[11],"mechanical":[12,87],"keys":[13,60],"and":[14,22,51,61,63,111],"locks":[15,62],"so":[16],"that":[17],"every":[18],"key":[19],"can":[20],"open":[21],"be":[23],"blocked":[24],"in":[25],"user-defined":[27],"set":[28,109],"of":[29,38,89],"locks.":[30],"We":[31,117],"present":[32],"several":[33],"algorithms":[34,120],"result":[37,72],"our":[39],"3":[40],"years":[41],"industrial":[42],"collaboration":[43],"project,":[44],"chosen":[45],"by":[46],"their":[47],"asymptotic":[48],"time":[49],"complexity":[50],"extensibility,":[52],"which":[53],"the":[55,65,79,101,119],"ability":[56],"to":[57,77,129],"add":[58],"new":[59],"satisfy":[64],"previously":[66],"unforeseen":[67],"blocking":[68],"requirements.":[69],"Our":[70],"strongest":[71],"linear-time":[75],"algorithm":[76],"find":[78],"largest":[80],"diagonal":[81],"lock-chart":[82],"with":[83],"condition":[85],"on":[86,121],"properties":[88],"keys.":[90],"Without":[91],"these":[92],"restrictions,":[93],"but":[94],"given":[95],"solution":[97],"master":[99],"keys,":[100],"problem":[102,110],"translated":[104],"into":[105],"maximum":[107],"independent":[108],"greedy":[113],"approximation":[114],"proposed.":[116],"evaluate":[118],"generated":[123],"dataset":[124],"using":[125],"non-backtracking":[127],"procedure":[128],"simulate":[130],"minimal":[131],"extensions.":[132],"Both":[133],"approaches":[134],"are":[135],"suggested":[136],"heuristics":[138],"or":[139],"subroutines":[140],"backtracking":[143],"constraint":[144],"satisfaction":[145],"problem-based":[146],"(CSP)":[147],"solver.":[148]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}