{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:59:57Z","timestamp":1762325997306,"version":"build-2065373602"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:p>Standpoint linear temporal logic (SLTL) is a recently\n\nintroduced extension of classical linear temporal logic\n\n(LTL) with standpoint modalities. Intuitively, these\n\nmodalities allow to express that, from agent a's\n\nstandpoint, it is conceivable that a given formula holds.\n\nBesides the standard interpretation of the standpoint\n\nmodalities  we introduce four  new semantics, which differ\n\nin the information an agent can extract from the  history.\n\nWe provide a general model checking algorithm applicable to\n\nSLTL under any of the five semantics. Furthermore we\n\nanalyze the computational complexity of the corresponding\n\nmodel checking problems, obtaining PSPACE-completeness in\n\nthree cases, which stands in contrast to the known\n\nEXPSPACE-completeness of the SLTL satisfiability problem.<\/jats:p>","DOI":"10.24963\/kr.2025\/1","type":"proceedings-article","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:10:44Z","timestamp":1762323044000},"page":"2-11","source":"Crossref","is-referenced-by-count":0,"title":["Model Checking Linear Temporal Logic with Standpoint Modalities"],"prefix":"10.24963","author":[{"given":"Rajab","family":"Aghamov","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Dresden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christel","family":"Baier","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dresden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toghrul","family":"Karimov","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob","family":"Piribauer","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dresden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timm","family":"Spork","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dresden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"name":"22nd International Conference on Principles of Knowledge Representation and Reasoning {KR-2025}","theme":"Artificial Intelligence","location":"Melbourne, Australia","acronym":"KR-2025","number":"22","sponsor":["Artificial Intelligence Journal","Principles of Knowledge Representation and Reasoning Inc.","Academic College of Tel-Aviv","European Association for Artificial Intelligence","National Science Foundation"],"start":{"date-parts":[[2025,11,11]]},"end":{"date-parts":[[2025,11,17]]}},"container-title":["Proceedings of the TwentySecond International Conference on Principles of Knowledge Representation and Reasoning"],"original-title":[],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:10:45Z","timestamp":1762323045000},"score":1,"resource":{"primary":{"URL":"https:\/\/proceedings.kr.org\/2025\/1"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/kr.2025\/1","relation":{},"subject":[],"published":{"date-parts":[[2025,11]]}}}