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 like that sort of thing, here is a link to his Google Scholar page.

News and current affairs

• Currently none

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.

• Submitted papers
  • Emanuel Kieroński, Jakub Michaliszyn, Ian Pratt-Hartmann and Lidia Tendera: "Two-variable First-order Logic with Equivalence Closure". Copy of full paper available from author on request; for extended abstract, see Proceedings, 27th Annual IEEE Symposium on Logic in Computer Science (LICS '12), IEEE Press, 2012, pp. 431--440.
• Forthcoming work
  • Ian Pratt-Hartmann: The Relational Syllogistic Revisited, forthcoming in special issue of "Linguistic Issues in Language Technology".
  • Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann and Michael Zakharyaschev: Topological Logics with Connectedness over Euclidean Spaces, forthcoming in ACM Transactions of Computational Logic. (A preprint version may be found on the ArXiv preprint server.)
• Edited Works
  • Marco Aiello, Ian Pratt-Hartmann and Johan van Benthem: Handbook of Spatial Logics, Springer, 2007. 1058 p., Hardcover, ISBN: 978-1-4020-5586-7.
• Computational Logic
  • 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).
• Natural language and logic
  • 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
  • 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, Advanced Access, Journal of Logic and Computation. (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.
• Undergraduate textbooks
  • Ian Pratt: Artificial Intelligence, London: Macmillan, 1994. (pp. 280). ISBN 0333 597599. Click here for the preface.

PhD. Students

• Adam Trybus: An Axiom System for a Spatial Logic with Convexity. PhD. awarded December, 2011. External examiner: Dr. A. Galton (Exeter University).
• Yavor Nenov: Computability of Euclidean Logics. PhD. awarded December, 2011. External examiner: Prof. F. Wolter (University of Liverpool).
• 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: Dr. 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

Awards and prizes

• IJCAI-11 Distinguished Paper Award.

Contact details

• Joe Biden
• Annette Schavan
• Deszcz meteorytów