{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:46Z","timestamp":1725560206611},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280057"},{"type":"electronic","value":"9783540318644"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11532231_15","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T18:56:52Z","timestamp":1279738612000},"page":"204-218","source":"Crossref","is-referenced-by-count":5,"title":["Deciding Monodic Fragments by Temporal Resolution"],"prefix":"10.1007","author":[{"given":"Ullrich","family":"Hustadt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Konev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renate A.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, Voronkov (eds.) [22], ch.\u00a02, pp. 19\u201399.","DOI":"10.1016\/B978-044450813-3\/50004-7"},{"key":"15_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59207-2","volume-title":"The Classical Decision Problem","author":"E. B\u00f6rger","year":"1997","unstructured":"B\u00f6rger, E., Gr\u00e4del, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (1997)"},{"key":"15_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-45653-8_12","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"H. Nivelle de","year":"2001","unstructured":"de Nivelle, H.: Splitting through new proposition symbols. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 172\u2013185. Springer, Heidelberg (2001)"},{"key":"15_CR4","unstructured":"Degtyarev, A., Fisher, M., Konev, B.: Monodic temporal resolution. ACM Transactions on Computational Logic (To appear)"},{"key":"15_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-45085-6_35","volume-title":"Automated Deduction \u2013 CADE-19","author":"A.B. Degtyarev","year":"2003","unstructured":"Degtyarev, A.B., Fisher, M., Konev, B.: Monodic temporal resolution. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 397\u2013411. Springer, Heidelberg (2003)"},{"key":"15_CR6","first-page":"997","volume-title":"Handbook of Theoretical Computer Science, ch.\u00a016","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch.\u00a016, pp. 997\u20131072. Elsevier, Amsterdam (1990)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Ferm\u00fcller, C., Leitsch, A., Hustadt, U., Tammet, T.: Resolution decision procedures. In: Robinson, Voronkov (eds.) [21], ch.\u00a025, pp. 1791\u20131850.","DOI":"10.1016\/B978-044450813-3\/50027-8"},{"issue":"1","key":"15_CR8","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":"15_CR9","first-page":"295","volume-title":"Proc. LICS\u201999","author":"H. Ganzinger","year":"1999","unstructured":"Ganzinger, H., de Nivelle, H.: A superposition decision procedure for the guarded fragment with equality. In: Proc. LICS\u201999, pp. 295\u2013304. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1023\/A:1021356410579","volume":"72","author":"I. Hodkinson","year":"2002","unstructured":"Hodkinson, I.: Monodic packed fragment with equality is decidable. Studia Logica\u00a072(2), 185\u2013197 (2002)","journal-title":"Studia Logica"},{"key":"15_CR11","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"},{"key":"15_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-25984-8_23","volume-title":"Automated Reasoning","author":"U. Hustadt","year":"2004","unstructured":"Hustadt, U., Konev, B., Riazanov, A., Voronkov, A.: TeMP: A temporal monodic prover. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 326\u2013330. Springer, Heidelberg (2004)"},{"key":"15_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-48660-7_12","volume-title":"Automated Deduction - CADE-16","author":"U. Hustadt","year":"1999","unstructured":"Hustadt, U., Schmidt, R.A.: Maslov\u2019s class K revisited. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 172\u2013186. Springer, Heidelberg (1999)"},{"key":"15_CR14","unstructured":"Konev, B., Degtyarev, A., Dixon, C., Fisher, M., Hustadt, U.: Mechanising first-order temporal resolution. In: Information and Computation (2003) (To appear) Also available as Technical Report ULCS-03-023, Dep. Comp. Sci., Univ. Liverpool"},{"key":"15_CR15","first-page":"72","volume-title":"Proc. TIME-ICTL 2003","author":"B. Konev","year":"2003","unstructured":"Konev, B., Degtyarev, A., Dixon, C., Fisher, M., Hustadt, U.: Towards the implementation of first-order temporal resolution: the expanding domain case. In: Proc. TIME-ICTL 2003, pp. 72\u201382. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-39813-4_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"B. Konev","year":"2003","unstructured":"Konev, B., Degtyarev, A., Fisher, M.: Handling equality in monodic temporal resolution. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 214\u2013228. Springer, Heidelberg (2003)"},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:STUD.0000027468.28935.6d","volume":"76","author":"R. Kontchakov","year":"2004","unstructured":"Kontchakov, R., Lutz, C., Wolter, F., Zakharyaschev, M.: Temporalising tableaux. Studia Logica\u00a076(1), 91\u2013134 (2004)","journal-title":"Studia Logica"},{"key":"15_CR18","first-page":"25","volume-title":"The Calculi of Symbolic Logic I: Proceedings of the Steklov Institute of Mathematics","author":"S.J.. Maslov","year":"1971","unstructured":"Maslov, S.J.: The inverse method for establishing deducibility for logical calculi. In: Orevkov, V.P. (ed.) The Calculi of Symbolic Logic I: Proceedings of the Steklov Institute of Mathematics, vol.\u00a098(1968), pp. 25\u201396. American Math. Soc, Providence (1971)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, Voronkov (eds.) [22], ch.\u00a07, pp. 371\u2013443.","DOI":"10.1016\/B978-044450813-3\/50009-6"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Nonnengart, A., Weidenbach, C.: Computing small clause normal forms. In: Robinson, Voronkov (eds.) [22], ch.\u00a06, pp. 335\u2013370.","DOI":"10.1016\/B978-044450813-3\/50008-4"},{"key":"15_CR21","first-page":"611","volume-title":"Proc. IJCAI 2001","author":"A. Riazanov","year":"2001","unstructured":"Riazanov, A., Voronkov, A.: Splitting without backtracking. In: Proc. IJCAI 2001, pp. 611\u2013617. Morgan Kaufmann, San Francisco (2001)"},{"key":"15_CR22","volume-title":"Handbook of Automated Reasoning","author":"A. Robinson","year":"2001","unstructured":"Robinson, A., Voronkov, A.(ed.): Handbook of Automated Reasoning. Elsevier, Amsterdam (2001)"},{"key":"15_CR23","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-20"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11532231_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:06Z","timestamp":1605643746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11532231_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280057","9783540318644"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11532231_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}