Homepage of Dr Ian Pratt-Hartmann

Dr. Pratt-Hartmann's research interests range widely over the field of AI and cognitive science, including computational logic, spatial logic and natural language semantics. For those who are interested in that sort of thing, here is a link to his Google Scholar page, and here is a link to his Web Of Science profile.

News and current affairs

• Interesting new book on Computational Logic: Fragments of First-Order Logic, Oxford University Press, ISBN 978 0 19 286796 4, 650 pp., 2023 (slightly cheaper on Amazon, also available in various electronic formats).
• Report: Why are so many academics left-wing?

arXiv repository

Select Bibliography

The following papers form a representative sample of Ian Pratt-Hartmann's work. Many conference papers are omitted: click here for a (reasonably up-to-date) full bibliography. Note that some links on this page are to pre-print versions; please check with the published versions when quoting.

• Books
  • Ian Pratt-Hartmann: Fragments of First-Order Logic, Oxford University Press, ISBN 978 0 19 286796 4, 650 pp., 2023 (electronic formats).
  • Marco Aiello, Ian Pratt-Hartmann and Johan van Benthem: Handbook of Spatial Logics, Springer, 2007. 1058 p., Hardcover, ISBN: 978-1-4020-5586-7.
  • Ian Pratt: Artificial Intelligence, London: Macmillan, 1994. (pp. 280). ISBN 0333 597599. Click here for the preface.
• Submitted papers
  • Bartosz Bednarczyk, Daumantas Kojelis and Ian Pratt-Hartmann: The Adjacent Fragment and Quine's Limits of Decision.
• Forthcoming work
  • Currently none
• Word combinatorics
  • Ian Pratt-Hartmann: "Walking on Words", in 35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024), pp. 25:1--25:17.
