default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIan Pratt-Hartmann
Ian E. Pratt – Ian Pratt 0002
Person information
- affiliation: University of Manchester, UK
Other persons with the same name
- Ian Pratt 0001 (aka: Ian A. Pratt) — University of Cambridge, UK
- Ian Pratt 0003 — ZigZagee Ltd., Loughborough, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c34]Tharindu Madusanka, Ian Pratt-Hartmann, Riza Batista-Navarro:
Natural Language Satisfiability: Exploring the Problem Distribution and Evaluating Transformer-based Language Models. ACL (1) 2024: 15278-15294- [c33]Ian Pratt-Hartmann:
Walking on Words. CPM 2024: 25:1-25:17 - [c32]Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann:
On the Limits of Decision: the Adjacent Fragment of First-Order Logic (Extended Abstract). Description Logics 2024 - [c31]Yingji Zhang, Danilo S. Carvalho, Marco Valentino, Ian Pratt-Hartmann, André Freitas:
Improving Semantic Control in Discrete Latent Spaces with Transformer Quantized Variational Autoencoders. EACL (Findings) 2024: 1434-1450 - [c30]Yingji Zhang, Marco Valentino, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas:
Graph-Induced Syntactic-Semantic Spaces in Transformer-Based Variational AutoEncoders. NAACL-HLT (Findings) 2024: 474-489 - [i29]Yingji Zhang, Danilo S. Carvalho, Marco Valentino, Ian Pratt-Hartmann, André Freitas:
Improving Semantic Control in Discrete Latent Spaces with Transformer Quantized Variational Autoencoders. CoRR abs/2402.00723 (2024) - [i28]Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann:
The Adjacent Fragment and Quine's Limits of Decision. CoRR abs/2409.01231 (2024) - 2023
- [c29]Ian Pratt-Hartmann
, Lidia Tendera:
Adding Transitivity and Counting to the Fluted Fragment. CSL 2023: 32:1-32:22 - [c28]Tharindu Madusanka, Riza Theresa Batista-Navarro, Ian Pratt-Hartmann:
Identifying the limits of transformers when performing model-checking with natural language. EACL 2023: 3521-3532 - [c27]Tharindu Madusanka, Iqra Zahid, Hao Li, Ian Pratt-Hartmann, Riza Batista-Navarro:
Not all quantifiers are equal: Probing Transformer-based language models' understanding of generalised quantifiers. EMNLP 2023: 8680-8692 - [c26]Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann:
On the Limits of Decision: the Adjacent Fragment of First-Order Logic. ICALP 2023: 111:1-111:21 - [i27]Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas:
Learning Disentangled Semantic Spaces of Explanations via Invertible Neural Networks. CoRR abs/2305.01713 (2023) - [i26]Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann:
On the Limits of Decision: the Adjacent Fragment of First-Order Logic. CoRR abs/2305.03133 (2023) - [i25]Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas:
Towards Controllable Natural Language Inference through Lexical Inference Types. CoRR abs/2308.03581 (2023) - [i24]Yingji Zhang, Marco Valentino, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas:
Graph-Induced Syntactic-Semantic Spaces in Transformer-Based Variational AutoEncoders. CoRR abs/2311.08579 (2023) - [i23]Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas:
LlaMaVAE: Guiding Large Language Model Generation via Continuous Latent Sentence Spaces. CoRR abs/2312.13208 (2023) - 2022
- [j38]Ian Pratt-Hartmann, Lidia Tendera:
The fluted fragment with transitive relations. Ann. Pure Appl. Log. 173(1): 103042 (2022) - [c25]Viktor Schlegel, Kamen V. Pavlov, Ian Pratt-Hartmann:
Can Transformers Reason in Fragments of Natural Language? EMNLP 2022: 11184-11199 - [i22]Ian Pratt-Hartmann:
Walking on Words. CoRR abs/2208.08913 (2022) - [i21]Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas:
Quasi-symbolic explanatory NLI via disentanglement: A geometrical examination. CoRR abs/2210.06230 (2022) - [i20]Viktor Schlegel, Kamen V. Pavlov, Ian Pratt-Hartmann:
Can Transformers Reason in Fragments of Natural Language? CoRR abs/2211.05417 (2022) - 2021
- [c24]Ian Pratt-Hartmann:
Fluted Logic with Counting. ICALP 2021: 141:1-141:17 - [i19]Marco Valentino, Ian Pratt-Hartmann, André Freitas:
Do Natural Language Explanations Represent Valid Logical Arguments? Verifying Entailment in Explainable NLI Gold Standards. CoRR abs/2105.01974 (2021) - 2020
- [i18]Ian Pratt-Hartmann, Lidia Tendera:
The Fluted Fragment with Transitive Relations. CoRR abs/2006.11169 (2020)
2010 – 2019
- 2019
- [j37]Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera:
The Fluted Fragment Revisited. J. Symb. Log. 84(3): 1020-1048 (2019) - [c23]Ian Pratt-Hartmann:
Transitivity and Equivalence in Decidable Fragments of First-Order Logic: A Survey. ICLA 2019: 103-107 - [c22]Ian Pratt-Hartmann, Lidia Tendera:
The Fluted Fragment with Transitivity. MFCS 2019: 18:1-18:15 - [i17]Ian Pratt-Hartmann, Lidia Tendera:
The Fluted Fragment with Transitivity. CoRR abs/1906.09131 (2019) - 2018
- [j36]Ian Pratt-Hartmann:
Finite satisfiability for two-variable, first-order logic with one transitive relation is decidable. Math. Log. Q. 64(3): 218-248 (2018) - [j35]Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera:
Two-variable logics with counting and semantic constraints. ACM SIGLOG News 5(3): 22-43 (2018) - [c21]Witold Charatonik, Yegor Guskov, Ian Pratt-Hartmann, Piotr Witkowski:
Two-variable First-Order Logic with Counting in Forests. LPAR 2018: 214-232 - [i16]Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera:
Quine's Fluted Fragment Revisited. CoRR abs/1812.06440 (2018) - 2017
- [j34]Georgios Kourtis, Ian Pratt-Hartmann:
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting. Log. Methods Comput. Sci. 13(4) (2017) - [j33]Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera:
Equivalence closure in the two-variable guarded fragment. J. Log. Comput. 27(4): 999-1021 (2017) - [i15]Ian Pratt-Hartmann:
The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable. CoRR abs/1707.05558 (2017) - 2016
- [c20]Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera:
Quine's Fluted Fragment is Non-Elementary. CSL 2016: 39:1-39:21 - [i14]Georgios Kourtis, Ian Pratt-Hartmann:
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting. CoRR abs/1611.08738 (2016) - 2015
- [j32]Ian Pratt-Hartmann:
The two-variable fragment with counting and equivalence. Math. Log. Q. 61(6): 474-515 (2015) - 2014
- [j31]Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakharyaschev:
Spatial reasoning with RCC8 and connectedness constraints in Euclidean spaces. Artif. Intell. 217: 43-75 (2014) - [j30]Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera:
Two-Variable First-Order Logic with Equivalence Closure. SIAM J. Comput. 43(3): 1012-1063 (2014) - [c19]Ian Pratt-Hartmann:
Logics with counting and equivalence. CSL-LICS 2014: 76:1-76:10 - 2013
- [j29]Ian Pratt-Hartmann:
The Syllogistic with Unity. J. Philos. Log. 42(2): 391-407 (2013) - [j28]Ian Pratt-Hartmann, Ivo Düntsch:
Functions definable by numerical set-expressions. J. Log. Comput. 23(4): 873-895 (2013) - [j27]Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev:
Topological Logics with Connectedness over Euclidean Spaces. ACM Trans. Comput. Log. 14(2): 13:1-13:48 (2013) - 2012
- [j26]Ian Pratt-Hartmann:
Report on BCTCS 2012. Bull. EATCS 107: 146-165 (2012) - [j25]Nissim Francez, Ian Pratt-Hartmann:
Editors' Preface. Stud Logica 100(4): 663-665 (2012) - [c18]Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera:
Two-Variable First-Order Logic with Equivalence Closure. LICS 2012: 431-440 - 2011
- [j24]Ian Pratt-Hartmann:
The Hamiltonian Syllogistic. J. Log. Lang. Inf. 20(4): 445-474 (2011) - [c17]Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev:
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces. IJCAI 2011: 957-962 - [i13]Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev:
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces. CoRR abs/1104.0219 (2011) - [i12]Ian Pratt-Hartmann:
The Syllogistic with Unity. CoRR abs/1110.2317 (2011) - [i11]Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev:
Topological Logics with Connectedness over Euclidean Spaces. CoRR abs/1110.4034 (2011) - 2010
- [j23]Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev:
Spatial logics with connectedness predicates. Log. Methods Comput. Sci. 6(3) (2010) - [c16]Yavor Nenov, Ian Pratt-Hartmann:
On the Computability of Region-Based Euclidean Logics. CSL 2010: 439-453 - [c15]Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakharyaschev:
Interpreting Topological Logics over Euclidean Spaces. KR 2010 - [c14]Angelo Montanari, Ian Pratt-Hartmann, Pietro Sala:
Decidability of the Logics of the Reflexive Sub-interval and Super-interval Relations over Finite Linear Orders. TIME 2010: 27-34 - [c13]Ian Pratt-Hartmann:
The Two-Variable Fragment with Counting Revisited. WoLLIC 2010: 42-54 - [i10]Ian Pratt-Hartmann:
The Hamiltonian Syllogistic. CoRR abs/1011.2973 (2010)
2000 – 2009
- 2009
- [j22]Ivo Düntsch, Ian Pratt-Hartmann:
Complex Algebras of Arithmetic. Fundam. Informaticae 97(4): 347-367 (2009) - [j21]Ian Pratt-Hartmann:
Data-complexity of the two-variable fragment with counting quantifiers. Inf. Comput. 207(8): 867-888 (2009) - [j20]Ian Pratt-Hartmann, Lawrence S. Moss:
Logics for the Relational Syllogistic. Rev. Symb. Log. 2(4): 647-683 (2009) - [c12]Ian Pratt-Hartmann:
No Syllogisms for the Numerical Syllogistic. Languages: From Formal to Natural 2009: 192-203 - [c11]Ian Pratt-Hartmann, Ivo Düntsch:
Functions Definable by Arithmetic Circuits. CiE 2009: 409-418 - [c10]Ian Pratt-Hartmann:
Computational Complexity of Controlled Natural Languages. CNL (Pre-Proceedings) 2009 - [c9]Yevgeny Kazakov, Ian Pratt-Hartmann:
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. LICS 2009: 407-416 - [i9]Yevgeny Kazakov, Ian Pratt-Hartmann:
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. CoRR abs/0905.3108 (2009) - [i8]Ian Pratt-Hartmann, Ivo Düntsch:
Functions Definable by Numerical Set-Expressions. CoRR abs/0911.0105 (2009) - [i7]Ivo Düntsch, Ian Pratt-Hartmann:
Complex Algebras of Arithmetic. CoRR abs/0911.5246 (2009) - 2008
- [j19]Ian Pratt-Hartmann:
On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics. Bull. Symb. Log. 14(1): 1-28 (2008) - [j18]Ian Pratt-Hartmann:
Conditionalization and total knowledge. J. Appl. Non Class. Logics 18(2-3): 247-266 (2008) - [c8]Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev:
Topology, connectedness, and modal logic. Advances in Modal Logic 2008: 151-176 - [c7]Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev:
On the Computational Complexity of Spatial Logics with Connectedness Constraints. LPAR 2008: 574-589 - [i6]Ian Pratt-Hartmann:
Data-Complexity of the Two-Variable Fragment with Counting Quantifiers. CoRR abs/0806.1636 (2008) - [i5]Ian Pratt-Hartmann, Lawrence S. Moss:
Logics for the Relational Syllogistic. CoRR abs/0808.0521 (2008) - 2007
- [j17]Ian Pratt-Hartmann:
Complexity of the Guarded Two-variable Fragment with Counting Quantifiers. J. Log. Comput. 17(1): 133-155 (2007) - [p2]Marco Aiello, Ian Pratt-Hartmann, Johan van Benthem:
What is Spatial Logic? Handbook of Spatial Logics 2007: 1-11 - [p1]Ian Pratt-Hartmann:
First-Order Mereotopology. Handbook of Spatial Logics 2007: 13-97 - [e2]Marco Aiello, Ian Pratt-Hartmann, Johan van Benthem:
Handbook of Spatial Logics. Springer 2007, ISBN 978-1-4020-5586-7 [contents] - [i4]Ian Pratt-Hartmann:
On the Complexity of the Numerically Definite Syllogistic and Related Fragments. CoRR abs/cs/0701039 (2007) - 2006
- [j16]Ian Pratt-Hartmann, Allan Third:
More Fragments of Language. Notre Dame J. Formal Log. 47(2): 151-177 (2006) - [i3]Ian Pratt-Hartmann:
Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers. CoRR abs/cs/0601112 (2006) - 2005
- [j15]Ian Pratt-Hartmann:
Temporal prepositions and their logic. Artif. Intell. 166(1-2): 1-36 (2005) - [j14]Ian Pratt-Hartmann:
Complexity of the Two-Variable Fragment with Counting Quantifiers. J. Log. Lang. Inf. 14(3): 369-395 (2005) - [e1]Renate A. Schmidt, Ian Pratt-Hartmann, Mark Reynolds, Heinrich Wansing:
Advances in Modal Logic 5, papers from the fifth conference on "Advances in Modal logic," held in Manchester, UK, 9-11 September 2004. King's College Publications 2005, ISBN 1-904987-22-2 [contents] - [i2]Ian Pratt-Hartmann:
From TimeML to TPL. Annotating, Extracting and Reasoning about Time and Events 2005 - 2004
- [j13]Ian Pratt-Hartmann:
Fragments of Language. J. Log. Lang. Inf. 13(2): 207-223 (2004) - [c6]Ian Pratt-Hartmann:
Temporal Prepositions and Their Logic. TIME 2004: 7-8 - [i1]Ian Pratt-Hartmann:
Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers. CoRR cs.LO/0411031 (2004) - 2003
- [j12]Ian Pratt-Hartmann:
A Two-Variable Fragment of English. J. Log. Lang. Inf. 12(1): 13-45 (2003) - 2002
- [j11]Ian Pratt-Hartmann:
A Topological Constraint Language with Component Counting. J. Appl. Non Class. Logics 12(3-4): 441-468 (2002) - [j10]Ian Pratt-Hartmann, Dominik J. Schoop:
Elementary Polyhedral Mereotopology. J. Philos. Log. 31(5): 469-498 (2002) - 2001
- [j9]Ian Pratt-Hartmann:
Empiricism and Rationalism in Region-based Theories of Space. Fundam. Informaticae 46(1-2): 159-186 (2001) - [c5]Hans de Nivelle, Ian Pratt-Hartmann:
A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality. IJCAR 2001: 211-225 - 2000
- [j8]Ian E. Pratt, Dominik J. Schoop:
Expressivity in Polygonal, Plane Mereotopology. J. Symb. Log. 65(2): 822-838 (2000) - [c4]Ian Pratt-Hartmann:
Total Knowledge. AAAI/IAAI 2000: 423-428
1990 – 1999
- 1999
- [j7]Oliver Lemon, Ian E. Pratt:
Logics for geographic information. J. Geogr. Syst. 1(1): 75-90 (1999) - [j6]Ian Pratt:
Shape Representation Using Fourier Coefficients of the Sinusoidal Transform. J. Math. Imaging Vis. 10(3): 221-235 (1999) - [j5]Ian Pratt:
First-order qualitative spatial representation languages with convexity. Spatial Cogn. Comput. 1(2): 181-204 (1999) - 1998
- [j4]Ian E. Pratt, Dominik J. Schoop:
A Complete Axiom System for Polygonal Mereotopology of the Real Plane. J. Philos. Log. 27(6): 621-658 (1998) - [j3]Oliver Lemon, Ian E. Pratt:
On the Insufficiency of Linear Diagrams for Syllogisms. Notre Dame J. Formal Log. 39(4): 573-580 (1998) - [j2]Oliver Lemon, Ian E. Pratt:
Complete Logics for QSR: A Guide to Plane Meretopology. J. Vis. Lang. Comput. 9(1): 5-21 (1998) - 1997
- [j1]Ian E. Pratt, Oliver Lemon:
Ontologies for Plane, Polygonal Mereotopology. Notre Dame J. Formal Log. 38(2): 225-245 (1997) - 1996
- [c3]Oliver Lemon, Ian Pratt:
On the Incompleteness of Modal Logics of Space: Advancing Complete Modal Logics of Place. Advances in Modal Logic 1996: 115-132 - 1994
- [c2]Ian E. Pratt, David S. Brée:
The Expressive Power of the English Temporal Preposition System. TIME 1994: 153-160 - 1993
- [c1]Ian E. Pratt:
Map Semantics. COSIT 1993: 77-91
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 01:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
