Ian Pratt-Hartmann
Ian Pratt-Hartmann
School of Computer Science, University of Manchester
Verifierad e-postadress på cs.man.ac.uk - Startsida
Titel
Citeras av
Citeras av
År
Handbook of spatial logics
M Aiello, I Pratt-Hartmann, J Van Benthem
Springer, 2007
2492007
Complexity of the two-variable fragment with counting quantifiers
I Pratt-Hartmann
Journal of Logic, Language, and Information, 369-395, 2005
1592005
Logics for the relational syllogistic
I Pratt-Hartmann, LS Moss
The Review of Symbolic Logic 2 (4), 647-683, 2009
782009
Temporal prepositions and their logic
I Pratt-Hartmann
Artificial Intelligence 166 (1-2), 1-36, 2005
772005
Fragments of language
I Pratt-Hartmann
Journal of Logic, Language and Information 13 (2), 207-223, 2004
622004
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
592014
A two-variable fragment of English
I Pratt-Hartmann
Journal of Logic, Language and Information 12 (1), 13-45, 2003
472003
More fragments of language
I Pratt-Hartmann, A Third
Notre Dame Journal of Formal Logic 47 (2), 151-177, 2006
442006
Data-complexity of the two-variable fragment with counting quantifiers
I Pratt-Hartmann
Information and Computation 207 (8), 867-888, 2009
412009
First-order mereotopology
I Pratt-Hartmann
Handbook of spatial logics, 13-97, 2007
402007
Spatial logics with connectedness predicates
R Kontchakov, I Pratt-Hartmann, F Wolter, M Zakharyaschev
arXiv preprint arXiv:1003.5399, 2010
342010
On the computational complexity of the numerically definite syllogistic and related logics
I Pratt-Hartmann
Bulletin of Symbolic Logic 14 (1), 1-28, 2008
332008
What is spatial logic?
M Aiello, I Pratt-Hartmann, J Van Benthem
Handbook of spatial logics, 1-11, 2007
322007
Complexity of the guarded two-variable fragment with counting quantifiers
I Pratt-Hartmann
arXiv preprint cs/0601112, 2006
322006
A resolution-based decision procedure for the two-variable fragment with equality
H De Nivelle, I Pratt-Hartmann
International Joint Conference on Automated Reasoning, 211-225, 2001
302001
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
292010
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
272009
Interpreting topological logics over Euclidean spaces
R Kontchakov, I Pratt-Hartmann, M Zakharyaschev
Twelfth International Conference on the Principles of Knowledge …, 2010
242010
Computational complexity in natural language
I Pratt-Hartmann
The handbook of computational linguistics and natural language processing 57, 2010
232010
The two-variable fragment with counting revisited
I Pratt-Hartmann
International Workshop on Logic, Language, Information, and Computation, 42-54, 2010
182010
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20