• Computational Logic
  • Bartosz Bednarczyk, Daumantas Kojelis and Ian Pratt-Hartmann: ``On the Limits of Decision: the Adjacent Fragment of First-Order Logic'', in 50th International Conference on Automata, Languages and Programming (ICALP 2023), pp. 111:1--21.
  • Ian Pratt-Hartmann and Lidia Tendera: ``Adding Transitivity and Counting to the Fluted Fragment'', 31st EACSL Annual Conference on Computer Science Logic (CSL 2023), pp. 32:1--32:22, Leibniz International Proceedings in Informatics (LIPIcs), 2023
  • Ian Pratt-Hartmann and Lidia Tendera: The fluted fragment with transitive relations, Annals of Pure and Applied Logic 173, 2022, art. 103042, pp. 1--43. ( author-final version).
  • Ian Pratt-Hartmann: Fluted Logic with Counting, 48th International Colloquium on Automata, Languages and Programming (ICALP 2021), pp. 141:1--141:17, Leibniz International Proceedings in Informatics (LIPIcs), 2021
  • Ian Pratt-Hartmann, Wiesław Szwast and Lidia Tendera: The Fluted Fragment Revisited, Journal of Symbolic Logic, vol 84(3), 2019, pp. 1020--1048 (author-final version).
  • Ian Pratt-Hartmann and Lidia Tendera: The Fluted Fragment with Transitivity, Forty-fourth International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 18:1--15 Leibniz International Proceedings in Mathematics, vol. 138.
  • Ian Pratt-Hartmann: The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable, Mathematical Logic Quarterly, 64(3), 2018, pp. 218--248.
  • Emanuel Kieroński, Ian Pratt-Hartmann and Lidia Tendera: Two-variable logics with counting and semantic constraints, ACM SIGLOG News, Volume 5(3), 2018, pp. 22--43 (Alternative source).
  • Georgios Kourtis and Ian Pratt-Hartmann: Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting, Logical Methods in Computer Science, Vol. 13 (4:4), 2017, pp. 1--39.
  • Emanuel Kieroński, Ian Pratt-Hartmann and Lidia Tendera: "Equivalence closure in the two-variable guarded fragment", Journal of Logic and Computation, 27(4), 2017, pp. 999--1021.
  • Ian Pratt-Hartmann, Wiesław Szwast and Lidia Tendera: Quine's Fluted Fragment is Non-elementary, in Jean-Marc Talbot and Laurent Regnier (Eds.), Proceedings, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), LIPICS, pp. 39:1--39:21.
  • Ian Pratt-Hartmann: "The two-variable fragment with counting and equivalence", Mathematical Logic Quarterly, 61(6), 2015, pp. 474--515 (open access).
  • Ian Pratt-Hartmann "Logics with counting and equivalence", Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Art. 76, 2014. (Author-final version.)
  • Emanuel Kieroński, Jakub Michaliszyn, Ian Pratt-Hartmann and Lidia Tendera: "Two-variable First-order Logic with Equivalence Closure" , SIAM Journal on Computing, 43(3), 2014, pp. 1012--1063.
  • Emanuel Kieroński, Jakub Michaliszyn, Ian Pratt-Hartmann and Lidia Tendera: "Two-variable First-order Logic with Equivalence Closure'', in Proceedings, 27th Annual IEEE Symposium on Logic in Computer Science (LICS '12), IEEE Press, 2012, pp. 431--440.
  • Angelo Montanari, Ian Pratt-Hartmann and Pietro Sala: "Decidability of the Logics of the Reflexive Sub-interval and Super-interval Relations over Finite Linear Orders'', in N. Markey and J. Wijsen (eds.): Temporal Representation and Reasoning (TIME 2010), IEEE Press, 2010, pp. 27--34 (author-final version).
  • Ian Pratt-Hartmann: "The Two-Variable Fragment with Counting Revisited", in A. Dawar and R. de Queiroz (Eds.): WoLLIC 2010, LNAI 6188, pp. 42--54, 2010 (author-final version).
  • Yevgeny Kazakov and Ian Pratt-Hartmann: "A note on the complexity of the satisfiability problem for graded modal logic", in Proceedings, 24th Annual IEEE Symposium on Logic in Computer Science (LICS '09), IEEE Press, 2009, pp. 407--416. (Full version of the paper posted on http://arxiv.org).
  • Ian Pratt-Hartmann Data-Complexity of the Two-Variable Fragment with Counting Quantifiers, Information and Computation, 207(8), 2009, pp. 867--888 (pre-print version posted on http://arxiv.org ).
  • Ian Pratt-Hartmann "On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics'', Bulletin of Symbolic Logic, 14(1), 2008, pp. 1--28 (pre-print version posted on http://arxiv.org).
  • Ian Pratt-Hartmann "Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers'', Journal of Logic and Computation, 17(1), 2007, pp. 133--155. (A preprint version may be found on the ArXiv preprint server.)
  • Ian Pratt-Hartmann "Complexity of the Two-Variable Fragment with Counting Quantifiers'' , Journal of Logic, Language and Information, 14(3), 2005, pp. 369--395 (author-final version). Hans de Nivelle and Ian Pratt-Hartmann: "A resolution-based decision procedure of the two-variable fragment with equality'' in R. Gore, A. Leitsch and T. Nipkow (Eds.): IJCAR 2001, LNCS 2083, pp. 211--255, 2001.
• Natural language and logic
  • Tharindu Madusanka, Ian Pratt-Hartmann and Riza Batista-Navarro: Natural Language Satisfiability: Exploring the Problem Distribution and Evaluating Transformer-based Language Models, Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 15278--15294, 2024 (recipient of Best Non-Publicized Paper Award).
  • Tharindu Madusanka, Riza Batista Navarro and Ian Pratt-Hartmann: "Identifying the limits of transformers when performing model-checking with natural language", Proceedings of the 17th Conference of the European Chapter of the Association for Compuational Linguistics (EACL), pp. 3539--3550, 2023 (recipient of EACL Outstanding Paper Award).
  • Viktor Schlegel, Kamen Pavlov and Ian Pratt-Hartmann: "Can Transformers Reason in Fragments of Natural Language?", Proceedsings of the 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 11184--11199, 2022 (also available on arXiv).
  • Ian Pratt-Hartmann: "Semantic complexity in Natural Language", in S. Lappin and Chris Fox (eds.) The Handbook of Contemporary Semantic Theory, 2nd Edition, Wiley Blackwell, 2015, pp. 429--454. (Author-final-version.)
  • Ian Pratt-Hartmann: The Relational Syllogistic Revisited, Linguistic Issues in Language Technology, 9, 2014, pp. 195--227. (Author-final-version.)
  • Ian Pratt-Hartmann: The Syllogistic with Unity, Journal of Philosophical Logic, 42(2),2013 , pp 391-407 (author-final version).
  • Ian Pratt-Hartmann: The Hamiltonian Syllogistic, Journal of Logic, Language and Information, 20(4), 2011, pp. 445--474 (preprint version posted on on the ArXiv preprint server ).
  • Ian Pratt-Hartmann: Computational Complexity in Natural Language, in A. Clark, C. Fox and S. Lappin (eds.) The Handbook of Computational Linguistics and Natural Language Processing, Wiley-Blackwell, 2010, pp. 43--73, (author-final version).
  • Ian Pratt-Hartmann and Lawrence S. Moss Logics for the Relational Syllogistic, Review of Symbolic Logic, 2(4), 2009, pp. 647--683 (pre-print version posted on http://arxiv.org ).
  • Ian Pratt-Hartmann No syllogisms for the numerical syllogistic, in Grumberg et al. (Eds.): Languages: from Formal to Natural, LNCS 5533, Springer, 2009, pp. 192-203 (author-final version).
  • Ian Pratt-Hartmann and Allan Third "More Fragments of Language: the Case of Ditransitive Verbs'', Notre Dame Journal of Formal Logic, 47(2), 2006, pp.151--177 (author-final version).
  • Ian Pratt-Hartmann "Temporal Prepositions and their Logic'' , Artificial Intelligence, 166(1--2), 2005, pp. 1--36 (author-final version).
  • Ian Pratt-Hartmann "Fragments of Language'', Journal of Logic, Language and Information, 13(2), 2004, pp. 207--223 (author-final version).
  • Ian Pratt-Hartmann "A Two-Variable Fragment of English'', Journal of Logic, Language and Information, 12(1), 2003, pp. 13--45 (author-final version).
  • Ian Pratt and Nissim Francez "Temporal Prepositions and Temporal Generalized Quantifiers'', Linguistics and Philosophy, 24(2), 2001, pp. 187--222 (author-final version).
• Spatial Logic
  • Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakharyaschev: Spatial Reasoning with RCC8 and Connectedness Constraints in Euclidean Spaces, Artificial Intelligence, 217, 2014, pp. 43--75. (Author-final version.)
  • Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann and Michael Zakharyaschev: Topological Logics with Connectedness over Euclidean Spaces, ACM Transactions on Computational Logic, 14(2:13), 2013. (A preprint version may be found on the ArXiv preprint server.)
  • Ian Pratt-Hartmann: "Twenty Years of Topological Logic'', in M. Raubal, D.M. Mark, A.U. Frank (eds.), Cognitive and Linguistic Aspects of Geographic Space: New Perspectives on Geographic Information Research, Berlin: Springer, 2012, pp. 217--235.
  • Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann and Michael Zakharyaschev: On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces, Proceedings of the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI 2011), AAAI Press, 2011, pp. 957--962 (recipient of IJCAI Distinguished Paper Award). (full version, with proofs).
  • Yavor Nenov and Ian Pratt-Hartmann: "On the Computability of Region-Based Spatial Logics'', in A. Dawar and H. Veith (eds.), Computer Science Logic (CSL 2010), Lecture Notes in Computer Science 6247, pp. 439-453. (Submitted version.)
  • Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev: Spatial logics with connectedness predicates, Logical Methods in Computer Science Vol. 6 (3:7), 2010 (author-final version).
  • R. Kontchakov, I. Pratt-Hartmann and M. Zakharyaschev: Interpreting Topological Logics over Euclidean Spaces, in Proceedings of Twelfth International Conference on the Principles of Knowledge Representation and Reasoning (KR 2010), AAAI Press, 2010, pp. 534--544 (author-final version).
  • R. Kontchakov, I. Pratt-Hartmann, F. Wolter and M. Zakharyaschev: On the computational complexity of spatial logics with connectedness constraints, in Iliano Cervesato, Helmut Veith and Andrei Voronkov (eds.), Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2008), Lecture Notes in Computer Science 5330, pp. 574-589, 2008. (Author-final version.)
  • Marco Aiello, Ian Pratt-Hartmann and Johan van Benthem: "What is Spatial Logic?'' (author version), in Aiello, Pratt-Hartmann and van Benthem (eds.), Handbook of Spatial Logics, Springer, 2007, pp. 1--11.
  • Ian Pratt-Hartmann "First-Order Mereotopology'' (author version), in in Aiello, Pratt-Hartmann and van Benthem (eds.), Handbook of Spatial Logics, Springer, 2007, pp. 13--97.
  • Ian Pratt-Hartmann: "A Topological Constraint Language with Component Counting'', Journal of Applied Non-Classical Logics, 12(3--4), 2002, pp. 441--467 (author-final version).
  • Ian Pratt-Hartmann and Dominik Schoop: "Elementary Polyhedral Mereotopology'', Journal of Philosophical Logic, 31(5), 2002, pp. 469--498 (author-final version).
  • Ian Pratt-Hartmann: "Empiricism and Rationalism in Region-based Theories of Space'', Fundamenta Informaticae 46, 2001, pp. 159--186. (Compressed version )
  • Ian Pratt and Dominik Schoop: "Expressivity in Polygonal, Plane Mereotopology'', Journal of Symbolic Logic, 65(2), 2000, pp. 822--838.
  • Ian Pratt: "First-Order Qualitative Spatial Representation Languages with Convexity'', Journal of Spatial Cognition and Computation, 1(2), 1999, pp. 181--204 (author-final version).
  • Ian Pratt and Dominik Schoop: "A complete axiom system for polygonal mereotopology of the real plane'', Journal of Philosophical Logic, 27(6), 1998, pp. 621--658 (author-final version).
  • Ian Pratt and Oliver Lemon: "Ontologies for plane polygonal mereotopology'', Notre Dame Journal of Formal Logic, 38(2) 1997, pp. 225--245 (author-final version).
• Philosophy of mind/language
  • Ian Pratt: "Encoding Psychological Knowledge'', in Clark, A. and Millican, P. (eds.) Connectionism, Concepts and Folk Psychology: The legacy of Alan Turing, Oxford: Clarendon Press, 1996, pp. 249--264.
  • Ian Pratt "Analysis and the Attitudes" in Wagner, S. and Warner, S. (eds.): Naturalism: a critical appraisal, Notre Dame, IN: University of Notre Dame Press, 1993.
  • Ian Pratt: "Psychological Inference, Constitutive Rationality and Logical Closure", in Hanson, P. (ed.): Vancouver Studies in Cognitive Science, vol.1, University of British Columbia Press, 1989, pp. 366--389.
  • Ian Pratt: "Constraints, Meaning and Information" Linguistics and Philosophy 10, 1987, pp. 299--324 (not available online).
• Miscellaneous
  • Ian Pratt-Hartmann and Ivo Düntsch: Functions definable by numerical set-expressions, Journal of Logic and Computation, 24(4), 2013, pp. 873-895. (author-final version).
  • Ivo Düntsch and Ian Pratt-Hartmann: Complex Algebras of Arithmetic, Fundamenta Informaticae, 97 (4), 2009, pp. 347-367 (author-final version).
  • Ian Pratt-Hartmann and Ivo Düntsch: Functions definable by arithmetic circuits, in K. Ambos-Spies, B. Löwe and W. Merkle (Eds.): Mathematical Theory and Computational Practice: 5th Conference on Computability in Europe, CiE 2009, LNCS 5635, 2009, pp. 409--418 (author-final version).
  • Ian Pratt-Hartmann: Conditionalization and Total Knowledge. Journal of Applied Non-Classical Logics 18 (2-3), 2008, pp. 247--266 (author-final version).
  • Ian Pratt: "Total Knowledge'', in Proceedings, AAAI, 2000, pp. 423--428. (Gzipped version)
  • Ian Pratt: "Shape Representation Using Fourier Coefficients of the Sinusoidal Transform'', Journal of Mathematical Imaging and Vision, 10, 1999, pp. 221--235 (author-final version).
  • Ian Pratt: "An algorithm for planning `sensible' routes'', Engineering Applications of Artificial Intelligence, 4(2), 1991, pp. 97--108.

  PhD. Students

  • Yegor Guskov: Decidability of Finite Satisfiability of Two-Variable First-Order Logic with Counting and Local Navigation in Unordered Unranked Trees. PhD. awarded June, 2018. External examiner: Prof. L. Tendera (Opole University). Internal examiner: Dr. Renate Schmidt.
  • Aoade Adeniyi: Controlled Natural Language with Temporal Features. PhD. awarded June, 2018. External examiner: Prof. Tobias Kuhn (Free University of Amsterdam). Internal examiner: Dr. John McNaught
  • Reyadh Alluhaibi: Temporal Controlled Natural Language for Formal Specification . PhD. awarded February, 2018. External examiner: Dr. A. Galton (Exeter University). Internal examiner: Prof. Allan Ramsay.
  • Georgios Kourtis: Path-Functional Dependencies and the Two-Variable Guarded Fragment with Counting". PhD. awarded February, 2017. External examiner: Prof. Magdalena Ortiz (Technical University of Vienna). Internal examiner: Prof. Ulrike Sattler.
  • Adam Trybus: An Axiom System for a Spatial Logic with Convexity. PhD. awarded December, 2011. External examiner: Dr. A. Galton (Exeter University). Internal examiner: Dr. Renate Schmidt.
  • Yavor Nenov: Computability of Euclidean Logics. PhD. awarded December, 2011. External examiner: Prof. F. Wolter (University of Liverpool). Internal examiner: Prof. Ulrike Sattler.
  • Aled Griffiths: Computational Properties of Spatial Logics in the Real Plane. PhD. awarded November, 2008. External examiner: Dr. Brandon Bennett (Leeds University). Internal examiner: Dr. David Lester.
  • Savas Konur: An Interval Temporal Logic for Real-Time System Specification. PhD. awarded, August, 2008. External examiner: Dr. Clair Dixon (Liverpool University). Internal examiner: Prof. David Bree.
  • Allan Third: Logical Analysis of Fragments of Natural Language. PhD. awarded 2006. External examiner: Prof. Dov Gabbay (King's College, London). Internal examiner: Prof. Ulrike Sattler.
  • Nick Player: Logics of Ambinguity. PhD. awarded August, 2004. External examiner: Dr. Patrick Blackburn (LORIA, Nancy). Internal examiner: Dr. D. Rydeheard.
  • Dominik Schoop: A Model-Theoretic Approach to Mereotopology. PhD. awarded August, 1999. External examiner: Prof. A. Cohn (Leeds University). Internal examiner: Dr. D. Rydeheard.

  Programming skills

  In decreasing order of incompetence: C++, LISP, Java, Prolog.

  Awards and prizes

  • Sixty-Second Annual Meeting of the Association for Computational Linguistics (ACL 2024) Best Non-Publicized Paper Award.
  • Seventeenth Conference of the European Chapter of the Association for Compuational Linguistics (EACL 2023) Outstanding Paper Award).
  • Twenty-second International Joint Conference on Artificial Intelligence (IJCAI 2011) IJCAI-11 Distinguished Paper Award.

  Contact details

  Department of Computer Science
  Manchester University
  Manchester M13 9PL
  UK
  Tel +44 (0) 161 275 6223
  Fax +44 (0) 161 275 6236
  email: ipratt@cs.man.ac.uk
  

  

  ---

  What is the time?

  ---