{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:20:46Z","timestamp":1729660846860,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1109\/icci-cc.2016.7862031","type":"proceedings-article","created":{"date-parts":[[2017,2,24]],"date-time":"2017-02-24T00:38:24Z","timestamp":1487896704000},"page":"167-173","source":"Crossref","is-referenced-by-count":0,"title":["An action guided constraint satisfaction technique for planning problem"],"prefix":"10.1109","author":[{"given":"Xiao","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pingyuan","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ai","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengying","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"585","article-title":"CPlan: A constraint programming approach to planning","author":"van beek","year":"1999","journal-title":"AAAI\/IAAI"},{"key":"ref11","first-page":"263","article-title":"Concurrent Probabilistic Planning in the Graohplan Framework","author":"little","year":"2006","journal-title":"ICAPS"},{"key":"ref12","first-page":"63","article-title":"Efficiently Handling Temporal Knowledge in an HTN Planner","author":"castillo","year":"2006","journal-title":"ICAPS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2699276.2699279"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00128-X"},{"key":"ref15","article-title":"A timeline, event, and constraint-based modeling framework for planning and scheduling problems","author":"verfaillie","year":"2013","journal-title":"Proc Knowledge Engineering for Planning and Scheduling"},{"article-title":"New Bounds for Random Constraint Satisfaction Problems via Spatial Coupling","year":"2013","author":"achlioptas","key":"ref16"},{"key":"ref17","article-title":"Complexity classification in infinite-domain constraint satisfaction","author":"bodirsky","year":"2012","journal-title":"1201 0856"},{"year":"2014","key":"ref18","article-title":"Unweighted stochastic local search can be effective for random CSP benchmarks"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23219-5_30"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6943079"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2015.1137566"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18008-3_28"},{"key":"ref5","first-page":"1194","article-title":"Pushing the envelope: Planning, propositional logic, and stochastic search","author":"kautz","year":"1996","journal-title":"Proceedings of the National Conference on Artificial Intelligence"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2014.06.003"},{"key":"ref7","first-page":"374","article-title":"Encoding plans in propositional logic","volume":"96","author":"kautz","year":"1996","journal-title":"KR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0428-6"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/2728816.2728827","article-title":"Theory in practice for system design and verification","volume":"2","author":"alur","year":"2015","journal-title":"ACM SIGLOG News"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/9781118574522"},{"key":"ref20","article-title":"A CSP Heuristic for AI Planning","author":"judge","year":"2013","journal-title":"Procs of 20th Automated Reasoning Workshop"},{"article-title":"Automated planning: theory & practice","year":"2004","author":"ghallab","key":"ref22"},{"key":"ref21","article-title":"Foundations of Constraint Satisfaction: The Classic Text","author":"tsang","year":"2014","journal-title":"BoD-Books on Demand"},{"key":"ref24","first-page":"78","article-title":"Maintaining generalized are consistency on ad-hoc n-ary boolean constraints","author":"cheng","year":"2006","journal-title":"ECAI"},{"key":"ref23","first-page":"510","article-title":"A path-optimal GAC algorithm for table constraints","author":"lecoutre","year":"2012"}],"event":{"name":"2016 IEEE 15th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","start":{"date-parts":[[2016,8,22]]},"location":"Palo Alto, CA, USA","end":{"date-parts":[[2016,8,23]]}},"container-title":["2016 IEEE 15th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7859033\/7862013\/07862031.pdf?arnumber=7862031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T23:37:11Z","timestamp":1601681831000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7862031\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icci-cc.2016.7862031","relation":{},"subject":[],"published":{"date-parts":[[2016,8]]}}}