{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T01:46:58Z","timestamp":1761961618238,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405597"},{"type":"electronic","value":"9783540450856"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45085-6_35","type":"book-chapter","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T13:13:30Z","timestamp":1288098810000},"page":"397-411","source":"Crossref","is-referenced-by-count":9,"title":["Monodic Temporal Resolution"],"prefix":"10.1007","author":[{"given":"Anatoly","family":"Degtyarev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Fisher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Konev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-45422-5_3","volume-title":"KI 2001: Advances in Artificial Intelligence","author":"A. Degtyarev","year":"2001","unstructured":"Degtyarev, A., Fisher, M.: Towards first-order temporal resolution. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol.\u00a02174, pp. 18\u201332. Springer, Heidelberg (2001)"},{"key":"35_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-45616-3_7","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"A. Degtyarev","year":"2002","unstructured":"Degtyarev, A., Fisher, M., Konev, B.: A simplified clausal resolution procedure for propositional linear-time temporal logic. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, pp. 85\u201399. Springer, Heidelberg (2002)"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Degtyarev, A., Fisher, M., Konev, B.: Monodic temporal resolution. Technical Report ULCS-03-001, University of Liverpool, Department of Computer Science (2003), http:\/\/www.csc.liv.ac.uk\/research\/","DOI":"10.1007\/978-3-540-45085-6_35"},{"key":"35_CR4","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/3-540-61511-3_121","volume-title":"Automated Deduction - Cade-13","author":"C. Dixon","year":"1996","unstructured":"Dixon, C.: Search strategies for resolution in temporal logics. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS (LNAI), vol.\u00a01104, pp. 673\u2013687. Springer, Heidelberg (1996)"},{"key":"35_CR5","first-page":"99","volume-title":"Proc. IJCAI 1991","author":"M. Fisher","year":"1991","unstructured":"Fisher, M.: A resolution method for temporal logic. In: Myopoulos, J., Reiter, R. (eds.) Proc. IJCAI 1991, pp. 99\u2013104. Morgan Kaufmann, San Francisco (1991)"},{"issue":"4","key":"35_CR6","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1093\/logcom\/7.4.429","volume":"7","author":"M. Fisher","year":"1997","unstructured":"Fisher, M.: A normal form for temporal logics and its applications in theorem proving and execution. Journal of Logic and Computation\u00a07(4), 429\u2013456 (1997)","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/371282.371311","volume":"2","author":"M. Fisher","year":"2001","unstructured":"Fisher, M., Dixon, C., Peim, M.: Clausal temporal resolution. ACM Transactions on Computational Logic\u00a02(1), 12\u201356 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0168-0072(00)00018-X","volume":"106","author":"I. Hodkinson","year":"2000","unstructured":"Hodkinson, I., Wolter, F., Zakharyaschev, M.: Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic\u00a0106, 85\u2013134 (2000)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"5","key":"35_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker Spin. IEEE Trans. on Software Engineering\u00a023(5), 279\u2013295 (1997)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Kontchakov, R., Lutz, C., Wolter, F., Zakharyaschev, M.: Temporalising tableaux. Studia Logica (to appear)","DOI":"10.1023\/B:STUD.0000027468.28935.6d"},{"key":"35_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Systems: Specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1992)"},{"key":"35_CR12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/11663081.1992.10510779","volume":"2","author":"S. Merz","year":"1992","unstructured":"Merz, S.: Decidability and incompleteness results for first-order temporal logic of linear time. Journal of Applied Non-Classical Logics\u00a02, 139\u2013156 (1992)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The Temporal Logic of Programs. In: Proceedings of the Eighteenth Symposium on the Foundations of Computer Science (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(88)90045-X","volume":"57","author":"A. Szalas","year":"1988","unstructured":"Szalas, A., Holenderski, L.: Incompleteness of First-Order Temporal Logic with Until. Theoretical Computer Science\u00a057, 317\u2013325 (1988)","journal-title":"Theoretical Computer Science"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0168-0072(01)00124-5","volume":"118","author":"F. Wolter","year":"2002","unstructured":"Wolter, F., Zakharyaschev, M.: Axiomatizing the monodic fragment of first-order temporal logic. Annals of Pure and Applied logic\u00a0118, 133\u2013145 (2002)","journal-title":"Annals of Pure and Applied logic"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-19"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45085-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T22:12:08Z","timestamp":1559772728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45085-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405597","9783540450856"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45085-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}