{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:48:53Z","timestamp":1758271733189},"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":[[2020,7]]},"abstract":"<jats:p>Computation Tree Logic (CTL) is one of the central formalisms in formal verification. As a specification language, it is used to express a property that the system at hand is expected to satisfy. From both the verification and the system design points of view, some information content of such property might become irrelevant for the system due to\nvarious reasons, e.g., it might become obsolete by time, or perhaps infeasible due to practical difficulties. Then, the problem arises on how to subtract such piece of information without altering the relevant system behaviour or violating the existing specifications over a given signature. Moreover, in such a scenario, two crucial notions are informative: the strongest necessary condition (SNC) and the weakest sufficient condition (WSC) of a given property. To address such a scenario in a principled way, we introduce a forgetting-based approach in CTL and show that it can be used to compute SNC and WSC of a property under a given model and over a given signature. We study its theoretical properties and also show that our notion of forgetting satisfies existing essential postulates of knowledge forgetting. Furthermore, we analyse the computational complexity of some basic reasoning tasks for the fragment CTLAF in particular.<\/jats:p>","DOI":"10.24963\/kr.2020\/37","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T04:39:16Z","timestamp":1597898356000},"page":"361-370","source":"Crossref","is-referenced-by-count":3,"title":["On Sufficient and Necessary Conditions in Bounded CTL: A Forgetting Approach"],"prefix":"10.24963","author":[{"given":"Renyan","family":"Feng","sequence":"first","affiliation":[{"name":"Guizhou University, P. R. China"},{"name":"Vrije Universiteit Amsterdam, The Netherlands"}]},{"given":"Erman","family":"Acar","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam, The Netherlands"}]},{"given":"Stefan","family":"Schlobach","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam, The Netherlands"}]},{"given":"Yisong","family":"Wang","sequence":"additional","affiliation":[{"name":"Guizhou University, P. R. China"}]},{"given":"Wanwei","family":"Liu","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, P. R. China"}]}],"member":"10584","event":{"number":"17","sponsor":["Artificial Intelligence Journal","Principles of Knowledge Representation and Reasoning Inc.","Association for Logic Programming","Center for Perspicuous Computing","European Association for Artificial Intelligence","Ontopic - The Virtual Knowledge Graph Company"],"acronym":"KR-2020","name":"17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}","start":{"date-parts":[[2020,9,12]]},"theme":"Artificial Intelligence","location":"Rhodes, Greece","end":{"date-parts":[[2020,9,18]]}},"container-title":["Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning"],"original-title":[],"deposited":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T21:18:37Z","timestamp":1604611117000},"score":1,"resource":{"primary":{"URL":"https:\/\/proceedings.kr.org\/2020\/37"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/kr.2020\/37","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}