{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:24:15Z","timestamp":1743009855742,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811975097"},{"type":"electronic","value":"9789811975103"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-7510-3_1","type":"book-chapter","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T22:02:34Z","timestamp":1670623354000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finite Quantified Linear Temporal Logic and\u00a0Its Satisfiability Checking"],"prefix":"10.1007","author":[{"given":"Yu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xiaoyu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jianwen","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,10]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Bae, K., Lee, J.: Bounded model checking of signal temporal logic properties using syntactic separation. In: Proceedings of the ACM on Programming Languages 3(POPL), pp. 1\u201330 (2019)","DOI":"10.1145\/3290364"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-319-06410-9_4","volume-title":"FM 2014: Formal Methods","author":"D Bj\u00f8rner","year":"2014","unstructured":"Bj\u00f8rner, D., Havelund, K.: 40 years of formal methods. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 42\u201361. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06410-9_4"},{"key":"1_CR3","unstructured":"Clarke, E.M.: The birth of model checking. In: 25 Years of Model Checking-History, Achievements, Perspectives (2008)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Feng, J., et al.: FREPA: an automated and formal approach to requirement modeling and analysis in aircraft control domain. In: ESEC\/FSE 2020: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, pp. 1376\u20131386 (2020)","DOI":"10.1145\/3368089.3417047"},{"key":"1_CR5","unstructured":"Song, F., Wu, Z.: Extending temporal logics with data variable quantifications. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2014)"},{"key":"1_CR6","unstructured":"Giacomo, G.D., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. AAAI Press (2013)"},{"key":"1_CR7","unstructured":"Giacomo, G.D., Vardi, M.Y.: Synthesis for LTL and LDL on finite traces. AAAI Press (2015)"},{"key":"1_CR8","unstructured":"Hird, G.R.: Formal methods in software engineering. In: 9th IEEE\/AIAA\/NASA Conference on Digital Avionics Systems (2002)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"GJ Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker - spin. IEEE Trans. Softw. Eng. 23, 279\u2013295 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Hustadt, U., Konev, B.: TRP++2.0: a temporal resolution prover. In: International Conference on Automated Deduction-cade (2002)","DOI":"10.1007\/978-3-540-45085-6_21"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-46520-3_14","volume-title":"Automated Technology for Verification and Analysis","author":"D Kuperberg","year":"2016","unstructured":"Kuperberg, D., Brunel, J., Chemouil, D.: On finite domains in first-order linear temporal logic. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 211\u2013226. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46520-3_14"},{"key":"1_CR12","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). https:\/\/doi.org\/10.1007\/978-3-319-26287-1_13"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Li, J., Yao, Y., Pu, G., Zhang, L., He, J.: Aalta: an LTL satisfiability checker over infinite\/finite traces. In: The 22nd ACM SIGSOFT International Symposium, pp. 731\u2013734 (2014)","DOI":"10.1145\/2635868.2661669"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Li, J., Zhang, L., Pu, G., Vardi, M.Y., He, J.: LTL satisfiability checking revisited. In: 2013 20th International Symposium on Temporal Representation and Reasoning (TIME), pp. 91\u201398 (2013)","DOI":"10.1109\/TIME.2013.19"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/s10703-018-00326-5","volume":"54","author":"J Li","year":"2019","unstructured":"Li, J., Zhu, S., Pu, G., Zhang, L., Vardi, M.Y.: SAT-based explicit LTL reasoning and its application to satisfiability checking. Form. Methods Syst. Des. 54(2), 164\u2013190 (2019). https:\/\/doi.org\/10.1007\/s10703-018-00326-5","journal-title":"Form. Methods Syst. Des."},{"key":"1_CR16","unstructured":"Michaud, T., Colange, M.: Reactive synthesis from LTL specification with spot. In: Proceedings of the 7th Workshop on Synthesis (2018)"},{"key":"1_CR17","unstructured":"Piribauer, J., Baier, C.B.N.: Quantified linear temporal logic over probabilistic systems with an application to vacuity checking. In: International Conference on Concurrency Theory (2021)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic in programs. In: Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp. 46\u201357 (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Putnam, H.: Three-valued logic. The Logico-Algebraic Approach to Quantum Mechanics (1975)","DOI":"10.1007\/978-94-010-1795-4_5"},{"key":"1_CR21","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":"KY 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. 4595, pp. 149\u2013167. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73370-6_11"},{"key":"1_CR22","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). https:\/\/doi.org\/10.1007\/3-540-69778-0_28"},{"key":"1_CR23","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). https:\/\/doi.org\/10.1007\/978-3-642-31365-3_42"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45319-9_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"MY Vardi","year":"2001","unstructured":"Vardi, M.Y.: Branching vs. linear time: final showdown. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 1\u201322. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45319-9_1"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-69850-0_10","volume-title":"25 Years of Model Checking","author":"MY Vardi","year":"2008","unstructured":"Vardi, M.Y.: From church and prior to PSL. In: Grumberg, O., Veith, H. (eds.) 25 Years of Model Checking. LNCS, vol. 5000, pp. 150\u2013171. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69850-0_10"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency","author":"MY Vardi","year":"1996","unstructured":"Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238\u2013266. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60915-6_6"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Zhu, S., Giacomo, G.D., Pu, G., Vardi, M.: LTLf synthesis with fairness and stability assumptions. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, No. 03, pp. 3088\u20133095 (2019)","DOI":"10.1609\/aaai.v34i03.5704"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Zhu, W.: Big data on linear temporal logic formulas. In: 2021 IEEE 4th Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC), vol. 4, pp. 544\u2013547 (2021)","DOI":"10.1109\/IMCEC51613.2021.9482368"}],"container-title":["Communications in Computer and Information Science","Artificial Intelligence Logic and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-7510-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T15:10:35Z","timestamp":1716909035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-7510-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811975097","9789811975103"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-7510-3_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AILA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on AI Logic and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aila2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ailasym.com","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":"27","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":"19","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":"1","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":"70% - 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~4","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~4","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)"}}]}}