Follow
Ian Pratt-Hartmann
Ian Pratt-Hartmann
School of Computer Science, University of Manchester
Verified email at cs.man.ac.uk - Homepage
Title
Cited by
Cited by
Year
Handbook of spatial logics
M Aiello, I Pratt-Hartmann, J Van Benthem
Springer, 2007
3222007
Complexity of the two-variable fragment with counting quantifiers
I Pratt-Hartmann
Journal of Logic, Language, and Information, 369-395, 2005
1942005
Connexive modal logic
H Wansing, R Schmidt, I Pratt-Hartmann, M Reynolds
AiML-2004: Advances in Modal Logic, 387, 2004
962004
Logics for the relational syllogistic
I Pratt-Hartmann, LS Moss
The Review of Symbolic Logic 2 (4), 647-683, 2009
932009
Temporal prepositions and their logic
I Pratt-Hartmann
Artificial Intelligence 166 (1-2), 1-36, 2005
852005
Fragments of language
I Pratt-Hartmann
Journal of Logic, Language and Information 13, 207-223, 2004
672004
Two-variable first-order logic with equivalence closure
E Kieronski, J Michaliszyn, I Pratt-Hartmann, L Tendera
SIAM Journal on Computing 43 (3), 1012-1063, 2014
652014
What is spatial logic?
M Aiello, I Pratt-Hartmann, J Van Benthem
Handbook of spatial logics, 1-11, 2007
562007
First-order mereotopology
I Pratt-Hartmann
Handbook of spatial logics, 13-97, 2007
492007
More fragments of language
I Pratt-Hartmann, A Third
Notre Dame Journal of Formal Logic 47 (2), 151-177, 2006
482006
A two-variable fragment of English
I Pratt-Hartmann
Journal of Logic, Language and Information 12, 13-45, 2003
472003
Data-complexity of the two-variable fragment with counting quantifiers
I Pratt-Hartmann
Information and Computation 207 (8), 867-888, 2009
452009
Complexity of the guarded two-variable fragment with counting quantifiers
I Pratt-Hartmann
arXiv preprint cs/0601112, 2006
412006
On the computational complexity of the numerically definite syllogistic and related logics
I Pratt-Hartmann
Bulletin of Symbolic Logic 14 (1), 1-28, 2008
402008
Spatial logics with connectedness predicates
M Zakharyaschev, F Wolter, I Pratt-Hartmann, R Kontchakov
Logical Methods in Computer Science 6, 2010
392010
Computational complexity in natural language
I Pratt-Hartmann
The handbook of computational linguistics and natural language processing, 43, 2010
312010
Decidability of the logics of the reflexive sub-interval and super-interval relations over finite linear orders
A Montanari, I Pratt-Hartmann, P Sala
2010 17th International Symposium on Temporal Representation and Reasoning …, 2010
302010
A resolution-based decision procedure for the two-variable fragment with equality
H De Nivelle, I Pratt-Hartmann
Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena …, 2001
302001
A note on the complexity of the satisfiability problem for graded modal logics
Y Kazakov, I Pratt-Hartmann
2009 24th Annual IEEE Symposium on Logic In Computer Science, 407-416, 2009
292009
Interpreting Topological Logics over Euclidean Spaces.
R Kontchakov, I Pratt-Hartmann, M Zakharyaschev
KR, 2010
262010
The system can't perform the operation now. Try again later.
Articles 1–20