{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:50:13Z","timestamp":1764996613703,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031433443"},{"type":"electronic","value":"9783031433450"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43345-0_4","type":"book-chapter","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T22:01:49Z","timestamp":1697925709000},"page":"81-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Presheaf Semantics for\u00a0Quantified Temporal Logics"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Gadducci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Trotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,22]]},"reference":[{"issue":"228","key":"4_CR1","first-page":"591","volume":"57","author":"S Awodey","year":"2014","unstructured":"Awodey, S., Kishida, K., Kotzsch, H.: Topos semantics for higher-order temporal modal logic. Logique et Analyse 57(228), 591\u2013636 (2014)","journal-title":"Logique et Analyse"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71998-4_1","volume-title":"Recent Trends in Algebraic Development Techniques","author":"P Baldan","year":"2007","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B., Lluch Lafuente, A.: A temporal graph logic for verification of graph transformation systems. In: Fiadeiro, J.L., Schobbens, P.-Y. (eds.) WADT 2006. LNCS, vol. 4409, pp. 1\u201320. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71998-4_1"},{"key":"4_CR3","unstructured":"Belardinelli, F.: Quantified Modal Logic and the Ontology of Physical Objects. Ph.D. thesis, Scuola Normale Superiore of Pisa (2006)"},{"key":"4_CR4","unstructured":"Blackburn, P., van Benthem, J., Wolter, F. (eds.): Handbook of Modal Logic, North-Holland, vol. 3 (2007)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bra\u00fcner, T., Ghilardi, S.: First-order modal logic. In: Blackburn et al. [4], pp. 549\u2013620 (2007)","DOI":"10.1016\/S1570-2464(07)80012-7"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45465-9_51","volume-title":"Automata, Languages and Programming","author":"L Cardelli","year":"2002","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: A spatial logic for querying graphs. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 597\u2013610. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_51"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.ic.2006.10.006","volume":"205","author":"A Dawar","year":"2007","unstructured":"Dawar, A., Gardner, P., Ghelli, G.: Expressiveness and complexity of graph logic. Inf. Comput. 205(3), 263\u2013310 (2007)","journal-title":"Inf. Comput."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Distefano, D., Rensink, A., Katoen, J.: Model checking birth and death. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds.) IFIP TCS 2002. IFIP Conference Proceedings, vol. 223, pp. 435\u2013447. Kluwer (2002)","DOI":"10.1007\/978-0-387-35608-2_36"},{"key":"4_CR10","volume-title":"Categories, Allegories","author":"P Freyd","year":"1990","unstructured":"Freyd, P., Scedrov, A.: Categories, Allegories. Elsevier, Amsterdam (1990)"},{"issue":"1\u20132","key":"4_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.3233\/FI-2012-709","volume":"118","author":"F Gadducci","year":"2012","unstructured":"Gadducci, F., Lluch Lafuente, A., Vandin, A.: Counterpart semantics for a second-order $$\\mu $$-calculus. Fundamenta Informaticae 118(1\u20132), 177\u2013205 (2012)","journal-title":"Fundamenta Informaticae"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Gadducci, F., Laretto, A., Trotta, D.: Specification and verification of a linear-time temporal logic for graph transformation. In: Poskitt, C.M., Fernandez, M. (eds.) ICGT 2023. LNCS, vol. 13961, pp. 22\u201342. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-36709-0_2","DOI":"10.1007\/978-3-031-36709-0_2"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-33654-6_4","volume-title":"Graph Transformations","author":"F Gadducci","year":"2012","unstructured":"Gadducci, F., Lluch Lafuente, A., Vandin, A.: Exploiting over- and under-approximations for infinite-state counterpart models. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 51\u201365. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33654-6_4"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0167-6423(94)90006-X","volume":"22","author":"P Gardiner","year":"1994","unstructured":"Gardiner, P., Martin, C., de Moor, O.: An algebraic construction of predicate transformers. Sci. Comput. Program. 22(1), 21\u201344 (1994)","journal-title":"Sci. Comput. Program."},{"key":"4_CR15","unstructured":"Garson, J.: Modal logic. In: Zalta, E.N., Nodelman, U. (eds.) The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Spring 2023 edn. (2023)"},{"key":"4_CR16","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/BFb0081355","volume-title":"Categorical Algebra and its Applications","author":"S Ghilardi","year":"1988","unstructured":"Ghilardi, S., Meloni, G.C.: Modal and tense predicate logic: models in presheaves and categorical conceptualization. In: Borceux, F. (ed.) Categorical Algebra and its Applications. LNM, vol. 1348, pp. 130\u2013142. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0081355"},{"key":"4_CR17","unstructured":"Ghilardi, S., Meloni, G.: Relational and topological semantics for temporal and modal predicative logic. In: Corsi, G., Sambin, G. (eds.) Nuovi problemi della logica e della scienza II, pp. 59\u201377. CLUEB (1990)"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"843","DOI":"10.2307\/2275788","volume":"61","author":"S Ghilardi","year":"1996","unstructured":"Ghilardi, S., Meloni, G.: Relational and partial variable sets and basic predicate logic. J. Symb. Logic 61(3), 843\u2013872 (1996)","journal-title":"J. Symb. Logic"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-030-16722-6_16","volume-title":"Fundamental Approaches to Software Engineering","author":"H Giese","year":"2019","unstructured":"Giese, H., Maximova, M., Sakizloglou, L., Schneider, S.: Metric temporal graph logic over typed attributed graphs. In: H\u00e4hnle, R., van der Aalst, W. (eds.) FASE 2019. LNCS, vol. 11424, pp. 282\u2013298. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16722-6_16"},{"issue":"6","key":"4_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.2307\/2025472","volume":"76","author":"A Hazen","year":"1979","unstructured":"Hazen, A.: Counterpart-theoretic semantics for modal logic. J. Phil. 76(6), 319\u2013338 (1979)","journal-title":"J. Phil."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1051\/ita:2001108","volume":"35","author":"B Jacobs","year":"2001","unstructured":"Jacobs, B.: Many-sorted coalgebraic modal logic: a model-theoretic study. RAIRO-Theor. Inf. Appl. 35, 31\u201359 (2001)","journal-title":"RAIRO-Theor. Inf. Appl."},{"issue":"6","key":"4_CR22","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1017\/S096012950200378X","volume":"12","author":"B Jacobs","year":"2002","unstructured":"Jacobs, B.: The temporal logic of coalgebras via Galois algebras. Math. Struct. Comput. Sci. 12(6), 875\u2013903 (2002)","journal-title":"Math. Struct. Comput. Sci."},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/11691617_19","volume-title":"Model Checking Software","author":"H Kastenberg","year":"2006","unstructured":"Kastenberg, H., Rensink, A.: Model checking dynamic states in GROOVE. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol. 3925, pp. 299\u2013305. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691617_19"},{"issue":"38","key":"4_CR24","doi-asserted-by":"publisher","first-page":"5070","DOI":"10.1016\/j.tcs.2011.04.023","volume":"412","author":"C Kupke","year":"2011","unstructured":"Kupke, C., Pattinson, D.: Coalgebraic semantics of modal logics: an overview. Theor. Comput. Sci. 412(38), 5070\u20135094 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1111\/j.1746-8361.1969.tb01194.x","volume":"23","author":"F Lawvere","year":"1969","unstructured":"Lawvere, F.: Adjointness in foundations. Dialectica 23, 281\u2013296 (1969)","journal-title":"Dialectica"},{"key":"4_CR26","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BFb0080769","volume-title":"Category Theory, Homology Theory and their Applications II","author":"FW Lawvere","year":"1969","unstructured":"Lawvere, F.W.: Diagonal arguments and cartesian closed categories. In: Category Theory, Homology Theory and their Applications II. LNM, vol. 92, pp. 134\u2013145. Springer, Heidelberg (1969). https:\/\/doi.org\/10.1007\/BFb0080769"},{"issue":"5","key":"4_CR27","doi-asserted-by":"publisher","first-page":"113","DOI":"10.2307\/2024555","volume":"65","author":"D Lewis","year":"1968","unstructured":"Lewis, D.: Counterpart theory and quantified modal logic. J. Phil. 65(5), 113\u2013126 (1968)","journal-title":"J. Phil."},{"issue":"3","key":"4_CR28","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s11787-013-0080-2","volume":"7","author":"M Maietti","year":"2013","unstructured":"Maietti, M., Rosolini, G.: Quotient completion for the foundation of constructive mathematics. Logica Universalis 7(3), 371\u2013402 (2013)","journal-title":"Logica Universalis"},{"issue":"7","key":"4_CR29","first-page":"248","volume":"12","author":"S Niefield","year":"2004","unstructured":"Niefield, S.: Change of base for relational variable sets. Theory Appl. Categories 12(7), 248\u2013261 (2004)","journal-title":"Theory Appl. Categories"},{"issue":"12","key":"4_CR30","first-page":"288","volume":"24","author":"S Niefield","year":"2010","unstructured":"Niefield, S.: Lax presheaves and exponentiability. Theory Appl. Categories 24(12), 288\u2013301 (2010)","journal-title":"Theory Appl. Categories"},{"key":"4_CR31","unstructured":"Orlandelli, E.: Labelled sequent calculi for indexed modal logics. CLEUB (2023)"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS 1977, pp. 46\u201357. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.32"},{"issue":"1","key":"4_CR33","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0022-0000(85)90003-0","volume":"30","author":"J Reif","year":"1985","unstructured":"Reif, J., Sistla, A.: A multiprocess network logic with temporal and spatial modalities. J. Comput. Syst. Sci. 30(1), 41\u201353 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11817949_8","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"A Rensink","year":"2006","unstructured":"Rensink, A.: Model checking quantified computation tree logic. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 110\u2013125. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817949_8"},{"key":"4_CR35","volume-title":"Quantales and Their Applications","author":"K Rosenthal","year":"1990","unstructured":"Rosenthal, K.: Quantales and Their Applications. Longman, London (1990)"},{"issue":"5","key":"4_CR36","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.jcss.2014.12.007","volume":"81","author":"P Sobocinski","year":"2015","unstructured":"Sobocinski, P.: Relational presheaves, change of base and weak simulation. J. Comput. Syst. Sci. 81(5), 901\u2013910 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR37","first-page":"1576","volume":"35","author":"D Trotta","year":"2020","unstructured":"Trotta, D.: The existential completion. Theory Appl. Categories 35, 1576\u20131607 (2020)","journal-title":"Theory Appl. Categories"},{"issue":"5","key":"4_CR38","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1093\/jigpal\/jzl009","volume":"14","author":"E Yahav","year":"2006","unstructured":"Yahav, E., Reps, T., Sagiv, M., Wilhelm, R.: Verifying temporal heap properties specified via evolution logic. Logic J. IGPL 14(5), 755\u2013783 (2006)","journal-title":"Logic J. IGPL"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43345-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T22:02:39Z","timestamp":1697925759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43345-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031433443","9783031433450"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43345-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algebraic Development Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aveiro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wadt2022.web.ua.pt\/","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":"25","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":"8","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":"32% - 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","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":"1","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}