{"id":"https://openalex.org/W1500431805","doi":"https://doi.org/10.3233/fi-2013-849","title":"A Tabled Prolog Program for Solving Sokoban","display_name":"A Tabled Prolog Program for Solving Sokoban","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1500431805","doi":"https://doi.org/10.3233/fi-2013-849","mag":"1500431805"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2013-849","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2013-849","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-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/A5113864016","display_name":"Neng\u2010Fa 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":["Department of Computer and Information Science, CUNY Brooklyn College & Graduate Center, USA. zhou@sci.brooklyn.cuny.edu","Department of Computer and Information Science, CUNY Brooklyn College & Graduate Center, USA. zhou@sci.brooklyn.cuny.edu"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, CUNY Brooklyn College & Graduate Center, USA. zhou@sci.brooklyn.cuny.edu","institution_ids":["https://openalex.org/I121847817","https://openalex.org/I83041322"]},{"raw_affiliation_string":"Department of Computer and Information Science, CUNY Brooklyn College & Graduate Center, USA. zhou@sci.brooklyn.cuny.edu","institution_ids":["https://openalex.org/I83041322","https://openalex.org/I121847817"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064407367","display_name":"Agostino Dovier","orcid":"https://orcid.org/0000-0003-2052-8593"},"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":["Dipartimento di Matematica e Informatica, Universit\u00e0 di Udine, Udine, Italy. agostino.dovier@uniud.it"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica e Informatica, Universit\u00e0 di Udine, Udine, Italy. agostino.dovier@uniud.it","institution_ids":["https://openalex.org/I129043915"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113864016"],"corresponding_institution_ids":["https://openalex.org/I121847817","https://openalex.org/I83041322"],"apc_list":null,"apc_paid":null,"fwci":5.9519,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.95784742,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"124","issue":"4","first_page":"561","last_page":"575"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9986000061035156,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9986000061035156,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9966999888420105,"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/T10142","display_name":"Formal Methods in Verification","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/prolog","display_name":"Prolog","score":0.8043539524078369},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7229084968566895},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6735274791717529},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6154228448867798},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5574743151664734},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5484266877174377},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5020067691802979},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.45434045791625977},{"id":"https://openalex.org/keywords/problem-solver","display_name":"Problem solver","score":0.45056620240211487},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41765278577804565},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3801127076148987},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3675890564918518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2188742756843567},{"id":"https://openalex.org/keywords/software-engineering","display_name":"Software engineering","score":0.1290881335735321}],"concepts":[{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.8043539524078369},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7229084968566895},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6735274791717529},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6154228448867798},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5574743151664734},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5484266877174377},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5020067691802979},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.45434045791625977},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.45056620240211487},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41765278577804565},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3801127076148987},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3675890564918518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2188742756843567},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.1290881335735321},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/fi-2013-849","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2013-849","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},{"id":"pmh:oai:air.uniud.it:11390/696765","is_oa":false,"landing_page_url":"http://hdl.handle.net/11390/696765","pdf_url":null,"source":{"id":"https://openalex.org/S4306401163","display_name":"Institutional Research Information System (University of Udine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I129043915","host_organization_name":"University of Udine","host_organization_lineage":["https://openalex.org/I129043915"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"4.1 Contributo in Atti di convegno"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1501758783","https://openalex.org/W1518621415","https://openalex.org/W1534467528","https://openalex.org/W1567329114","https://openalex.org/W1607804604","https://openalex.org/W1672891595","https://openalex.org/W1924767599","https://openalex.org/W1971439026","https://openalex.org/W1991572458","https://openalex.org/W1993778656","https://openalex.org/W1997189447","https://openalex.org/W2004414305","https://openalex.org/W2014205104","https://openalex.org/W2082232766","https://openalex.org/W2091346145","https://openalex.org/W2125622056","https://openalex.org/W2133212815","https://openalex.org/W2138339216","https://openalex.org/W2151120711","https://openalex.org/W2963711700"],"related_works":["https://openalex.org/W2132874577","https://openalex.org/W1836984851","https://openalex.org/W2011621332","https://openalex.org/W1596719193","https://openalex.org/W2116898168","https://openalex.org/W1605093979","https://openalex.org/W2152572054","https://openalex.org/W2920969592","https://openalex.org/W2074269745","https://openalex.org/W2568362682"],"abstract_inverted_index":{"This":[0,18,49],"paper":[1],"presents":[2],"our":[3],"program":[4,50],"in":[5,73],"B-Prolog":[6],"submitted":[7],"to":[8,43,85],"the":[9,15,69,74,79],"third":[10],"ASP":[11],"solver":[12],"competition":[13],"for":[14],"Sokoban":[16,25],"problem.":[17,31],"program,":[19],"based":[20],"on":[21],"dynamic":[22],"programming,":[23],"treats":[24],"as":[26],"a":[27,34],"generalized":[28],"shortest":[29],"path":[30],"It":[32],"divides":[33],"problem":[35],"into":[36],"independent":[37],"subproblems":[38,45],"and":[39,46],"uses":[40],"mode-directed":[41],"tabling":[42],"store":[44],"their":[47],"answers.":[48],"is":[51],"very":[52],"simple":[53],"but":[54],"quite":[55],"efficient.":[56],"Without":[57],"use":[58],"of":[59,68],"any":[60],"sophisticated":[61],"domain":[62],"knowledge,":[63],"it":[64],"easily":[65,83],"solves":[66],"14":[67],"15":[70],"instances":[71],"used":[72],"competition.":[75],"We":[76],"show":[77],"that":[78],"approach":[80],"can":[81],"be":[82],"applied":[84],"other":[86],"optimization":[87],"planning":[88],"problems.":[89]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-04T09:10:02.777135","created_date":"2025-10-10T00:00:00"}