{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T05:24:53Z","timestamp":1790054693295,"version":"4.0.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030290252","type":"print"},{"value":"9783030290269","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29026-9_1","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A SAT-Based Encoding of the One-Pass and Tree-Shaped Tableau System for LTL"],"prefix":"10.1007","author":[{"given":"Luca","family":"Geatti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicola","family":"Gigante","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angelo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.entcs.2009.02.036","volume":"231","author":"P Abate","year":"2009","unstructured":"Abate, P., Gor\u00e9, R., Widmann, F.: An on-the-fly tableau-based decision procedure for PDL-satisfiability. Electron. Notes Theor. Comput. Sci. 231, 191\u2013209 (2009). \n                      https:\/\/doi.org\/10.1016\/j.entcs.2009.02.036","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/174644.174651","volume":"41","author":"R Alur","year":"1994","unstructured":"Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM 41(1), 181\u2013204 (1994)","journal-title":"J. ACM"},{"key":"1_CR3","unstructured":"Bertello, M., Gigante, N., Montanari, A., Reynolds, M.: Leviathan: a new LTL satisfiability checking tool based on a one-pass tree-shaped tableau. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence, pp. 950\u2013956. IJCAI\/AAAI Press (2016)"},{"issue":"54","key":"1_CR4","first-page":"311","volume":"14","author":"EW Beth","year":"1959","unstructured":"Beth, E.W.: Semantic entailment and formal derivability. Sapientia 14(54), 311 (1959)","journal-title":"Sapientia"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-70545-1_28","volume-title":"Computer Aided Verification","author":"R Bruttomesso","year":"2008","unstructured":"Bruttomesso, R., Cimatti, A., Franz\u00e9n, A., Griggio, A., Sebastiani, R.: The MathSAT\u00a04 SMT solver. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 299\u2013303. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-70545-1_28"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-319-08867-9_22","volume-title":"Computer Aided Verification","author":"R Cavada","year":"2014","unstructured":"Cavada, R., et al.: The nuXmv symbolic model checker. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 334\u2013342. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-08867-9_22"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-30494-4_18","volume-title":"Formal Methods in Computer-Aided Design","author":"A Cimatti","year":"2004","unstructured":"Cimatti, A., Roveri, M., Sheridan, D.: Bounded verification of past LTL. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 245\u2013259. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-30494-4_18"},{"key":"1_CR8","unstructured":"Claessen, K., S\u00f6rensson, N.: A liveness checking algorithm that counts. In: Proceedings of the 12th Formal Methods in Computer-Aided Design, pp. 52\u201359. IEEE (2012)"},{"key":"1_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044450813-3\/50026-6","volume-title":"Model Checking","author":"EM Clarke","year":"2001","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2001)"},{"key":"1_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1754-0","volume-title":"Handbook of Tableau Methods","year":"1999","unstructured":"D\u2019Agostino, M., Gabbay, D., H\u00e4hnle, R., Posegga, J. (eds.): Handbook of Tableau Methods. Springer, Dordrecht (1999). \n                      https:\/\/doi.org\/10.1007\/978-94-017-1754-0"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Della Monica, D., Gigante, N., Montanari, A., Sala, P., Sciavicco, G.: Bounded timed propositional temporal logic with past captures timeline-based planning with bounded constraints. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp. 1008\u20131014 (2017). \n                      https:\/\/doi.org\/10.24963\/ijcai.2017\/140","DOI":"10.24963\/ijcai.2017\/140"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"Niklas E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible sat-solver. In: Selected Revised Papers of the 6th International Conference on Theory and Applications of Satisfiability Testing, pp. 502\u2013518 (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"176","DOI":"10.4204\/EPTCS.277.13","volume":"277","author":"Luca Geatti","year":"2018","unstructured":"Geatti, L., Gigante, N., Montanari, A., Reynolds, M.: One-pass and tree-shaped tableau systems for TPTL and TPTLb+Past. In: Orlandini, A., Zimmermann, M. (eds.) Proceedings 9th International Symposium on Games, Automata, Logics, and Formal Verification. EPTCS, vol. 277, pp. 176\u2013190 (2018). \n                      https:\/\/doi.org\/10.4204\/EPTCS.277.13","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"1_CR14","unstructured":"Gigante, N., Montanari, A., Reynolds, M.: A one-pass tree-shaped tableau for LTL+Past. In: Proceedings of 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning. EPiC Series in Computing, vol. 46, pp. 456\u2013473 (2017)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11513988_10","volume-title":"Computer Aided Verification","author":"K Heljanko","year":"2005","unstructured":"Heljanko, K., Junttila, T., Latvala, T.: Incremental and complete bounded model checking for full PLTL. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 98\u2013111. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11513988_10"},{"issue":"6","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1109\/TRO.2009.2030225","volume":"25","author":"H Kress-Gazit","year":"2009","unstructured":"Kress-Gazit, H., Fainekos, G.E., Pappas, G.J.: Temporal-logic-based reactive mission and motion planning. IEEE Trans. Robot. 25(6), 1370\u20131381 (2009)","journal-title":"IEEE Trans. Robot."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-26287-1_13","volume-title":"Hardware and Software: Verification and Testing","author":"J Li","year":"2015","unstructured":"Li, J., Zhu, S., Pu, G., Vardi, M.Y.: SAT-based explicit LTL reasoning. In: Piterman, N. (ed.) HVC 2015. LNCS, vol. 9434, pp. 209\u2013224. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-26287-1_13"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/jigpal\/8.1.55","volume":"8","author":"O Lichtenstein","year":"2000","unstructured":"Lichtenstein, O., Pnueli, A.: Propositional temporal logics: decidability and completeness. Logic J. IGPL 8(1), 55\u201385 (2000). \n                      https:\/\/doi.org\/10.1093\/jigpal\/8.1.55","journal-title":"Logic J. IGPL"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4222-2","volume-title":"Temporal Verification of Reactive Systems - Safety","author":"Z Manna","year":"1995","unstructured":"Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems - Safety. Springer, New York (1995). \n                      https:\/\/doi.org\/10.1007\/978-1-4612-4222-2"},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10849-006-9022-1","volume":"16","author":"MC Mayer","year":"2007","unstructured":"Mayer, M.C., Limongelli, C., Orlandini, A., Poggioni, V.: Linear temporal logic as an executable semantics for planning languages. J. Logic, Lang. Inf. 16(1), 63\u201389 (2007). \n                      https:\/\/doi.org\/10.1007\/s10849-006-9022-1","journal-title":"J. Logic, Lang. Inf."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"McCabe-Dansted, J.C., Reynolds, M.: A parallel linear temporal logic tableau. In: Bouyer, P., Orlandini, A., Pietro, P.S. (eds.) Proceedings of the 8th International Symposium on Games, Automata, Logics and Formal Verification. EPTCS, vol. 256, pp. 166\u2013179 (2017)","DOI":"10.4204\/EPTCS.256.0"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"287","DOI":"10.4204\/EPTCS.226.20","volume":"226","author":"Mark Reynolds","year":"2016","unstructured":"Reynolds, M.: A new rule for LTL tableaux. In: Proceedings of the 7th International Symposium on Games, Automata, Logics and Formal Verification. EPTCS, vol. 226, pp. 287\u2013301 (2016). \n                      https:\/\/doi.org\/10.4204\/EPTCS.226.20","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-24372-1_28","volume-title":"Automated Technology for Verification and Analysis","author":"Viktor Schuppan","year":"2011","unstructured":"Schuppan, V., Darmawan, L.: Evaluating LTL satisfiability solvers. In: Proceedings of the 9th International Symposium on Automated Technology for Verification and Analysis, pp. 397\u2013413 (2011)"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science (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. 1397, pp. 277\u2013291. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/3-540-69778-0_28"},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"AP Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM 32(3), 733\u2013749 (1985). \n                      https:\/\/doi.org\/10.1145\/3828.3837","journal-title":"J. ACM"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-642-31365-3_42","volume-title":"Automated Reasoning","author":"M Suda","year":"2012","unstructured":"Suda, M., Weidenbach, C.: A PLTL-prover based on labelled superposition with partial model guidance. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 537\u2013543. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-31365-3_42"},{"key":"1_CR27","unstructured":"Van Lamsweerde, A.: Goal-oriented requirements engineering: a guided tour. In: Proceedings of the 5th International Symposium on Requirements Engineering, pp. 249\u2013262. IEEE (2001)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29026-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:14:47Z","timestamp":1566429287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TABLEAUX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}