{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:02:38Z","timestamp":1725667358908},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287169"},{"type":"electronic","value":"9783642287176"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28717-6_31","type":"book-chapter","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T15:13:04Z","timestamp":1331046784000},"page":"391-405","source":"Crossref","is-referenced-by-count":5,"title":["Labelled Superposition for PLTL"],"prefix":"10.1007","author":[{"given":"Martin","family":"Suda","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Weidenbach","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/3-540-52885-7_105","volume-title":"10th International Conference on Automated Deduction","author":"L. Bachmair","year":"1990","unstructured":"Bachmair, L., Ganzinger, H.: On Restrictions of Ordered Paramodulation with Simplification. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol.\u00a0449, pp. 427\u2013441. Springer, Heidelberg (1990)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 19\u201399. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50004-7"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BFb0047117","volume-title":"7th International Conference on Automated Deduction","author":"A. Cavalli","year":"1984","unstructured":"Cavalli, A., del Cerro, L.: A Decision Method for Linear Temporal Logic. In: Shostak, R.E. (ed.) CADE 1984. LNCS, vol.\u00a0170, pp. 113\u2013127. Springer, Heidelberg (1984)"},{"key":"31_CR4","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":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, vol.\u00a01104, pp. 673\u2013687. Springer, Heidelberg (1996)"},{"key":"31_CR6","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 Trans. Comput. Logic\u00a02, 12\u201356 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"key":"31_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-45751-8_16","volume-title":"KI 2002: Advances in Artificial Intelligence","author":"M.C. Fern\u00e1ndez Gago","year":"2002","unstructured":"Fern\u00e1ndez Gago, M.C., Fisher, M., Dixon, C.: Algorithms for Guiding Clausal Temporal Resolution. In: Jarke, M., Koehler, J., Lakemeyer, G. (eds.) KI 2002. LNCS (LNAI), vol.\u00a02479, pp. 235\u2013252. Springer, Heidelberg (2002)"},{"key":"31_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-45085-6_21","volume-title":"Automated Deduction \u2013 CADE-19","author":"U. Hustadt","year":"2003","unstructured":"Hustadt, U., Konev, B.: TRP++ 2.0: A Temporal Resolution Prover. In: Baader, F. (ed.) CADE-19. LNCS (LNAI), vol.\u00a02741, pp. 274\u2013278. Springer, Heidelberg (2003)"},{"key":"31_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/11532231_15","volume-title":"Automated Deduction \u2013 CADE-20","author":"U. Hustadt","year":"2005","unstructured":"Hustadt, U., Konev, B., Schmidt, R.A.: Deciding Monodic Fragments by Temporal Resolution. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 204\u2013218. Springer, Heidelberg (2005)"},{"key":"31_CR10","unstructured":"Hustadt, U., Schmidt, R.: Scientific benchmarking with temporal logic decision procedures. In: KR 2002, pp. 533\u2013546. Morgan Kaufmann (2002)"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ic.2004.10.005","volume":"199","author":"B. Konev","year":"2005","unstructured":"Konev, B., Degtyarev, A., Dixon, C., Fisher, M., Hustadt, U.: Mechanising first-order temporal resolution. Inf. Comput.\u00a0199, 55\u201386 (2005)","journal-title":"Inf. Comput."},{"key":"31_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-73595-3_21","volume-title":"Automated Deduction \u2013 CADE-21","author":"T. Lev-Ami","year":"2007","unstructured":"Lev-Ami, T., Weidenbach, C., Reps, T., Sagiv, M.: Labelled Clauses. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 311\u2013327. Springer, Heidelberg (2007)"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-02959-2_21","volume-title":"Automated Deduction \u2013 CADE-22","author":"M. Ludwig","year":"2009","unstructured":"Ludwig, M., Hustadt, U.: Fair Derivations in Monodic Temporal Reasoning. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol.\u00a05663, pp. 261\u2013276. Springer, Heidelberg (2009)"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Ludwig, M., Hustadt, U.: Resolution-based model construction for PLTL. In: TIME 2009, pp. 73\u201380. IEEE Computer Society (2009)","DOI":"10.1109\/TIME.2009.11"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, pp. 46\u201357. IEEE (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-73370-6_11","volume-title":"Model Checking Software","author":"K.Y. Rozier","year":"2007","unstructured":"Rozier, K.Y., Vardi, M.Y.: LTL Satisfiability Checking. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol.\u00a04595, pp. 149\u2013167. Springer, Heidelberg (2007)"},{"key":"31_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-69778-0_28","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"S. Schwendimann","year":"1998","unstructured":"Schwendimann, S.: A New One-Pass Tableau Calculus for PLTL. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol.\u00a01397, pp. 277\u2013291. Springer, Heidelberg (1998)"},{"key":"31_CR18","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM\u00a032, 733\u2013749 (1985)","journal-title":"J. ACM"},{"key":"31_CR19","unstructured":"Suda, M., Weidenbach, C.: Prototype implementation of LPSup. (2011), http:\/\/www.mpi-inf.mpg.de\/~suda\/supLTL.html"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Suda, M., Weidenbach, C.: Labelled Superposition for PLTL. Research Report MPI-I-2012-RG1-001, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken (2012)","DOI":"10.1007\/978-3-642-28717-6_31"},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-16042-6_15","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"G. Venkatesh","year":"1985","unstructured":"Venkatesh, G.: A Decision Method for Temporal Logic Based on Resolution. In: Maheshwari, S.N. (ed.) FSTTCS 1985. LNCS, vol.\u00a0206, pp. 272\u2013289. Springer, Heidelberg (1985)"},{"key":"31_CR22","first-page":"119","volume":"28","author":"P. Wolper","year":"1985","unstructured":"Wolper, P.: The tableau method for temporal logic: An overview. Logique et Analyse\u00a028, 119\u2013136 (1985)","journal-title":"Logique et Analyse"},{"key":"31_CR23","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD, pp. 279\u2013285 (2001)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28717-6_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T17:25:41Z","timestamp":1641057941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28717-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287169","9783642287176"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28717-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}