Homepage of Ian PrattHartmann (Ian Pratt)
Homepage of Dr Ian PrattHartmann
Ian PrattHartmann
studied mathematics and philosophy at Brasenose College, Oxford,
and philosophy at Princeton and
Stanford Universities, gaining his
PhD. from Princeton in 1987. He is currently Senior Lecturer in the
Department of Computer Science at the
University of Manchester.
Since February, 2014, Dr. PrattHartmann has held a joint appointment
in the
Institute of
Computer Science at the
University of Opole.
Dr. PrattHartmann'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
arXiv repository
Preliminary versions of many of Ian PrattHartnann's papers are posted
on the arXiv preprint server.
Select Bibliography
The following papers form a representative sample of Ian
PrattHartmann's work. Many conference papers are omitted: click
here for a (reasonably uptodate) full
bibliography. Note that some links
on this page are to preprint versions; please
check with the published versions when quoting.

Books

Submitted papers

Forthcoming work

Computational Logic

Bartosz Bednarczyk, Daumantas Kojelis and Ian PrattHartmann: ``On the
Limits of Decision: the Adjacent Fragment of FirstOrder Logic'',
in 50th International Conference on Automata, Languages
and Programming (ICALP 2023), pp. 111:121.

Ian PrattHartmann and Lidia
Tendera: ``Adding Transitivity and Counting to the Fluted Fragment'',
31st EACSL Annual Conference on Computer Science Logic (CSL 2023),
pp. 32:132:22,
Leibniz International Proceedings in Informatics (LIPIcs), 2023

Ian PrattHartmann and Lidia
Tendera: The
fluted fragment with transitive relations, Annals of Pure and Applied Logic 173, 2022, art. 103042,
pp. 143. (
authorfinal
version).
 Ian PrattHartmann:
Fluted Logic with Counting, 48th International Colloquium on
Automata, Languages and Programming (ICALP 2021), pp. 141:1141:17,
Leibniz International Proceedings in Informatics (LIPIcs), 2021

Ian PrattHartmann, Wiesław Szwast and Lidia Tendera:
The Fluted Fragment
Revisited, Journal of Symbolic Logic, vol 84(3), 2019,
pp. 10201048
(authorfinal version).
 Ian PrattHartmann and Lidia Tendera:
The
Fluted Fragment with Transitivity, Fortyfourth International
Symposium on Mathematical Foundations of Computer Science (MFCS 2019),
18:115 Leibniz International Proceedings in Mathematics, vol. 138.
 Ian PrattHartmann:
The Finite Satisfiability
Problem for TwoVariable, FirstOrder Logic with one Transitive
Relation is Decidable, Mathematical Logic Quarterly, 64(3),
2018, pp. 218248.
 Emanuel Kieroński, Ian PrattHartmann and Lidia Tendera:
Twovariable logics with counting and semantic constraints,
ACM SIGLOG News, Volume 5(3), 2018, pp. 2243 (Alternative source).
 Georgios Kourtis and Ian
PrattHartmann: Adding
PathFunctional Dependencies to the Guarded TwoVariable Fragment
with Counting, Logical Methods in Computer Science, Vol. 13
(4:4), 2017, pp. 139.

Emanuel Kieroński, Ian PrattHartmann and Lidia Tendera:
"Equivalence closure in the twovariable guarded
fragment", Journal of Logic and Computation, 27(4), 2017,
pp. 9991021.
 Ian PrattHartmann, Wiesław Szwast and Lidia Tendera: Quine's Fluted Fragment is
Nonelementary, in JeanMarc Talbot and Laurent Regnier (Eds.),
Proceedings,
25th EACSL Annual Conference on Computer Science Logic (CSL 2016),
LIPICS, pp. 39:139:21.

Ian PrattHartmann:
"The twovariable fragment with
counting and equivalence", Mathematical Logic Quarterly, 61(6),
2015, pp. 474515 (open access).
 Ian PrattHartmann
"Logics with counting and equivalence",
Proceedings of the Joint Meeting of the TwentyThird EACSL Annual
Conference on Computer Science Logic (CSL) and the TwentyNinth Annual
ACM/IEEE Symposium on Logic in Computer Science (LICS), Art. 76, 2014.
(Authorfinal version.)

Emanuel Kieroński, Jakub Michaliszyn, Ian PrattHartmann and Lidia Tendera:
"Twovariable Firstorder Logic with Equivalence Closure"
, SIAM Journal on Computing, 43(3), 2014, pp. 10121063.

