{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/heuristics-answer-set-programming-and-markov","title":"Heuristics, Answer Set Programming and Markov Decision Process for Solving a Set of Spatial Puzzles","arxiv_id":"1903.03411","date":"2019-02-16","proceeding":null,"authors":["Thiago Freitas dos Santos","Paulo E. Santos","Leonardo A. Ferreira","Reinaldo A. C. Bianchi","Pedro Cabalar"],"abstract":"Spatial puzzles composed of rigid objects, flexible strings and holes offer\ninteresting domains for reasoning about spatial entities that are common in the\nhuman daily-life's activities. The goal of this work is to investigate the\nautomated solution of this kind of puzzles adapting an algorithm that combines\nAnswer Set Programming (ASP) with Markov Decision Process (MDP), algorithm\noASP(MDP), to use heuristics accelerating the learning process. ASP is applied\nto represent the domain as an MDP, while a Reinforcement Learning algorithm\n(Q-Learning) is used to find the optimal policies. In this work, the heuristics\nwere obtained from the solution of relaxed versions of the puzzles. Experiments\nwere performed on deterministic, non-deterministic and non-stationary versions\nof the puzzles. Results show that the proposed approach can accelerate the\nlearning process, presenting an advantage when compared to the non-heuristic\nversions of oASP(MDP) and Q-Learning.","url_abs":"http://arxiv.org/abs/1903.03411v1","url_pdf":"http://arxiv.org/pdf/1903.03411v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"heuristics-answer-set-programming-and-markov","repo_url":"https://bitbucket.org/thiagomestrado/journalarticle","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"q-learning","task_name":"Q-Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"}],"methods":[{"method_slug":"q-learning","method_name":"Q-Learning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"bitbucket.org/thiagomestrado/journalarticle","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"575cc93b672a96cb1bcb58804a9548ad1ae0f34fedce08376622b2a120259a33","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}