{"id":"https://openalex.org/W2037220114","doi":"https://doi.org/10.1109/icra.2014.6907404","title":"Linear planning logic: An efficient language and theorem prover for robotic task planning","display_name":"Linear planning logic: An efficient language and theorem prover for robotic task planning","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2037220114","doi":"https://doi.org/10.1109/icra.2014.6907404","mag":"2037220114"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2014.6907404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2014.6907404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5012286156","display_name":"S\u0131tar Kortik","orcid":"https://orcid.org/0000-0003-4833-9938"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Sitar Kortik","raw_affiliation_strings":["Department of Computer Engineering, Bilkent University, Ankara, Turkey","Department of Computer Engineering Bilkent University 06800, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]},{"raw_affiliation_string":"Department of Computer Engineering Bilkent University 06800, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071461538","display_name":"Uluc\u0323 Saranl\u0131","orcid":"https://orcid.org/0000-0002-2259-3578"},"institutions":[{"id":"https://openalex.org/I201799495","display_name":"Middle East Technical University","ror":"https://ror.org/014weej12","country_code":"TR","type":"education","lineage":["https://openalex.org/I201799495"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Uluc Saranli","raw_affiliation_strings":["Department of Computer Engineering, Middle East Technical University, Ankara, Turkey","Department of Computer Engineering, Middle East Technical University, 06800, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Middle East Technical University, Ankara, Turkey","institution_ids":["https://openalex.org/I201799495"]},{"raw_affiliation_string":"Department of Computer Engineering, Middle East Technical University, 06800, Ankara, Turkey","institution_ids":["https://openalex.org/I201799495"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.08607182,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"90","issue":null,"first_page":"3764","last_page":"3770"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9993000030517578,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.688046932220459},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.6778931021690369},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6480200886726379},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6074876189231873},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4881604313850403},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.4609329104423523},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.44274309277534485},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.41937437653541565},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.41381901502609253},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39890140295028687}],"concepts":[{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.688046932220459},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.6778931021690369},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6480200886726379},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6074876189231873},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4881604313850403},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.4609329104423523},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.44274309277534485},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.41937437653541565},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.41381901502609253},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39890140295028687},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icra.2014.6907404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2014.6907404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:open.metu.edu.tr:11511/38701","is_oa":false,"landing_page_url":"https://hdl.handle.net/11511/38701","pdf_url":null,"source":{"id":"https://openalex.org/S4306402495","display_name":"OpenMETU (Middle East Technical University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201799495","host_organization_name":"Middle East Technical University","host_organization_lineage":["https://openalex.org/I201799495"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/27855","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/27855","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE International Conference on Robotics and Automation","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322626","display_name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","ror":"https://ror.org/04w9kkr77"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W4789806","https://openalex.org/W161161253","https://openalex.org/W1490893662","https://openalex.org/W1493971218","https://openalex.org/W1512229743","https://openalex.org/W1580745021","https://openalex.org/W1589420625","https://openalex.org/W1731763842","https://openalex.org/W1759945398","https://openalex.org/W1822001265","https://openalex.org/W1983362322","https://openalex.org/W1983464388","https://openalex.org/W2014364240","https://openalex.org/W2017668106","https://openalex.org/W2025460523","https://openalex.org/W2026750732","https://openalex.org/W2056864430","https://openalex.org/W2063531202","https://openalex.org/W2067638083","https://openalex.org/W2076859913","https://openalex.org/W2093111544","https://openalex.org/W2106458801","https://openalex.org/W2113256452","https://openalex.org/W2122410182","https://openalex.org/W2129466958","https://openalex.org/W2337392266","https://openalex.org/W2911865844","https://openalex.org/W3021909058","https://openalex.org/W3175437780","https://openalex.org/W4320804830","https://openalex.org/W4323966281","https://openalex.org/W6600187994","https://openalex.org/W6637613960"],"related_works":["https://openalex.org/W1999702466","https://openalex.org/W2972366161","https://openalex.org/W1481700938","https://openalex.org/W2741053223","https://openalex.org/W1493824320","https://openalex.org/W592311106","https://openalex.org/W4319165641","https://openalex.org/W4380901377","https://openalex.org/W1977834309","https://openalex.org/W1504500318"],"abstract_inverted_index":{"In":[0],"this":[1,133],"paper,":[2],"we":[3,19],"introduce":[4],"a":[5,26,78,110,129],"novel":[6],"logic":[7,30,86],"language":[8,94,134],"and":[9,135],"theorem":[10,47,126],"prover":[11,127],"for":[12,37,49,81,112,150],"robotic":[13],"task":[14,148],"planning.":[15],"Our":[16,92],"language,":[17,119],"which":[18],"call":[20],"Linear":[21,61],"Planning":[22],"Logic":[23],"(LPL),":[24],"is":[25],"fragment":[27,131],"of":[28,60,72,84,99,132,141,147],"linear":[29,85],"whose":[31,66],"resource-conscious":[32],"semantics":[33],"are":[34],"well":[35],"suited":[36],"reasoning":[38],"with":[39],"dynamic":[40],"state,":[41],"while":[42,101],"its":[43,142],"structure":[44],"admits":[45],"efficient":[46],"provers":[48],"automatic":[50],"plan":[51],"construction.":[52],"LPL":[53,118],"can":[54],"be":[55],"considered":[56],"as":[57,90],"an":[58,138],"extension":[59],"Hereditary":[62],"Harrop":[63],"Formulas":[64],"(LHHF),":[65],"careful":[67],"design":[68,83],"allows":[69],"the":[70,82,97,103,117,121,145,151],"minimization":[71],"nondeterminism":[73,105],"in":[74,106],"proof":[75,107],"search,":[76],"providing":[77],"sufficient":[79],"basis":[80],"programming":[87],"languages":[88],"such":[89],"Lolli.":[91],"new":[93],"extends":[95],"on":[96,128,144],"expressivity":[98],"LHHF,":[100],"keeping":[102],"resulting":[104],"search":[108],"to":[109],"minimum":[111],"efficiency.":[113],"This":[114],"paper":[115],"introduces":[116],"presents":[120],"main":[122],"ideas":[123],"behind":[124],"our":[125],"smaller":[130],"finally":[136],"provides":[137],"experimental":[139],"illustration":[140],"operation":[143],"problem":[146],"planning":[149],"hexapod":[152],"robot":[153],"RHex.":[154]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}