Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the Satisfiability of Local First-Order Logics with Data (2307.00831v4)

Published 3 Jul 2023 in cs.LO

Abstract: We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the satisfiability problem for this logic is undecidable in general, we introduce a family of local fragments. They restrict quantification to the neighbourhood of a given reference point that is bounded by some radius. Our first main result establishes decidability of the satisfiability problem for the local radius-1 fragment in presence of one "diagonal relation". On the other hand, extending the radius leads to undecidability. In a second part, we provide the precise decidability and complexity landscape of the satisfiability problem for the existential fragments of local logic, which are parameterized by the number of data values carried by each element and the radius of the considered neighbourhoods. Altogether, we draw a landscape of formalisms that are suitable for the specification of systems with data and open up new avenues for future research.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (33)
  1. An automata-theoretic approach to the verification of distributed algorithms. Inf. Comput., 259(Part 3):305–327, 2018.
  2. H. Björklund and M. Bojanczyk. Shuffle expressions and words with nested data. In Ludek Kucera and Antonín Kucera, editors, Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, volume 4708 of Lecture Notes in Computer Science, pages 750–761. Springer, 2007.
  3. Identifiers in registers - describing network algorithms with logic. In FOSSACS’19, volume 11425 of LNCS, pages 115–132. Springer, 2019.
  4. Two-variable logic on data words. ACM Trans. Comput. Log., 12(4):27:1–27:26, 2011.
  5. The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, 1997. doi:10.1023/A:1008334715902.
  6. The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, 1997.
  7. Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, 2015.
  8. B. Bollig and D. Kuske. An optimal construction of Hanf sentences. J. Appl. Log., 10(2):179–186, 2012. doi:10.1016/j.jal.2012.01.002.
  9. Two-variable logic on data trees and XML reasoning. J. ACM, 56(3), 2009.
  10. Local first-order logic with two data values. In Mikolaj Bojanczyk and Chandra Chekuri, editors, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference, volume 213 of LIPIcs, pages 39:1–39:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. doi:10.4230/LIPIcs.FSTTCS.2021.39.
  11. On the existential fragments of local first-order logics with data. In Pierre Ganty and Dario Della Monica, editors, Proceedings of the 13th International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2022, Madrid, Spain, September 21-23, 2022, volume 370 of EPTCS, pages 1–16, 2022. doi:10.4204/EPTCS.370.1.
  12. B. Bednarczyk and P. Witkowski. A Note on C2 Interpreted over Finite Data-Words. In 27th International Symposium on Temporal Representation and Reasoning, TIME 2020, September 23-25, 2020, Bozen-Bolzano, Italy, volume 178 of LIPIcs, pages 17:1–17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. doi:10.4230/LIPIcs.TIME.2020.17.
  13. Ordered navigation on multi-attributed data words. In Paolo Baldan and Daniele Gorla, editors, CONCUR 2014 - Concurrency Theory - 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings, volume 8704 of Lecture Notes in Computer Science, pages 497–511. Springer, 2014.
  14. On reasoning about rings. Int. J. Found. Comput. Sci., 14(4):527–550, 2003.
  15. J. Esparza. Keeping a crowd safe: On the complexity of parameterized verification (invited talk). In STACS’14), volume 25 of LIPIcs, pages 1–10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.
  16. First-order logic with two variables and unary temporal logic. Inf. Comput., 179(2):279–295, 2002. doi:10.1006/inco.2001.2953.
  17. M. Fitting. Torben braüner, hybrid logic and its proof-theory, applied logic series volume 37, springer, 2011, pp. XIII+231. ISBN: 978-94-007-0001-7. Stud Logica, 100(5):1051–1053, 2012. doi:10.1007/s11225-012-9439-2.
  18. W. Fokkink. Distributed Algorithms: An Intuitive Approach. MIT Press, 2013.
  19. S. Grumbach and Z. Wu. Logical locality entails frugal distributed computation over graphs (extended abstract). In WG’09, volume 5911 of LNCS, pages 154–165. Springer, 2009.
  20. W. Hanf. Model-theoretic methods in the study of elementary logic. In J.W. Addison, L. Henkin, and A. Tarski, editors, The Theory of Models, pages 132–145. North Holland, 1965.
  21. A. Janiczak. Undecidability of some simple formalized theories. Fundamenta Mathematicae, 40:131–139, 1953.
  22. E. Kieronski. Results on the guarded fragment with equivalence or transitive relations. In C.-H. Luke Ong, editor, CSL’05, volume 3634 of LNCS, pages 309–324. Springer, 2005.
  23. Two-variable first-order logic with equivalence closure. In LICS’12, pages 431–440. IEEE, 2012.
  24. Temporal logics on words with multiple data values. In Kamal Lodaya and Meena Mahajan, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, volume 8 of LIPIcs, pages 481–492. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.
  25. E. Kieronski and L. Tendera. On finite satisfiability of two-variable first-order logic with equivalence relations. In LICS’09, pages 123–132. IEEE, 2009.
  26. What you always wanted to know about model checking of fault-tolerant distributed algorithms. In PSI’15 in Memory of Helmut Veith, volume 9609 of LNCS, pages 6–21. Springer, 2015.
  27. L. Libkin. Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2004.
  28. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., 1996.
  29. M. Mundhenk and T. Schneider. The complexity of hybrid logics over equivalence relations. J. Log. Lang. Inf., 18(4):493–514, 2009. doi:10.1007/s10849-009-9089-6.
  30. A. Manuel and T. Zeume. Two-variable logic on 2-dimensional structures. In Simona Ronchi Della Rocca, editor, Computer Science Logic 2013 (CSL 2013), CSL 2013, September 2-5, 2013, Torino, Italy, volume 23 of LIPIcs, pages 484–499. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013.
  31. M. Otto. Two-variable first-order logic over ordered domains. Journal of Symbolic Logic, 66:685–702, 2001.
  32. L. Segoufin. Automata and logics for words and trees over an infinite alphabet. In CSL’06, volume 4207 of LNCS, pages 41–57. Springer, 2006.
  33. T. Tan. Extending two-variable logic on data trees with order on data values and its automata. ACM Trans. Comput. Log., 15(1):8:1–8:39, 2014.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now