{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:04Z","timestamp":1760202724523,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T00:00:00Z","timestamp":1449705600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We introduce a modal logic, called Cone Logic, whose formulas describe\nproperties of points in the plane and spatial relationships between them.\nPoints are labelled by proposition letters and spatial relations are induced by\nthe four cone-shaped cardinal directions. Cone Logic can be seen as a weakening\nof Venema's Compass Logic. We prove that, unlike Compass Logic and other\nprojection-based spatial logics, its satisfiability problem is decidable\n(precisely, PSPACE-complete). We also show that it is expressive enough to\ncapture meaningful interval temporal logics - in particular, the interval\ntemporal logic of Allen's relations \"Begins\", \"During\", and \"Later\", and their\ntransposes.<\/jats:p>","DOI":"10.2168\/lmcs-11(4:7)2015","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T13:46:40Z","timestamp":1479736000000},"source":"Crossref","is-referenced-by-count":3,"title":["A decidable weakening of Compass Logic based on cone-shaped cardinal directions"],"prefix":"10.46298","volume":"Volume 11, Issue 4","author":[{"given":"Angelo","family":"Montanari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9831-3264","authenticated-orcid":false,"given":"Gabriele","family":"Puppis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2612-1519","authenticated-orcid":false,"given":"Pietro","family":"Sala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"key":"1111:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1608\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1608\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:07:48Z","timestamp":1681243668000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,10]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-11(4:7)2015","relation":{"is-same-as":[{"id-type":"arxiv","id":"1510.03319","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1510.03319","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2015,12,10]]},"article-number":"1608"}}