Emanuel Kieroński, Jakub Michaliszyn, Ian PrattHartmann and Lidia Tendera:
"Twovariable Firstorder Logic with Equivalence Closure'', in Proceedings,
27th Annual IEEE Symposium on Logic in Computer
Science (LICS '12), IEEE Press, 2012, pp. 431440.
 Angelo Montanari, Ian PrattHartmann and Pietro Sala:
"Decidability of the Logics of the Reflexive Subinterval and
Superinterval Relations over Finite Linear Orders'', in N. Markey and
J. Wijsen (eds.): Temporal Representation and Reasoning (TIME 2010),
IEEE Press, 2010, pp. 2734
(authorfinal version).
 Ian PrattHartmann: "The TwoVariable Fragment with Counting
Revisited", in A. Dawar and R. de Queiroz (Eds.): WoLLIC 2010, LNAI 6188, pp. 4254, 2010
(authorfinal version).
 Yevgeny Kazakov and Ian PrattHartmann:
"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. 407416.
(Full version of the paper posted on
http://arxiv.org).
 Ian PrattHartmann
DataComplexity of the TwoVariable Fragment with Counting Quantifiers,
Information and Computation, 207(8), 2009, pp. 867888
(preprint version posted on
http://arxiv.org ).
 Ian PrattHartmann "On
the Computational Complexity of the Numerically Definite Syllogistic and
Related Logics'', Bulletin of Symbolic
Logic, 14(1), 2008, pp. 128 (preprint version posted on
http://arxiv.org).
 Ian PrattHartmann
"Complexity of the Guarded TwoVariable Fragment
with Counting Quantifiers'', Journal of Logic and Computation,
17(1), 2007, pp. 133155. (A preprint version may be found
on the ArXiv preprint server.)
 Ian PrattHartmann
"Complexity of the TwoVariable Fragment
with Counting Quantifiers'' ,
Journal of Logic, Language and Information, 14(3), 2005, pp. 369395
(authorfinal version).
Hans de Nivelle and Ian PrattHartmann:
"A resolutionbased decision
procedure of the twovariable fragment with equality''
in R. Gore, A. Leitsch and T. Nipkow (Eds.): IJCAR 2001, LNCS
2083, pp. 211255, 2001.

Natural language and logic
 Tharindu Madusanka, Riza Batista Navarro and Ian PrattHartmann:
"Identifying the limits of transformers when performing modelchecking
with natural language",
Proceedings of the 17th Conference of the European Chapter of the
Association for Compuational Linguistics (EACL), pp. 35393550,
2023
(recipient of
EACL
Outstanding Paper Award).

Viktor Schlegel, Kamen Pavlov and Ian PrattHartmann:
"Can
Transformers Reason in Fragments of Natural Language?",
Proceedsings of the 2022 Conference on Empirical Methods in Natural
Language Processing (EMNLP), pp. 1118411199, 2022 (also available
on arXiv).
 Ian PrattHartmann: "Semantic complexity in Natural Language",
in S. Lappin and Chris Fox (eds.)
The Handbook of Contemporary Semantic Theory, 2nd Edition, Wiley
Blackwell, 2015, pp. 429454.
(Authorfinalversion.)
 Ian PrattHartmann:
The
Relational Syllogistic Revisited,
Linguistic Issues in Language Technology, 9, 2014, pp. 195227.
(Authorfinalversion.)
 Ian PrattHartmann:
The
Syllogistic with Unity,
Journal of Philosophical Logic, 42(2),2013 , pp 391407
(authorfinal version).
 Ian PrattHartmann:
The Hamiltonian Syllogistic,
Journal of Logic, Language and Information, 20(4), 2011, pp. 445474
(preprint version posted on
on the ArXiv preprint server
).
 Ian PrattHartmann: Computational Complexity
in Natural Language, in A. Clark, C. Fox and S. Lappin (eds.)
The Handbook of Computational Linguistics and Natural Language
Processing, WileyBlackwell, 2010, pp. 4373,
(authorfinal version).
 Ian PrattHartmann and Lawrence S. Moss
Logics for the Relational Syllogistic, Review of Symbolic Logic, 2(4), 2009, pp. 647683
(preprint version posted on
http://arxiv.org ).
 Ian PrattHartmann
No syllogisms for the numerical syllogistic, in Grumberg et al. (Eds.): Languages: from Formal
to Natural, LNCS 5533, Springer, 2009, pp. 192203 (authorfinal version).
 Ian PrattHartmann and Allan Third
"More Fragments of Language: the Case of Ditransitive Verbs'',
Notre Dame Journal of Formal
Logic, 47(2), 2006, pp.151177
(authorfinal version).
 Ian PrattHartmann
"Temporal Prepositions and their Logic'' ,
Artificial Intelligence, 166(12), 2005, pp. 136
(authorfinal version).
 Ian PrattHartmann
"Fragments of Language'',
Journal of Logic, Language and Information, 13(2), 2004,
pp. 207223
(authorfinal version).
 Ian PrattHartmann
"A TwoVariable Fragment of English'',
Journal of Logic, Language and Information, 12(1), 2003, pp. 1345
(authorfinal version).
 Ian Pratt and Nissim Francez
"Temporal Prepositions and Temporal Generalized Quantifiers'',
Linguistics and Philosophy, 24(2), 2001, pp. 187222
(authorfinal version).

Spatial Logic
 Roman Kontchakov, Ian PrattHartmann, Michael
Zakharyaschev:
Spatial Reasoning with RCC8 and Connectedness
Constraints in Euclidean Spaces, Artificial Intelligence, 217,
2014, pp. 4375. (Authorfinal version.)

Roman Kontchakov, Yavor Nenov, Ian PrattHartmann 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 PrattHartmann: "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. 217235.
 Roman Kontchakov, Yavor Nenov, Ian PrattHartmann and Michael Zakharyaschev:
On the
Decidability of Connectedness Constraints in 2D and 3D
Euclidean Spaces, Proceedings of the Twentysecond International Joint
Conference on Artificial Intelligence (IJCAI 2011), AAAI Press,
2011, pp. 957962 (recipient of
IJCAI
Distinguished Paper Award).
(full version, with proofs).
 Yavor Nenov and Ian PrattHartmann:
"On the Computability of
RegionBased Spatial Logics'', in A. Dawar and H. Veith (eds.),
Computer Science Logic (CSL 2010), Lecture Notes in Computer
Science 6247, pp. 439453.
(Submitted version.)
 Roman Kontchakov, Ian PrattHartmann, Frank Wolter, Michael Zakharyaschev:
Spatial logics with
connectedness predicates, Logical Methods in Computer Science
Vol. 6 (3:7), 2010 (authorfinal version).
 R. Kontchakov, I. PrattHartmann 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. 534544
(authorfinal version).
 R. Kontchakov, I. PrattHartmann, 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. 574589,
2008. (Authorfinal version.)
 Marco Aiello, Ian PrattHartmann and Johan van Benthem:
"What is Spatial Logic?'' (author version), in
Aiello, PrattHartmann and van Benthem (eds.),
Handbook of Spatial Logics, Springer, 2007, pp. 111.
 Ian PrattHartmann
"FirstOrder Mereotopology'' (author version), in
in
Aiello, PrattHartmann and van Benthem (eds.),
Handbook of Spatial Logics, Springer, 2007, pp. 1397.
 Ian PrattHartmann:
"A Topological Constraint Language with Component Counting'',
Journal of Applied NonClassical Logics, 12(34), 2002,
pp. 441467
(authorfinal version).
 Ian PrattHartmann and Dominik Schoop:
"Elementary Polyhedral Mereotopology'',
Journal of Philosophical Logic, 31(5), 2002, pp. 469498
(authorfinal version).
 Ian PrattHartmann:
"Empiricism and Rationalism in Regionbased Theories of Space'',
Fundamenta Informaticae 46, 2001, pp. 159186.
(Compressed version
)
 Ian Pratt and Dominik Schoop:
"Expressivity in Polygonal, Plane
Mereotopology'', Journal of Symbolic Logic, 65(2), 2000,
pp. 822838.
 Ian Pratt:
"FirstOrder Qualitative Spatial Representation Languages with
Convexity'', Journal of Spatial
Cognition and Computation, 1(2), 1999, pp. 181204
(authorfinal 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. 621658
(authorfinal version).
 Ian Pratt and Oliver Lemon:
"Ontologies for plane polygonal
mereotopology'', Notre Dame Journal of Formal
Logic, 38(2) 1997, pp. 225245
(authorfinal 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. 249264.
 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. 366389.
 Ian Pratt:
"Constraints, Meaning and Information" Linguistics
and Philosophy 10, 1987, pp. 299324 (not available online).

Miscellaneous
 Ian PrattHartmann and Ivo Düntsch:
Functions definable by
numerical setexpressions,
Journal of Logic and Computation, 24(4), 2013, pp. 873895.
(authorfinal version).
 Ivo Düntsch and Ian PrattHartmann:
Complex Algebras of
Arithmetic, Fundamenta Informaticae, 97 (4), 2009, pp. 347367
(authorfinal version).
 Ian PrattHartmann and Ivo Düntsch:
Functions definable by arithmetic circuits, in
K. AmbosSpies, B. Löwe and W. Merkle (Eds.): Mathematical Theory
and Computational Practice: 5th Conference on Computability in Europe,
CiE 2009, LNCS 5635, 2009,
pp. 409418 (authorfinal version).
 Ian PrattHartmann:
Conditionalization and Total Knowledge.
Journal of Applied NonClassical Logics 18 (23), 2008, pp. 247266
(authorfinal version).
 Ian Pratt:
"Total Knowledge'', in Proceedings, AAAI, 2000, pp. 423428.
(Gzipped version)
 Ian Pratt:
"Shape Representation Using Fourier Coefficients of
the Sinusoidal Transform'', Journal of
Mathematical Imaging and Vision, 10, 1999, pp. 221235
(authorfinal version).
 Ian Pratt:
"An algorithm for planning `sensible' routes'',
Engineering Applications of Artificial Intelligence,
4(2), 1991, pp. 97108.
 Undergraduate textbooks
PhD. Students
 Yegor Guskov:
Decidability of Finite Satisfiability of TwoVariable FirstOrder
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:
PathFunctional Dependencies and the TwoVariable 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 RealTime 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 ModelTheoretic
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
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?