{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:11Z","timestamp":1759639031910,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61751207","61732013","61420106004"],"award-info":[{"award-number":["61751207","61732013","61420106004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,10,1]]},"DOI":"10.1109\/tkde.2018.2810144","type":"journal-article","created":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T19:46:13Z","timestamp":1519760773000},"page":"1915-1928","source":"Crossref","is-referenced-by-count":6,"title":["Planning with Spatio-Temporal Search Control Knowledge"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3421-1987","authenticated-orcid":false,"given":"Xu","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5429-4580","authenticated-orcid":false,"given":"Cong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Temporal Logic and Temporal Logic Programming","year":"2005","author":"duan","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9179-9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1129"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/11559306_7"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.07.174"},{"key":"ref30","first-page":"6","article-title":"Smt spatio-temporal planning","volume":"209","author":"belouaer","year":"2010","journal-title":"ICAPS 2012 Workshop Constraint Satisfaction Techn Planning Scheduling Problem (COPLAS 2012)"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.12.003"},{"key":"ref36","first-page":"97","article-title":"A\n decidable fragment of separation logic","author":"berdine","year":"2004","journal-title":"Proc 24th Int Conf Foundations Softw Technol Theoretical Comput Sci"},{"key":"ref35","first-page":"108","article-title":"Computability and complexity results for a spatial assertion language for data structures","author":"calcagno","year":"2001","journal-title":"Proc Conf Foundations of Software Technology & Theoretical Computer Science"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v36i3.2571"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018985923441"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-007-0062-z"},{"key":"ref11","first-page":"447","article-title":"Planning\n with a language for extended goals","author":"lago","year":"2002","journal-title":"Proc Nat Conf Artif Intell and Conf Innovative Appl Artif Intell"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-009-9079-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10849-006-9022-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.02.002"},{"key":"ref15","first-page":"545","article-title":"Guiding planning engines by transition-based domain control knowledge","author":"chrpa","year":"2016","journal-title":"Proc 15th Int Conf Principles Knowl Representation Reasoning"},{"key":"ref16","first-page":"191","article-title":"Learning\n domain-specific control knowledge from random walks","author":"fern","year":"2004","journal-title":"Proc Int l Conf Automated Planning and Scheduling"},{"key":"ref17","first-page":"73","article-title":"Learning probabilistic relational planning rules","author":"pasula","year":"2004","journal-title":"Proc Int l Conf Automated Planning and Scheduling"},{"key":"ref18","first-page":"683","article-title":"Learning\n control knowledge for forward search planning","volume":"9","author":"yoon","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2002.1029817"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36578-8_7"},{"key":"ref4","first-page":"511","article-title":"Control\n knowledge in planning: Benefits and tradeoffs","author":"huang","year":"1999","journal-title":"Proc Nat Conf Artif Intell and Conf Innovative Appl Artif Intell"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837621"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00364-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00071-5"},{"key":"ref29","first-page":"189","article-title":"Spatel: A novel spatial-temporal logic and its applications to networked systems","author":"haghighi","year":"2015","journal-title":"Proc Int Conf Hybrid Syst Computat Control"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2016-1442","article-title":"An experimental study of influence of modeling and solving techniques on\n performance of a tabled logic programming planner","volume":"149","author":"bart\u00e1k","year":"2016","journal-title":"Fundamenta Informaticae"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1141"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1613\/jair.1189","article-title":"Talplanner in the third international planning competition: Extensions and control rules","volume":"20","author":"kvarnstr\u00f6m","year":"2003","journal-title":"J Artif Intell Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90081-7"},{"key":"ref9","first-page":"130","article-title":"Search control in planning for temporally extended goals","author":"kabanza","year":"2005","journal-title":"Proc Int l Conf Automated Planning and Scheduling"},{"journal-title":"Automated Planning Theory and Practice","year":"2004","author":"ghallab","key":"ref1"},{"article-title":"An extended interval temporal logic and a framing technique for\n temporal logic programming","year":"1996","author":"duan","key":"ref20"},{"article-title":"Qualitative spatial change: space-time histories and continuity","year":"2005","author":"hazarika","key":"ref45"},{"key":"ref22","first-page":"52","article-title":"Symbolic execution with separation logic","author":"berdine","year":"2005","journal-title":"Proc 3rd Asian Symp Program Languages Syst"},{"key":"ref21","first-page":"47","article-title":"Propositional projection temporal logic, bchi automata and omega-regular expressions","author":"tian","year":"2008","journal-title":"Proc 5th Int Conf Theory Appl Models Comput"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","article-title":"Z3: An efficient SMT solver","author":"de moura","year":"2008","journal-title":"Proc 14th Int Conf Tools and Algorithms for Construction Anal Syst"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/978-3-540-73368-3_22","article-title":"Shape analysis for composite data structures","author":"berdine","year":"2007","journal-title":"Proc 19th Int Conf Comput Aided Verification"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1017\/S096012950800738X"},{"key":"ref23","article-title":"From hyperedge replacement to separation logic and back","volume":"16","author":"dodds","year":"2008","journal-title":"ECEASST"},{"key":"ref44","article-title":"The\n eighth international planning competition","author":"vallati","year":"2014","journal-title":"Description Participant Planners Deterministic Track"},{"key":"ref26","first-page":"30","article-title":"Program verification under weak memory consistency using\n separation logic","author":"vafeiadis","year":"2017","journal-title":"Proc 29th Int Conf Comput Aided Verification"},{"key":"ref43","article-title":"The\n SMT-LIB standard version 2.0","volume":"13","author":"barrett","year":"2010","journal-title":"Proceedings of the 8th International Workshop on Satisfiability Modulo Theories"},{"key":"ref25","first-page":"395","article-title":"From\n separation logic to first-order logic","author":"calcagno","year":"2005","journal-title":"Proc 8th Int Conf Foundations Softw Sci Comput Struct Held Part Joint Eur Conf Theory Practice Softw"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8458057\/08303742.pdf?arnumber=8303742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T10:06:41Z","timestamp":1643191601000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8303742\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,1]]},"references-count":45,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2810144","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2018,10,1]]}}}