{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:18:28Z","timestamp":1743135508297,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030992521"},{"type":"electronic","value":"9783030992538"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:00:00Z","timestamp":1648512000000},"content-version":"vor","delay-in-days":87,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadic generalization of guarded two-variable logic, has the Craig interpolation property. We will also prove that the satisfiability problem of uniform guarded fragment is <jats:sc>NExpTime<\/jats:sc>-complete.<\/jats:p>","DOI":"10.1007\/978-3-030-99253-8_21","type":"book-chapter","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T20:02:48Z","timestamp":1648497768000},"page":"409-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Uniform Guarded Fragments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4714-4637","authenticated-orcid":false,"given":"Reijo","family":"Jaakkola","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,29]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic 27, 217\u2013274 (1998)","DOI":"10.1023\/A:1004275029985"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e1r\u00e1ny, V., Benedikt, M., Cate, B.T.: Some model theory of guarded negation. The Journal of Symbolic Logic 83, 1307 \u2013 1344 (2018)","DOI":"10.1017\/jsl.2018.64"},{"key":"21_CR3","unstructured":"Bell, J., Slomson, A.: Models and Ultraproducts: An Introduction. Dover Books on Mathematics Series, Dover Publications (2006)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"van Benthem, J.: The many faces of interpolation. Synthese 164(3), 451\u2013460 (2008)","DOI":"10.1007\/s11229-008-9351-5"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Blackburn, P., Rijke, M.d., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press (2001)","DOI":"10.1017\/CBO9781107050884"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M.: Craig\u2019s interpolation theorem for modal logics. In: Hodges, W. (ed.) Conference in Mathematical Logic \u2014 London \u201970. pp. 111\u2013127. Springer Berlin Heidelberg, Berlin, Heidelberg (1972)","DOI":"10.1007\/BFb0059541"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E.: On the restraining power of guards. Journal of Symbolic Logic 64(4), 1719\u20131742 (1999)","DOI":"10.2307\/2586808"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Kolaitis, P., Vardi, M.: On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic 3(1), 53\u201369 (1997)","DOI":"10.2307\/421196"},{"key":"21_CR9","unstructured":"Hella, L., Kuusisto, A.: One-dimensional fragment of first-order logic. In: Advances in Modal Logic. vol.\u00a010, pp. 274\u2013293 (08 2014)"},{"key":"21_CR10","unstructured":"Herzig, A.: A new decidable fragment of first order logic. In: 3rd Logical Biennial Summer School and Conference in Honour of SC Kleene (1990)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Hoogland, E., Marx, M.: Interpolation and definability in guarded fragments. Studia Logica: An International Journal for Symbolic Logic 70(3), 373\u2013409 (2002)","DOI":"10.1023\/A:1015154431342"},{"key":"21_CR12","unstructured":"Jaakkola, R.: Ordered Fragments of First-Order Logic. In: 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0202, pp. 62:1\u201362:14 (2021)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Jung, J.C., Wolter, F.: Living without beth and craig: Definitions and interpolants in the guarded and two-variable fragments. 2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS) pp. 1\u201314 (2021)","DOI":"10.1109\/LICS52264.2021.9470585"},{"key":"21_CR14","unstructured":"Kieronski, E.: One-Dimensional Logic over Words. In: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 62, pp. 38:1\u201338:15 (2016)"},{"key":"21_CR15","unstructured":"Kieronski, E.: One-Dimensional Guarded Fragments. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0138, pp. 16:1\u201316:14 (2019)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Kieronski, E., Kuusisto, A.: Complexity and expressivity of uniform one-dimensional fragment with equality. In: 39nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2014). Lecture Notes in Computer Science, vol.\u00a08634, pp. 365\u2013376 (2014)","DOI":"10.1007\/978-3-662-44522-8_31"},{"key":"21_CR17","unstructured":"Kier\u00f3nski, E., Kuusisto, A.: Uniform One-Dimensional Fragments with One Equivalence Relation. In: 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a041, pp. 597\u2013615 (2015)"},{"key":"21_CR18","unstructured":"Kieronski, E., Kuusisto, A.: One-Dimensional Logic over Trees. In: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a083, pp. 64:1\u201364:13 (2017)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Marx, M.: Interpolation in modal logic. In: Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology. p. 154\u2013163. AMAST \u201998, Springer-Verlag, Berlin, Heidelberg (1999)","DOI":"10.1007\/3-540-49253-4_13"},{"key":"21_CR20","unstructured":"Mogavero, F., Perelli, G.: Binding Forms in First-Order Logic. In: 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a041, pp. 648\u2013665 (2015)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-99253-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T20:08:19Z","timestamp":1648498099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99253-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030992521","9783030992538"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99253-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"4 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2022\/fossacs","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":"77","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":"23","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":"30% - 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":"9","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)"}}]}}