{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:38:49Z","timestamp":1694623129103},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2004,5]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n          <jats:p>\n            This paper presents a completeness result, with respect to a possible world semantics, for a combination of a first-order temporal logic and neighbourhood logic. This logic was considered by Qiu and Zhou (1998,\n            <jats:italic>Proceedings of the PROCOMET \u201898<\/jats:italic>\n            , pp 444\u2013461) to define semantics of a real-time OCCAM-like programming language.\n          <\/jats:p>","DOI":"10.1007\/s00165-004-0035-8","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T06:58:17Z","timestamp":1083049097000},"page":"96-103","source":"Crossref","is-referenced-by-count":0,"title":["Completeness of a combination of neighbourhood logic and temporal logic"],"prefix":"10.1145","volume":"16","author":[{"given":"Rana","family":"Barua","sequence":"first","affiliation":[{"name":"Division of Theoretical Statistics and Mathematics, Indian Statistical Institute, 203 B.T. Road, 700 035, Calcutta, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"p_1","first-page":"35","volume-title":"Theoretical Computer Science, vol 65","author":"Aba M","year":"1989"},{"issue":"1","key":"p_2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1006\/inco.1993.1025","article-title":"Real-time logics: complexity and expressiveness","volume":"104","author":"Al R","year":"1993","journal-title":"Inform Comput"},{"key":"p_3","first-page":"521","volume-title":"Proceedings of the 16th annual symposium on theoretical aspects of computer science, LNCS vol 1563","author":"Barua R","year":"1999"},{"key":"p_4","volume-title":"Neighbourhood logics: NL and NL2. UNU\/IIST Report No. 120","author":"Ba R","year":"1997"},{"key":"p_5","first-page":"36","volume-title":"Tenth annual IEEE symposiam on logic in CS","author":"Dut B","year":"1995"},{"key":"p_6","first-page":"279","volume-title":"Proceedings of the first IEEE symposium on logic in computer science, Computer Society Press","author":"Ha J","year":"1986"},{"key":"p_7","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01211086","article-title":"Duration calculus: logical foundations","volume":"9","author":"Ha M","year":"1997","journal-title":"Formal Aspects Comput"},{"key":"p_9","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BFb0032003","volume-title":"Real time: theory in practice, LNCS vol 600","author":"Maler O","year":"1992"},{"key":"p_10","volume-title":"The temporal logic of reactive and concurrent systems: specification","author":"Ma Z","year":"1991"},{"issue":"7","key":"p_11","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/BF01191722","article-title":"Models of reactivity","volume":"30","author":"Ma Z","year":"1993","journal-title":"Acta Inf"},{"issue":"2","key":"p_12","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/MC.1985.1662795","article-title":"A temporal logic for multilevel reasoning about hardware","volume":"18","author":"Mos B","year":"1985","journal-title":"IEEE Comput"},{"key":"p_13","first-page":"55","volume-title":"Formal techniques in real-time and fault-tolerant systems, LNCS vol 1486","author":"Pa PK","year":"1998"},{"key":"p_14","first-page":"444","volume-title":"Proceedings of the PROCOMET'98","author":"Qi Z","year":"1998"},{"key":"p_15","volume-title":"Notes on neighbourhood logic. UNU\/IIST Report No. 97","author":"Ro S","year":"1997"},{"issue":"4","key":"p_16","first-page":"529","article-title":"Interval tense logic","volume":"31","author":"Ven Y","year":"1990","journal-title":"Notre Dame J Formal Logic"},{"key":"p_17","first-page":"453","volume-title":"Journal of logic and computation, vol 1","author":"Ven Y","year":"1991"},{"key":"p_18","first-page":"584","volume-title":"Compositionality: the significant difference, LNCS vol 1536","author":"Zh Z","year":"1998"},{"issue":"5","key":"p_19","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","article-title":"A calculus of durations","volume":"40","author":"Chaochen Z","year":"1991","journal-title":"Inform Proc Lett"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-004-0035-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-004-0035-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-004-0035-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:35:05Z","timestamp":1641483305000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-004-0035-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["10.1007\/s00165-004-0035-8"],"URL":"https:\/\/doi.org\/10.1007\/s00165-004-0035-8","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}