From points to intervals. - Robin Hirsch (J. Appl. Non Class. Logics, 1994)

Intractability in the Allen and Koomen Planner. - Robin Hirsch (Comput. Intell., 1995)

Completely Representable Relation Algebras. - Robin Hirsch (Log. J. IGPL, 1995)

Relation Algebras of Intervals. - Robin Hirsch (Artif. Intell., 1996)

The Finite Representable Relation Algebras are not Recursive (Abstract). - Robin Hirsch (RelMiCS, 1997)

Axiomatising Various Classes of Relation and Cylindric Algebras. - Robin Hirsch; Ian M. Hodkinson (Log. J. IGPL, 1997)

Step by Step - Building Representations in Algebraic Logic. - Robin Hirsch; Ian M. Hodkinson (J. Symb. Log., 1997)

Complete Representations in Algebraic Logic. - Robin Hirsch; Ian M. Hodkinson (J. Symb. Log., 1997)

Expressive Power and Complexity in Algebraic Logic. - Robin Hirsch (J. Log. Comput., 1997)

Connections between cylindric algebras and relation algebras. - Robin Hirsch; Ian M. Hodkinson (RelMiCS, 1998)

A Finite Relation Algebra with Undecidable Network Satisfaction Problem. - Robin Hirsch (Log. J. IGPL, 1999)

Tractable approximations for temporal constraint handling. - Robin Hirsch (Artif. Intell., 2000)

Relation Algebras with n-Dimensional Relational Bases. - Robin Hirsch; Ian M. Hodkinson (Ann. Pure Appl. Log., 2000)

Relation algebras form cylindric algebras, I. - Robin Hirsch; Ian M. Hodkinson (Ann. Pure Appl. Log., 2001)

Relation algebras form cylindric algebras, II. - Robin Hirsch; Ian M. Hodkinson (Ann. Pure Appl. Log., 2001)

Provability with finitely many variables. - Robin Hirsch; Ian M. Hodkinson; Roger D. Maddux (Bull. Symb. Log., 2002)

On Modal Logics Between K x K x K and S5 x S5 x S5. - Robin Hirsch; Ian M. Hodkinson; Ágnes Kurucz (J. Symb. Log., 2002)

Relation Algebra Reducts of Cylindric Algebras and An Application to Proof Theory. - Robin Hirsch; Ian M. Hodkinson; Roger D. Maddux (J. Symb. Log., 2002)

Evolving Text Classifiers with Genetic Programming. - Laurence Hirsch; Masoud Saeedi; Robin Hirsch (EuroGP, 2004)

The complexity of constraint satisfaction problems for small relation algebras. - Matteo Cristani; Robin Hirsch (Artif. Intell., 2004)

Evolving Rules for Document Classification. - Laurence Hirsch; Masoud Saeedi; Robin Hirsch (EuroGP, 2005)

Evolving Text Classification Rules with Genetic Programming. - Laurence Hirsch; Masoud Saeedi; Robin Hirsch (Appl. Artif. Intell., 2005)

The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable. - Robin Hirsch (Log. J. IGPL, 2005)

A New Reduction from 3SAT to n-Partite Graphs. - Daniel J. Hulme; Robin Hirsch; Bernard F. Buxton; R. Beau Lotto (FOCI, 2007)

Evolving Lucene search queries for text classification. - Laurence Hirsch; Robin Hirsch; Masoud Saeedi (GECCO, 2007)

Relation algebra reducts of cylindric algebras and complete representations. - Robin Hirsch (J. Symb. Log., 2007)

Peirce Algebras and Boolean Modules. - Robin Hirsch (J. Log. Comput., 2007)

Probabilistic Logic over Paths. - Evan Tzanis; Robin Hirsch (QAPL, 2008)

Strongly representable atom structures of cylindric algebras. - Robin Hirsch; Ian M. Hodkinson (J. Symb. Log., 2009)

The Complexity of the Warranted Formula Problem in Propositional Argumentation. - Robin Hirsch; Nikos Gorogiannis (J. Log. Comput., 2010)

Axiomatizability of representable domain algebras. - Robin Hirsch; Szabolcs Mikulás (J. Log. Algebraic Methods Program., 2011)

Weak representations of relation algebras and relational bases. - Robin Hirsch; Ian M. Hodkinson; Roger D. Maddux (J. Symb. Log., 2011)

Positive Fragments of Relevance Logic and Algebras of Binary Relations. - Robin Hirsch; Szabolcs Mikulás (Rev. Symb. Log., 2011)

Undecidability of representability as binary relations. - Robin Hirsch; Marcel Jackson (J. Symb. Log., 2012)

Ordered domain algebras. - Robin Hirsch; Szabolcs Mikulás (J. Appl. Log., 2013)

Corrigendum to: "Relation algebra reducts of cylindric algebras and complete representations". - Robin Hirsch (J. Symb. Log., 2013)

The algebra of functions with antidomain and range. - Robin Hirsch; Marcel Jackson; Szabolcs Mikulás (CoRR, 2014)

The NEAT Embedding Problem for Algebras Other than cylindric Algebras and for Infinite Dimensions. - Robin Hirsch; Tarek Sayed Ahmed (J. Symb. Log., 2014)

Meet-completions and ordered domain algebras. - Rob Egrot; Robin Hirsch (Log. J. IGPL, 2015)

Algebraic foundations for qualitative calculi and networks. - Robin Hirsch; Marcel Jackson; Tomasz Kowalski; Todd Niven (CoRR, 2016)

There is no Finite-variable Equational Axiomatization of Representable Relation Algebras over Weakly Representable Relation Algebras. - Jeremy F. Alm; Robin Hirsch; Roger D. Maddux (Rev. Symb. Log., 2016)

Disjoint-union partial algebras. - Robin Hirsch; Brett McLean (Log. Methods Comput. Sci., 2017)

Decidability of Equational Theories for Subsignatures of Relation Algebra. - Robin Hirsch (RAMiCS, 2018)

The Temporal Logic of Two-Dimensional Minkowski Spacetime with Slower-Than-Light Accessibility Is Decidable. - Robin Hirsch; Brett McLean (Advances in Modal Logic, 2018)

The Temporal Logic of two dimensional Minkowski Spacetime is Decidable. - Robin Hirsch; Mark Reynolds 001 (J. Symb. Log., 2018)

Algebraic foundations for qualitative calculi and networks. - Robin Hirsch; Marcel Jackson; Tomasz Kowalski (Theor. Comput. Sci., 2019)

Finite Representability of Semigroups with Demonic Refinement. - Robin Hirsch; Jas Semrl (CoRR, 2020)

The algebra of non-deterministic programs: demonic operators, orders and axioms. - Robin Hirsch; Szabolcs Mikulás; Tim Stokes 001 (CoRR, 2020)

Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition. - Robin Hirsch; Jas Semrl (LICS, 2021)

EXPTIME-hardness of higher-dimensional Minkowski spacetime. - Robin Hirsch; Brett McLean (AiML, 2022)

The Algebra of Non-deterministic Programs: Demonic Operations, Orders and Axioms. - Robin Hirsch; Szabolcs Mikulás; Timothy Stokes 001 (Log. J. IGPL, 2022)

Seurat games on Stockmeyer graphs. - Rob Egrot; Robin Hirsch (J. Graph Theory, 2022)

First-order Axiomatisations of Representable Relation Algebras Need Formulas of Unbounded Quantifier depth. - Rob Egrot; Robin Hirsch (J. Symb. Log., 2022)

Document clustering with evolved multiword search queries. - Laurence Hirsch; Robin Hirsch; Bayode Ogunleye (CoRR, 2025)