{"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/a-trajectory-calculus-for-qualitative-spatial","title":"A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming","arxiv_id":"1804.07088","date":"2018-04-19","proceeding":null,"authors":["George Baryannis","Ilias Tachmazidis","Sotiris Batsakis","Grigoris Antoniou","Mario Alviano","Timos Sellis","Pei-Wei Tsai"],"abstract":"Spatial information is often expressed using qualitative terms such as\nnatural language expressions instead of coordinates; reasoning over such terms\nhas several practical applications, such as bus routes planning. Representing\nand reasoning on trajectories is a specific case of qualitative spatial\nreasoning that focuses on moving objects and their paths. In this work, we\npropose two versions of a trajectory calculus based on the allowed properties\nover trajectories, where trajectories are defined as a sequence of\nnon-overlapping regions of a partitioned map. More specifically, if a given\ntrajectory is allowed to start and finish at the same region, 6 base relations\nare defined (TC-6). If a given trajectory should have different start and\nfinish regions but cycles are allowed within, 10 base relations are defined\n(TC-10). Both versions of the calculus are implemented as ASP programs; we\npropose several different encodings, including a generalised program capable of\nencoding any qualitative calculus in ASP. All proposed encodings are\nexperimentally evaluated using a real-world dataset. Experiment results show\nthat the best performing implementation can scale up to an input of 250\ntrajectories for TC-6 and 150 trajectories for TC-10 for the problem of\ndiscovering a consistent configuration, a significant improvement compared to\nprevious ASP implementations for similar qualitative spatial and temporal\ncalculi. This manuscript is under consideration for acceptance in TPLP.","url_abs":"http://arxiv.org/abs/1804.07088v1","url_pdf":"http://arxiv.org/pdf/1804.07088v1.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":"a-trajectory-calculus-for-qualitative-spatial","repo_url":"https://github.com/gmparg/ICLP2018","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"spatial-reasoning","task_name":"Spatial Reasoning"}],"methods":[],"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":"gmparg/ICLP2018","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":"977a8acdc2e323c5e351de187491877771e26fa012e31d6c9f74b04811dd76da","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}