| 2025 | ACL | Unravelling the Logic: Investigating the Generalisation of Transformers in Numerical Satisfiability Problems. | Tharindu Madusanka, Marco Valentino, Iqra Zahid, Ian Pratt-Hartmann, Riza Batista-Navarro |
| 2024 | ACL | Natural Language Satisfiability: Exploring the Problem Distribution and Evaluating Transformer-based Language Models. | Tharindu Madusanka, Ian Pratt-Hartmann, Riza Batista-Navarro |
| 2024 | CPM | Walking on Words. | Ian Pratt-Hartmann |
| 2024 | EACL | Improving Semantic Control in Discrete Latent Spaces with Transformer Quantized Variational Autoencoders. | Yingji Zhang, Danilo S. Carvalho, Marco Valentino, Ian Pratt-Hartmann, Andr Freitas |
| 2024 | NAACL | Graph-Induced Syntactic-Semantic Spaces in Transformer-Based Variational AutoEncoders. | Yingji Zhang, Marco Valentino, Danilo S. Carvalho, Ian Pratt-Hartmann, Andr Freitas |
| 2023 | CSL | Adding Transitivity and Counting to the Fluted Fragment. | Ian Pratt-Hartmann, Lidia Tendera |
| 2023 | EACL | Identifying the limits of transformers when performing model-checking with natural language. | Tharindu Madusanka, Riza Theresa Batista-Navarro, Ian Pratt-Hartmann |
| 2023 | EMNLP | Not all quantifiers are equal: Probing Transformer-based language models' understanding of generalised quantifiers. | Tharindu Madusanka, Iqra Zahid, Hao Li, Ian Pratt-Hartmann, Riza Batista-Navarro |
| 2023 | ICALP | On the Limits of Decision: the Adjacent Fragment of First-Order Logic. | Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann |
| 2022 | EMNLP | Can Transformers Reason in Fragments of Natural Language? | Viktor Schlegel, Kamen V. Pavlov, Ian Pratt-Hartmann |
| 2021 | ICALP | Fluted Logic with Counting. | Ian Pratt-Hartmann |
| 2019 | MFCS | The Fluted Fragment with Transitivity. | Ian Pratt-Hartmann, Lidia Tendera |
| 2018 | LPAR | Two-variable First-Order Logic with Counting in Forests. | Witold Charatonik, Yegor Guskov, Ian Pratt-Hartmann, Piotr Witkowski |
| 2016 | CSL | Quine's Fluted Fragment is Non-Elementary. | Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera |
| 2014 | CSL | Logics with counting and equivalence. | Ian Pratt-Hartmann |
| 2012 | LICS | Two-Variable First-Order Logic with Equivalence Closure. | Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera |
| 2011 | IJCAI | On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces. | Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev |
| 2010 | CSL | On the Computability of Region-Based Euclidean Logics. | Yavor Nenov, Ian Pratt-Hartmann |
| 2010 | KR | Interpreting Topological Logics over Euclidean Spaces. | Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakharyaschev |
| 2010 | TIME | Decidability of the Logics of the Reflexive Sub-interval and Super-interval Relations over Finite Linear Orders. | Angelo Montanari, Ian Pratt-Hartmann, Pietro Sala |
| 2010 | WoLLIC | The Two-Variable Fragment with Counting Revisited. | Ian Pratt-Hartmann |
| 2009 | CiE | Functions Definable by Arithmetic Circuits. | Ian Pratt-Hartmann, Ivo Dntsch |
| 2009 | LICS | A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. | Yevgeny Kazakov, Ian Pratt-Hartmann |
| 2008 | AiML | Topology, connectedness, and modal logic. | Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev |
| 2008 | LPAR | On the Computational Complexity of Spatial Logics with Connectedness Constraints. | Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev |
| 2004 | TIME | Temporal Prepositions and Their Logic. | Ian Pratt-Hartmann |
| 2001 | CADE | A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality. | Hans de Nivelle, Ian Pratt-Hartmann |
| 2000 | AAAI | Total Knowledge. | Ian Pratt-Hartmann |