{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:58:34Z","timestamp":1648648714091},"reference-count":14,"publisher":"Informa UK Limited","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Applied Artificial Intelligence"],"DOI":"10.1080\/08839514.2017.1279110","type":"journal-article","created":{"date-parts":[[2017,2,22]],"date-time":"2017-02-22T11:14:17Z","timestamp":1487762057000},"page":"1-19","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial and Extensible Solutions in Lock-Chart Solving"],"prefix":"10.1080","author":[{"given":"Radom\u00edr","family":"\u010cernoch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Ku\u017eelka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"\u017delezn\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2017,2,22]]},"reference":[{"key":"CIT0001","first-page":"365","volume":"94","author":"Berman P.","year":"1994","journal-title":"Soda"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.02.001"},{"key":"CIT0003","volume-title":"Belief maintenance in dynamic constraint networks","author":"Dechter R.","year":"1988"},{"key":"CIT0004","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"An Extensible SAT-solver. In: Giunchiglia E., Tacchella A. (eds) Theory and Applications of Satisfiability Testing. SAT 2003. Lecture Notes in Computer Science, vol 2919. Springer, Berlin, Heidelberg.","author":"E\u00e9n N.","year":"2004"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90004-H"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxm056"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523693"},{"key":"CIT0009","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/3-540-49481-2_20","volume":"1520","author":"Junker U.","year":"1999","journal-title":"Prin- Ciples and Practice of Constraint Programming"},{"key":"CIT0010","unstructured":"Lawer, A. 2004. Calculation of lock systems. Master\u2019s thesis, Royal Institute of Technology."},{"key":"CIT0011","unstructured":"Lhomme, O., and J.C. R\u00e9gin. 2005. A fast arc consistency algorithm for n-ary constraints. Proceedings of the 20th National Conference on Artificial Intelligence - Volume 1, AAAI\u201905, 405\u201310. AAAI Press, Pittsburgh, Pennsylvania."},{"key":"CIT0012","unstructured":"Mackworth, A. K. 1977. On reading sketch maps. Proceedings of the 5th International Joint Conference on Artificial Intelligence - Volume 2, IJCAI\u201977, San Francisco, CA, USA, Morgan Kaufmann Publishers Inc, 598\u2013606."},{"key":"CIT0013","volume-title":"Choco documentation","author":"Prud\u2019homme C.","year":"2015"},{"key":"CIT0014","volume-title":"Handbook of constraint programming","author":"Rossi F.","year":"2006"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1137\/0206038"}],"container-title":["Applied Artificial Intelligence"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T20:01:25Z","timestamp":1568836885000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/08839514.2017.1279110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,22]]},"references-count":14,"alternative-id":["10.1080\/08839514.2017.1279110"],"URL":"https:\/\/doi.org\/10.1080\/08839514.2017.1279110","relation":{},"ISSN":["0883-9514","1087-6545"],"issn-type":[{"value":"0883-9514","type":"print"},{"value":"1087-6545","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,22]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uaai20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uaai20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}