Ian Pratt-Hartmann

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 33

Top Topics

Semantic Constraints

Functional Dependencies

Natural Language

Top Venues

Publications

Ian Pratt-Hartmann
Walking on Words. CPM (2024)
Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
On the of Limits of Decision: the Adjacent Fragment of First-Order Logic (Extended Abstract). Description Logics (2024)
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 (2024)
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)
Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas
Towards Controllable Natural Language Inference through Lexical Inference Types. CoRR (2023)
Yingji Zhang, Marco Valentino, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas
Graph-Induced Syntactic-Semantic Spaces in Transformer-Based Variational AutoEncoders. CoRR (2023)
Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas
LlaMaVAE: Guiding Large Language Model Generation via Continuous Latent Sentence Spaces. CoRR (2023)
Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
On the of Limits of Decision: the Adjacent Fragment of First-Order Logic. CoRR (2023)
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)
Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas
Learning Disentangled Semantic Spaces of Explanations via Invertible Neural Networks. CoRR (2023)
Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
On the Limits of Decision: the Adjacent Fragment of First-Order Logic. ICALP (2023)
Ian Pratt-Hartmann, Lidia Tendera
Adding Transitivity and Counting to the Fluted Fragment. CSL (2023)
Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas
Quasi-symbolic explanatory NLI via disentanglement: A geometrical examination. CoRR (2022)
Viktor Schlegel, Kamen V. Pavlov, Ian Pratt-Hartmann
Can Transformers Reason in Fragments of Natural Language? CoRR (2022)
Viktor Schlegel, Kamen V. Pavlov, Ian Pratt-Hartmann
Can Transformers Reason in Fragments of Natural Language? EMNLP (2022)
Ian Pratt-Hartmann
Walking on Words. CoRR (2022)
Ian Pratt-Hartmann, Lidia Tendera
The fluted fragment with transitive relations. Ann. Pure Appl. Log. 173 (1) (2022)
Ian Pratt-Hartmann
Fluted Logic with Counting. ICALP (2021)
Marco Valentino, Ian Pratt-Hartmann, André Freitas
Do Natural Language Explanations Represent Valid Logical Arguments? Verifying Entailment in Explainable NLI Gold Standards. CoRR (2021)
Ian Pratt-Hartmann, Lidia Tendera
The Fluted Fragment with Transitive Relations. CoRR (2020)
Ian Pratt-Hartmann, Lidia Tendera
The Fluted Fragment with Transitivity. MFCS (2019)
Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera
The Fluted Fragment Revisited. J. Symb. Log. 84 (3) (2019)
Ian Pratt-Hartmann, Lidia Tendera
The Fluted Fragment with Transitivity. CoRR (2019)
Ian Pratt-Hartmann
Transitivity and Equivalence in Decidable Fragments of First-Order Logic: A Survey. ICLA (2019)
Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera
Two-variable logics with counting and semantic constraints. ACM SIGLOG News 5 (3) (2018)
Witold Charatonik, Yegor Guskov, Ian Pratt-Hartmann, Piotr Witkowski
Two-variable First-Order Logic with Counting in Forests. LPAR (2018)
Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera
Quine's Fluted Fragment Revisited. CoRR (2018)
Ian Pratt-Hartmann
Finite satisfiability for two-variable, first-order logic with one transitive relation is decidable. Math. Log. Q. 64 (3) (2018)
Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera
Equivalence closure in the two-variable guarded fragment. J. Log. Comput. 27 (4) (2017)
Ian Pratt-Hartmann
The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable. CoRR (2017)
Georgios Kourtis, Ian Pratt-Hartmann
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting. Log. Methods Comput. Sci. 13 (4) (2017)
Georgios Kourtis, Ian Pratt-Hartmann
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting. CoRR (2016)
Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera
Quine's Fluted Fragment is Non-Elementary. CSL (2016)
Ian Pratt-Hartmann
The two-variable fragment with counting and equivalence. Math. Log. Q. 61 (6) (2015)
Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera
Two-Variable First-Order Logic with Equivalence Closure. SIAM J. Comput. 43 (3) (2014)
Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakharyaschev
Spatial reasoning with RCC8 and connectedness constraints in Euclidean spaces. Artif. Intell. 217 (2014)
Ian Pratt-Hartmann
Logics with counting and equivalence. CSL-LICS (2014)
Ian Pratt-Hartmann
The Syllogistic with Unity. J. Philos. Log. 42 (2) (2013)
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev
Topological Logics with Connectedness over Euclidean Spaces. ACM Trans. Comput. Log. 14 (2) (2013)
Ian Pratt-Hartmann, Ivo Düntsch
Functions definable by numerical set-expressions. J. Log. Comput. 23 (4) (2013)
Ian Pratt-Hartmann
Report on BCTCS 2012. Bull. EATCS 107 (2012)
Nissim Francez, Ian Pratt-Hartmann
Editors' Preface. Stud Logica 100 (4) (2012)
Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera
Two-Variable First-Order Logic with Equivalence Closure. LICS (2012)
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev
Topological Logics with Connectedness over Euclidean Spaces CoRR (2011)
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces. IJCAI (2011)
Ian Pratt-Hartmann
The Hamiltonian Syllogistic. J. Log. Lang. Inf. 20 (4) (2011)
Ian Pratt-Hartmann
The Syllogistic with Unity CoRR (2011)
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces CoRR (2011)
Yavor Nenov, Ian Pratt-Hartmann
On the Computability of Region-Based Euclidean Logics. CSL (2010)
Ian Pratt-Hartmann
The Two-Variable Fragment with Counting Revisited. WoLLIC (2010)
Ian Pratt-Hartmann
The Hamiltonian Syllogistic CoRR (2010)
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)
Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakharyaschev
Interpreting Topological Logics over Euclidean Spaces. KR (2010)
Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev
Spatial logics with connectedness predicates Log. Methods Comput. Sci. 6 (3) (2010)
Ivo Düntsch, Ian Pratt-Hartmann
Complex Algebras of Arithmetic. Fundam. Informaticae 97 (4) (2009)
Ivo Düntsch, Ian Pratt-Hartmann
Complex Algebras of Arithmetic CoRR (2009)
Yevgeny Kazakov, Ian Pratt-Hartmann
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. LICS (2009)
Ian Pratt-Hartmann
Computational Complexity of Controlled Natural Languages. CNL (Pre-Proceedings) (2009)
Ian Pratt-Hartmann, Lawrence S. Moss
Logics for the Relational Syllogistic. Rev. Symb. Log. 2 (4) (2009)
Ian Pratt-Hartmann
No Syllogisms for the Numerical Syllogistic. Languages: From Formal to Natural (2009)
Ian Pratt-Hartmann
Data-complexity of the two-variable fragment with counting quantifiers. Inf. Comput. 207 (8) (2009)
Yevgeny Kazakov, Ian Pratt-Hartmann
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics CoRR (2009)
Ian Pratt-Hartmann, Ivo Düntsch
Functions Definable by Numerical Set-Expressions CoRR (2009)
Ian Pratt-Hartmann, Ivo Düntsch
Functions Definable by Arithmetic Circuits. CiE (2009)
Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev
Topology, connectedness, and modal logic. Advances in Modal Logic (2008)
Ian Pratt-Hartmann, Lawrence S. Moss
Logics for the Relational Syllogistic CoRR (2008)
Ian Pratt-Hartmann
Data-Complexity of the Two-Variable Fragment with Counting Quantifiers CoRR (2008)
Ian Pratt-Hartmann
On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics. Bull. Symb. Log. 14 (1) (2008)
Ian Pratt-Hartmann
Conditionalization and total knowledge. J. Appl. Non Class. Logics 18 (2-3) (2008)
Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev
On the Computational Complexity of Spatial Logics with Connectedness Constraints. LPAR (2008)
Ian Pratt-Hartmann
Complexity of the Guarded Two-variable Fragment with Counting Quantifiers. J. Log. Comput. 17 (1) (2007)
Ian Pratt-Hartmann
On the Complexity of the Numerically Definite Syllogistic and Related Fragments CoRR (2007)
Ian Pratt-Hartmann
Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers CoRR (2006)
Ian Pratt-Hartmann, Allan Third
More Fragments of Language. Notre Dame J. Formal Log. 47 (2) (2006)
Ian Pratt-Hartmann
Temporal prepositions and their logic. Artif. Intell. 166 (1-2) (2005)
Ian Pratt-Hartmann
Complexity of the Two-Variable Fragment with Counting Quantifiers. J. Log. Lang. Inf. 14 (3) (2005)
Ian Pratt-Hartmann
From TimeML to TPL. Annotating, Extracting and Reasoning about Time and Events (2005)
Ian Pratt-Hartmann
Temporal Prepositions and Their Logic. TIME (2004)
Ian Pratt-Hartmann
Fragments of Language. J. Log. Lang. Inf. 13 (2) (2004)
Ian Pratt-Hartmann
Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers CoRR (2004)
Ian Pratt-Hartmann
A Two-Variable Fragment of English. J. Log. Lang. Inf. 12 (1) (2003)
Ian Pratt-Hartmann, Dominik J. Schoop
Elementary Polyhedral Mereotopology. J. Philos. Log. 31 (5) (2002)
Ian Pratt-Hartmann
A Topological Constraint Language with Component Counting. J. Appl. Non Class. Logics 12 (3-4) (2002)
Ian Pratt-Hartmann
Empiricism and Rationalism in Region-based Theories of Space. Fundam. Informaticae 46 (1-2) (2001)
Hans de Nivelle, Ian Pratt-Hartmann
A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality. IJCAR (2001)
Ian Pratt-Hartmann
Total Knowledge. AAAI/IAAI (2000)