{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:09:48Z","timestamp":1773655788343,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.2002.1029846","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T22:14:31Z","timestamp":1056579271000},"page":"383-392","source":"Crossref","is-referenced-by-count":62,"title":["Temporal logic with forgettable past"],"prefix":"10.1109","author":[{"given":"F.","family":"Laroussinie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Markey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Schnoebelen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90049-5"},{"key":"17","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-15648-8_16","article-title":"The glory of the past","volume":"193","author":"lichtenstein","year":"1985","journal-title":"Lecture Notes in Computer Science"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00035-U"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2817"},{"key":"13","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/3-540-44685-0_35","article-title":"Extended temporal logic revisited","volume":"2154","author":"kupferman","year":"2001","journal-title":"Lecture Notes in Computer Science"},{"key":"14","first-page":"25","article-title":"Once and for all","author":"kupferman","year":"1995","journal-title":"Proc 10th IEEE Symp Logic in Computer Science (LICS'95) San Diego CA USA June 1995"},{"key":"11","author":"kamp","year":"1968","journal-title":"Tense logic and the theory of linear order"},{"key":"12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-56922-7_9","article-title":"A decision algorithm for full propositional temporal logic","volume":"697","author":"kesten","year":"1993","journal-title":"Lecture Notes in Computer Science"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3837"},{"key":"20","first-page":"306","article-title":"A choppy logic","author":"rosner","year":"1986","journal-title":"Proc 1st IEEE Symp Logic in Computer Science (LICS'86)"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90008-9"},{"key":"23","first-page":"332","article-title":"An automata-theoretic approach to automatic program verification","author":"vardi","year":"1986","journal-title":"Proc 1st IEEE Symp Logic in Computer Science (LICS'86)"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73582"},{"key":"25","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/BFb0015261","article-title":"Alternating automata and program verification","volume":"1000","author":"vardi","year":"1995","journal-title":"Lecture Notes in Computer Science"},{"key":"26","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1007\/BFb0055090","article-title":"Reasoning about the past with two-way automata","volume":"1443","author":"vardi","year":"1998","journal-title":"Lecture Notes in Computer Science"},{"key":"27","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/3-540-49116-3_3","article-title":"Classifying discrete temporal properties","volume":"1563","author":"wilke","year":"1999","journal-title":"Lecture Notes in Computer Science"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3094"},{"key":"2","author":"clarke","year":"1999","journal-title":"Model checking"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90225-7"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04558-9"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/567446.567462"},{"key":"6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-51803-7_36","article-title":"The declarative past and imperative future: Executable temporal logic for interactive systems","volume":"398","author":"gabbay","year":"1989","journal-title":"Lecture Notes in Computer Science"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1997.614950"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"9","author":"harel","year":"1992","journal-title":"Algorithmics The Spirit of Computing"},{"key":"8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-18088-5_22","article-title":"Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree","volume":"267","author":"hafer","year":"1987","journal-title":"Lecture Notes in Computer Science"}],"event":{"name":"17th Annual IEEE Symposium on Logic in Computer Science","location":"Copenhagen, Denmark","acronym":"LICS-02"},"container-title":["Proceedings 17th Annual IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8005\/22127\/01029846.pdf?arnumber=1029846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T22:42:32Z","timestamp":1497566552000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1029846\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/lics.2002.1029846","relation":{},"subject":[]}}