{"id":"https://openalex.org/W2206143223","doi":"https://doi.org/10.1017/s1471068415000216","title":"Planning as tabled logic programming","display_name":"Planning as tabled logic programming","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W2206143223","doi":"https://doi.org/10.1017/s1471068415000216","mag":"2206143223"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068415000216","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000216","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1507.03979","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"NENG-FA ZHOU","orcid":null},"institutions":[{"id":"https://openalex.org/I83041322","display_name":"Brooklyn College","ror":"https://ror.org/019k4jq75","country_code":"US","type":"education","lineage":["https://openalex.org/I83041322"]},{"id":"https://openalex.org/I121847817","display_name":"The Graduate Center, CUNY","ror":"https://ror.org/00awd9g61","country_code":"US","type":"education","lineage":["https://openalex.org/I121847817"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"NENG-FA ZHOU","raw_affiliation_strings":["CUNY Brooklyn College and Graduate Center"],"affiliations":[{"raw_affiliation_string":"CUNY Brooklyn College and Graduate Center","institution_ids":["https://openalex.org/I83041322","https://openalex.org/I121847817"]}]},{"author_position":"middle","author":{"id":null,"display_name":"ROMAN BART\u00c1K","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"ROMAN BART\u00c1K","raw_affiliation_strings":["Charles University"],"affiliations":[{"raw_affiliation_string":"Charles University","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":null,"display_name":"AGOSTINO DOVIER","orcid":null},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"AGOSTINO DOVIER","raw_affiliation_strings":["Univ. di Udine"],"affiliations":[{"raw_affiliation_string":"Univ. di Udine","institution_ids":["https://openalex.org/I129043915"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I121847817","https://openalex.org/I83041322"],"apc_list":null,"apc_paid":null,"fwci":2.6797,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.91936288,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"15","issue":"4-5","first_page":"543","last_page":"558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.41830000281333923,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.41830000281333923,"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.41119998693466187,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0746999979019165,"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/precondition","display_name":"Precondition","score":0.7289999723434448},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.6859999895095825},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5792999863624573},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5512999892234802},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.4952000081539154},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.4505000114440918},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.3418000042438507}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8985999822616577},{"id":"https://openalex.org/C192465680","wikidata":"https://www.wikidata.org/wiki/Q1413450","display_name":"Precondition","level":2,"score":0.7289999723434448},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.6859999895095825},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5792999863624573},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5512999892234802},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5415999889373779},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4952000081539154},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.4505000114440918},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3837999999523163},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.3765999972820282},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.32710000872612},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.31349998712539673},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.2937999963760376},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.29100000858306885},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.27399998903274536},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2549000084400177},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068415000216","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000216","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1507.03979","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.03979","pdf_url":"https://arxiv.org/pdf/1507.03979","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1507.03979","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.03979","pdf_url":"https://arxiv.org/pdf/1507.03979","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W70755758","https://openalex.org/W1500431805","https://openalex.org/W1511259667","https://openalex.org/W1522225310","https://openalex.org/W1524332517","https://openalex.org/W1541665809","https://openalex.org/W1607244744","https://openalex.org/W1965784613","https://openalex.org/W2043818474","https://openalex.org/W2045474169","https://openalex.org/W2091138122","https://openalex.org/W2091346145","https://openalex.org/W2091652888","https://openalex.org/W2092211394","https://openalex.org/W2105197521","https://openalex.org/W2105710531","https://openalex.org/W2141088850","https://openalex.org/W2150470619","https://openalex.org/W2151120711","https://openalex.org/W2166780425","https://openalex.org/W2580519047","https://openalex.org/W2964023764","https://openalex.org/W4211177236","https://openalex.org/W4237919697","https://openalex.org/W4251197763","https://openalex.org/W6649663221","https://openalex.org/W6678904997"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"This":[1,73],"paper":[2,74,114],"describes":[3],"Picat's":[4,21],"planner,":[5],"its":[6],"implementation,":[7],"and":[8,36,61,92,103,110,124],"planning":[9],"models":[10],"for":[11,99,122],"several":[12,76],"domains":[13],"used":[14,40,52,65],"in":[15,134],"International":[16],"Planning":[17],"Competition":[18],"(IPC)":[19],"2014.":[20],"planner":[22],"is":[23,34,64],"implemented":[24],"by":[25],"use":[26],"of":[27,59,69,118,128],"tabling.":[28],"During":[29],"search,":[30],"every":[31],"state":[32,71,86,104],"encountered":[33],"tabled,":[35],"tabled":[37,119],"states":[38],"are":[39],"to":[41,53,66,88,106],"effectively":[42],"perform":[43],"resource-bounded":[44],"search.":[45],"In":[46],"Picat,":[47],"structured":[48],"data":[49,90],"can":[50],"be":[51],"avoid":[54,67],"enumerating":[55],"all":[56],"possible":[57],"permutations":[58],"objects,":[60],"term":[62],"sharing":[63,91],"duplication":[68],"common":[70],"data.":[72],"presents":[75],"modeling":[77,129],"techniques":[78],"through":[79],"the":[80,116,126],"example":[81],"models,":[82],"ranging":[83],"from":[84],"designing":[85],"representations":[87],"facilitate":[89],"symmetry":[93],"breaking,":[94],"encoding":[95],"actions":[96],"with":[97],"operations":[98],"efficient":[100],"precondition":[101],"checking":[102],"updating,":[105],"incorporating":[107],"domain":[108],"knowledge":[109],"heuristics.":[111],"Broadly,":[112],"this":[113],"demonstrates":[115],"effectiveness":[117],"logic":[120],"programming":[121],"planning,":[123],"argues":[125],"importance":[127],"despite":[130],"recent":[131],"significant":[132],"progress":[133],"domain-independent":[135],"PDDL":[136],"planners.":[137]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}