Publications
2024
Two Variable Logic with Ultimately Periodic Counting
Benedikt, M., Kostylev, E. V., & Tan, T. (2024). Two Variable Logic with Ultimately Periodic Counting. SIAM Journal on Computing, 53(4), 884-968. doi:10.1137/22m1504792
Decidability of Graph Neural Networks via Logical Characterizations
Benedikt, M., Lu, C. H., Motik, B., & Tan, T. (2024). Decidability of Graph Neural Networks via Logical Characterizations. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 297. doi:10.4230/LIPIcs.ICALP.2024.127
2023
On the complexity of k-DQBF
Tan, T., & Fung, L. -H. (2023). On the complexity of k-DQBF. In 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023). doi:10.4230/LIPIcs.SAT.2023.10
2021
Towards a more efficient approach for the satisfiability of two-variable logic
Lin, T. -W., Lu, C. -H., & Tan, T. (2021). Towards a more efficient approach for the satisfiability of two-variable logic. In 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE. doi:10.1109/lics52264.2021.9470502
2020
Two Variable Logic with Ultimately Periodic Counting.
Benedikt, M., Kostylev, E. V., & Tan, T. (2020). Two Variable Logic with Ultimately Periodic Counting.. In A. Czumaj, A. Dawar, & E. Merelli (Eds.), ICALP Vol. 168 (pp. 112:1). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Retrieved from https://www.dagstuhl.de/dagpub/978-3-95977-138-2
2015
On the Variable Hierarchy of First-Order Spectra
Kopczyński, E., & Tan, T. (2015). On the Variable Hierarchy of First-Order Spectra. ACM Transactions on Computational Logic, 16(2), 1-12. doi:10.1145/2733376
Regular Graphs and the Spectra of Two-Variable Logic with Counting
Kopczyński, E., & Tan, T. (2015). Regular Graphs and the Spectra of Two-Variable Logic with Counting. SIAM Journal on Computing, 44(3), 786-818. doi:10.1137/130943625