{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T23:23:28Z","timestamp":1768951408853,"version":"3.49.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The expressive power of interval temporal logics (ITLs) makes them one of the\nmost natural choices in a number of application domains, ranging from the\nspecification and verification of complex reactive systems to automated\nplanning. However, for a long time, because of their high computational\ncomplexity, they were considered not suitable for practical purposes. The\nrecent discovery of several computationally well-behaved ITLs has finally\nchanged the scenario.\n  In this paper, we investigate the finite satisfiability and model checking\nproblems for the ITL D, that has a single modality for the sub-interval\nrelation, under the homogeneity assumption (that constrains a proposition\nletter to hold over an interval if and only if it holds over all its points).\nWe first prove that the satisfiability problem for D, over finite linear\norders, is PSPACE-complete, and then we show that the same holds for its model\nchecking problem, over finite Kripke structures. In such a way, we enrich the\nset of tractable interval temporal logics with a new meaningful representative.<\/jats:p>","DOI":"10.46298\/lmcs-18(1:24)2022","type":"journal-article","created":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T12:55:50Z","timestamp":1643806550000},"source":"Crossref","is-referenced-by-count":3,"title":["Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption"],"prefix":"10.46298","volume":"Volume 18, Issue 1","author":[{"given":"Laura","family":"Bozzelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Molinari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adriano","family":"Peron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pietro","family":"Sala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2022,2,1]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/9028\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/9028\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:17:50Z","timestamp":1687292270000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/6542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(1:24)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2006.04652v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2006.04652v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2006.04652","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2006.04652","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,1]]},"article-number":"6542"}}