Ian Pratt-Hartmann

97 papers A* 8A 2B 9C 4Journal 60Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Natural Language Satisfiability: Exploring the Problem Distribution and Evaluating Transformer-based Language Models. CoRR Tharindu Madusanka, Ian Pratt-Hartmann, Riza Batista-Navarro
2025	J	`jnl`	The adjacent fragment and Quine's limits of decision. J. Log. Comput. Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
2025	—	`conf`	Unravelling the Logic: Investigating the Generalisation of Transformers in Numerical Satisfiability Problems. ACL (1) Tharindu Madusanka, Marco Valentino, Iqra Zahid, Ian Pratt-Hartmann, Riza Batista-Navarro
2024	—	`conf`	Graph-Induced Syntactic-Semantic Spaces in Transformer-Based Variational AutoEncoders. NAACL-HLT (Findings) Yingji Zhang, Marco Valentino, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas
2024	—	`conf`	Improving Semantic Control in Discrete Latent Spaces with Transformer Quantized Variational Autoencoders. EACL (Findings) Yingji Zhang, Danilo S. Carvalho, Marco Valentino, Ian Pratt-Hartmann, André Freitas
2024	J	`jnl`	Improving Semantic Control in Discrete Latent Spaces with Transformer Quantized Variational Autoencoders. CoRR Yingji Zhang, Danilo S. Carvalho, Marco Valentino, Ian Pratt-Hartmann, André Freitas
2024	—	`conf`	Natural Language Satisfiability: Exploring the Problem Distribution and Evaluating Transformer-based Language Models. ACL (1) Tharindu Madusanka, Ian Pratt-Hartmann, Riza Batista-Navarro
2024	—	`conf`	On the Limits of Decision: the Adjacent Fragment of First-Order Logic (Extended Abstract). Description Logics Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
2024	J	`jnl`	The Adjacent Fragment and Quine's Limits of Decision. CoRR Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
2024	B	`conf`	Walking on Words. CPM Ian Pratt-Hartmann
2023	B	`conf`	Adding Transitivity and Counting to the Fluted Fragment. CSL Ian Pratt-Hartmann, Lidia Tendera
2023	J	`jnl`	Graph-Induced Syntactic-Semantic Spaces in Transformer-Based Variational AutoEncoders. CoRR Yingji Zhang, Marco Valentino, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas
2023	A	`conf`	Identifying the limits of transformers when performing model-checking with natural language. EACL Tharindu Madusanka, Riza Theresa Batista-Navarro, Ian Pratt-Hartmann
2023	J	`jnl`	Learning Disentangled Semantic Spaces of Explanations via Invertible Neural Networks. CoRR Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas
2023	J	`jnl`	LlaMaVAE: Guiding Large Language Model Generation via Continuous Latent Sentence Spaces. CoRR Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas
2023	A*	`conf`	Not all quantifiers are equal: Probing Transformer-based language models' understanding of generalised quantifiers. EMNLP Tharindu Madusanka, Iqra Zahid, Hao Li, Ian Pratt-Hartmann, Riza Batista-Navarro
2023	A*	`conf`	On the Limits of Decision: the Adjacent Fragment of First-Order Logic. ICALP Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
2023	J	`jnl`	On the Limits of Decision: the Adjacent Fragment of First-Order Logic. CoRR Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
2023	J	`jnl`	Towards Controllable Natural Language Inference through Lexical Inference Types. CoRR Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas
2022	A*	`conf`	Can Transformers Reason in Fragments of Natural Language? EMNLP Viktor Schlegel, Kamen V. Pavlov, Ian Pratt-Hartmann
2022	J	`jnl`	Can Transformers Reason in Fragments of Natural Language? CoRR Viktor Schlegel, Kamen V. Pavlov, Ian Pratt-Hartmann
2022	J	`jnl`	Quasi-symbolic explanatory NLI via disentanglement: A geometrical examination. CoRR Yingji Zhang, Danilo S. Carvalho, Ian Pratt-Hartmann, André Freitas
2022	J	`jnl`	The fluted fragment with transitive relations. Ann. Pure Appl. Log. Ian Pratt-Hartmann, Lidia Tendera
2022	J	`jnl`	Walking on Words. CoRR Ian Pratt-Hartmann
2021	J	`jnl`	Do Natural Language Explanations Represent Valid Logical Arguments? Verifying Entailment in Explainable NLI Gold Standards. CoRR Marco Valentino, Ian Pratt-Hartmann, André Freitas
2021	A*	`conf`	Fluted Logic with Counting. ICALP Ian Pratt-Hartmann
2020	J	`jnl`	The Fluted Fragment with Transitive Relations. CoRR Ian Pratt-Hartmann, Lidia Tendera
2019	J	`jnl`	The Fluted Fragment Revisited. J. Symb. Log. Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera
2019	B	`conf`	The Fluted Fragment with Transitivity. MFCS Ian Pratt-Hartmann, Lidia Tendera
2019	J	`jnl`	The Fluted Fragment with Transitivity. CoRR Ian Pratt-Hartmann, Lidia Tendera
2019	—	`conf`	Transitivity and Equivalence in Decidable Fragments of First-Order Logic: A Survey. ICLA Ian Pratt-Hartmann
2018	J	`jnl`	Finite satisfiability for two-variable, first-order logic with one transitive relation is decidable. Math. Log. Q. Ian Pratt-Hartmann
2018	J	`jnl`	Quine's Fluted Fragment Revisited. CoRR Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera
2018	B	`conf`	Two-variable First-Order Logic with Counting in Forests. LPAR Witold Charatonik, Yegor Guskov, Ian Pratt-Hartmann, Piotr Witkowski
2018	J	`jnl`	Two-variable logics with counting and semantic constraints. ACM SIGLOG News Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera
2017	J	`jnl`	Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting. Log. Methods Comput. Sci. Georgios Kourtis, Ian Pratt-Hartmann
2017	J	`jnl`	Equivalence closure in the two-variable guarded fragment. J. Log. Comput. Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera
2017	J	`jnl`	The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable. CoRR Ian Pratt-Hartmann
2016	J	`jnl`	Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting. CoRR Georgios Kourtis, Ian Pratt-Hartmann
2016	B	`conf`	Quine's Fluted Fragment is Non-Elementary. CSL Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera
2015	J	`jnl`	The two-variable fragment with counting and equivalence. Math. Log. Q. Ian Pratt-Hartmann
2014	—	`conf`	Logics with counting and equivalence. CSL-LICS Ian Pratt-Hartmann
2014	J	`jnl`	Spatial reasoning with RCC8 and connectedness constraints in Euclidean spaces. Artif. Intell. Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakharyaschev
2014	J	`jnl`	Two-Variable First-Order Logic with Equivalence Closure. SIAM J. Comput. Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera
2013	J	`jnl`	Functions definable by numerical set-expressions. J. Log. Comput. Ian Pratt-Hartmann, Ivo Düntsch
2013	J	`jnl`	The Syllogistic with Unity. J. Philos. Log. Ian Pratt-Hartmann
2013	J	`jnl`	Topological Logics with Connectedness over Euclidean Spaces. ACM Trans. Comput. Log. Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev
2012	J	`jnl`	Editors' Preface. Stud Logica Nissim Francez, Ian Pratt-Hartmann
2012	J	`jnl`	Report on BCTCS 2012. Bull. EATCS Ian Pratt-Hartmann
2012	A*	`conf`	Two-Variable First-Order Logic with Equivalence Closure. LICS Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera
2011	J	`jnl`	On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces CoRR Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev
2011	A*	`conf`	On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces. IJCAI Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev
2011	J	`jnl`	The Hamiltonian Syllogistic. J. Log. Lang. Inf. Ian Pratt-Hartmann
2011	J	`jnl`	The Syllogistic with Unity CoRR Ian Pratt-Hartmann
2011	J	`jnl`	Topological Logics with Connectedness over Euclidean Spaces CoRR Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev
2010	C	`conf`	Decidability of the Logics of the Reflexive Sub-interval and Super-interval Relations over Finite Linear Orders. TIME Angelo Montanari, Ian Pratt-Hartmann, Pietro Sala
2010	A*	`conf`	Interpreting Topological Logics over Euclidean Spaces. KR Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakharyaschev
2010	B	`conf`	On the Computability of Region-Based Euclidean Logics. CSL Yavor Nenov, Ian Pratt-Hartmann
2010	J	`jnl`	Spatial logics with connectedness predicates Log. Methods Comput. Sci. Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev
2010	J	`jnl`	The Hamiltonian Syllogistic CoRR Ian Pratt-Hartmann
2010	C	`conf`	The Two-Variable Fragment with Counting Revisited. WoLLIC Ian Pratt-Hartmann
2009	J	`jnl`	A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics CoRR Yevgeny Kazakov, Ian Pratt-Hartmann
2009	A*	`conf`	A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. LICS Yevgeny Kazakov, Ian Pratt-Hartmann
2009	J	`jnl`	Complex Algebras of Arithmetic CoRR Ivo Düntsch, Ian Pratt-Hartmann
2009	J	`jnl`	Complex Algebras of Arithmetic. Fundam. Informaticae Ivo Düntsch, Ian Pratt-Hartmann
2009	—	`conf`	Computational Complexity of Controlled Natural Languages. CNL (Pre-Proceedings) Ian Pratt-Hartmann
2009	J	`jnl`	Data-complexity of the two-variable fragment with counting quantifiers. Inf. Comput. Ian Pratt-Hartmann
2009	C	`conf`	Functions Definable by Arithmetic Circuits. CiE Ian Pratt-Hartmann, Ivo Düntsch
2009	J	`jnl`	Functions Definable by Numerical Set-Expressions CoRR Ian Pratt-Hartmann, Ivo Düntsch
2009	J	`jnl`	Logics for the Relational Syllogistic. Rev. Symb. Log. Ian Pratt-Hartmann, Lawrence S. Moss
2009	—	`conf`	No Syllogisms for the Numerical Syllogistic. Languages: From Formal to Natural Ian Pratt-Hartmann
2008	J	`jnl`	Conditionalization and total knowledge. J. Appl. Non Class. Logics Ian Pratt-Hartmann
2008	J	`jnl`	Data-Complexity of the Two-Variable Fragment with Counting Quantifiers CoRR Ian Pratt-Hartmann
2008	J	`jnl`	Logics for the Relational Syllogistic CoRR Ian Pratt-Hartmann, Lawrence S. Moss
2008	B	`conf`	On the Computational Complexity of Spatial Logics with Connectedness Constraints. LPAR Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev
2008	J	`jnl`	On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics. Bull. Symb. Log. Ian Pratt-Hartmann
2008	B	`conf`	Topology, connectedness, and modal logic. Advances in Modal Logic Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev
2007	J	`jnl`	Complexity of the Guarded Two-variable Fragment with Counting Quantifiers. J. Log. Comput. Ian Pratt-Hartmann
2007	—	`ch.`	First-Order Mereotopology. Handbook of Spatial Logics Ian Pratt-Hartmann
2007	—	`book`	Handbook of Spatial Logics Marco Aiello, Ian Pratt-Hartmann, Johan van Benthem
2007	J	`jnl`	On the Complexity of the Numerically Definite Syllogistic and Related Fragments CoRR Ian Pratt-Hartmann
2007	—	`ch.`	What is Spatial Logic? Handbook of Spatial Logics Marco Aiello, Ian Pratt-Hartmann, Johan van Benthem
2006	J	`jnl`	Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers CoRR Ian Pratt-Hartmann
2006	J	`jnl`	More Fragments of Language. Notre Dame J. Formal Log. Ian Pratt-Hartmann, Allan Third
2005	B	`ed.`	Advances in Modal Logic 5, papers from the fifth conference on "Advances in Modal logic," held in Manchester, UK, 9-11 September 2004 Advances in Modal Logic Renate A. Schmidt, Ian Pratt-Hartmann, Mark Reynolds, Heinrich Wansing
2005	J	`jnl`	Complexity of the Two-Variable Fragment with Counting Quantifiers. J. Log. Lang. Inf. Ian Pratt-Hartmann
2005	—	`conf`	From TimeML to TPL. Annotating, Extracting and Reasoning about Time and Events Ian Pratt-Hartmann
2005	J	`jnl`	Temporal prepositions and their logic. Artif. Intell. Ian Pratt-Hartmann
2004	J	`jnl`	Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers CoRR Ian Pratt-Hartmann
2004	J	`jnl`	Fragments of Language. J. Log. Lang. Inf. Ian Pratt-Hartmann
2004	C	`conf`	Temporal Prepositions and Their Logic. TIME Ian Pratt-Hartmann
2003	J	`jnl`	A Two-Variable Fragment of English. J. Log. Lang. Inf. Ian Pratt-Hartmann
2002	J	`jnl`	A Topological Constraint Language with Component Counting. J. Appl. Non Class. Logics Ian Pratt-Hartmann
2002	J	`jnl`	Elementary Polyhedral Mereotopology. J. Philos. Log. Ian Pratt-Hartmann, Dominik J. Schoop
2001	A	`conf`	A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality. IJCAR Hans de Nivelle, Ian Pratt-Hartmann
2001	J	`jnl`	Empiricism and Rationalism in Region-based Theories of Space. Fundam. Informaticae Ian Pratt-Hartmann
2000	—	`conf`	Total Knowledge. AAAI/IAAI Ian Pratt-Hartmann