D'Costa, J., Karimov, T., Majumdar, R., Ouaknine, J., Salamati, M., Soudjani, S., & Worrell, J. (2021). The pseudo-Skolem Problem is decidable. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Chicago Style (17th ed.) CitationD'Costa, J., T. Karimov, R. Majumdar, J. Ouaknine, M. Salamati, S. Soudjani, and J. Worrell. The Pseudo-Skolem Problem Is Decidable. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
MLA (9th ed.) CitationD'Costa, J., et al. The Pseudo-Skolem Problem Is Decidable. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
Warning: These citations may not always be 100% accurate.