Robin Hirsch

Orcid: 0000-0002-2983-4178

Affiliations:
  • University College London, Department of Computer Science, UK


According to our database1, Robin Hirsch authored at least 53 papers between 1994 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
First-order Axiomatisations of Representable Relation Algebras Need Formulas of Unbounded Quantifier depth.
J. Symb. Log., 2022

Seurat games on Stockmeyer graphs.
J. Graph Theory, 2022

The Algebra of Non-deterministic Programs: Demonic Operations, Orders and Axioms.
Log. J. IGPL, 2022

EXPTIME-hardness of higher-dimensional Minkowski spacetime.
Proceedings of the Advances in Modal Logic, AiML 2022, Rennes, France, 2022

2021
Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020
The algebra of non-deterministic programs: demonic operators, orders and axioms.
CoRR, 2020

Finite Representability of Semigroups with Demonic Refinement.
CoRR, 2020

2019
Algebraic foundations for qualitative calculi and networks.
Theor. Comput. Sci., 2019

2018
The Temporal Logic of two dimensional Minkowski Spacetime is Decidable.
J. Symb. Log., 2018

The Temporal Logic of Two-Dimensional Minkowski Spacetime with Slower-Than-Light Accessibility Is Decidable.
Proceedings of the Advances in Modal Logic 12, 2018

Decidability of Equational Theories for Subsignatures of Relation Algebra.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2018

2017
Disjoint-union partial algebras.
Log. Methods Comput. Sci., 2017

2016
There is no Finite-variable Equational Axiomatization of Representable Relation Algebras over Weakly Representable Relation Algebras.
Rev. Symb. Log., 2016

Algebraic foundations for qualitative calculi and networks.
CoRR, 2016

2015
Meet-completions and ordered domain algebras.
Log. J. IGPL, 2015

2014
The NEAT Embedding Problem for Algebras Other than cylindric Algebras and for Infinite Dimensions.
J. Symb. Log., 2014

The algebra of functions with antidomain and range.
CoRR, 2014

2013
Corrigendum to: "Relation algebra reducts of cylindric algebras and complete representations".
J. Symb. Log., 2013

Ordered domain algebras.
J. Appl. Log., 2013

2012
Undecidability of representability as binary relations.
J. Symb. Log., 2012

2011
Positive Fragments of Relevance Logic and Algebras of Binary Relations.
Rev. Symb. Log., 2011

Weak representations of relation algebras and relational bases.
J. Symb. Log., 2011

Axiomatizability of representable domain algebras.
J. Log. Algebraic Methods Program., 2011

2010
The Complexity of the Warranted Formula Problem in Propositional Argumentation.
J. Log. Comput., 2010

2009
Strongly representable atom structures of cylindric algebras.
J. Symb. Log., 2009

2008
Probabilistic Logic over Paths.
Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages, 2008

2007
Peirce Algebras and Boolean Modules.
J. Log. Comput., 2007

Relation algebra reducts of cylindric algebras and complete representations.
J. Symb. Log., 2007

Evolving Lucene search queries for text classification.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

A New Reduction from 3SAT to n-Partite Graphs.
Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2007

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

Evolving Text Classification Rules with Genetic Programming.
Appl. Artif. Intell., 2005

Evolving Rules for Document Classification.
Proceedings of the Genetic Programming, 8th European Conference, 2005

2004
The complexity of constraint satisfaction problems for small relation algebras.
Artif. Intell., 2004

Evolving Text Classifiers with Genetic Programming.
Proceedings of the Genetic Programming, 7th European Conference, 2004

2002
Relation Algebra Reducts of Cylindric Algebras and An Application to Proof Theory.
J. Symb. Log., 2002

On Modal Logics Between K x K x K and S5 x S5 x S5.
J. Symb. Log., 2002

Provability with finitely many variables.
Bull. Symb. Log., 2002

2001
Relation algebras form cylindric algebras, II.
Ann. Pure Appl. Log., 2001

Relation algebras form cylindric algebras, I.
Ann. Pure Appl. Log., 2001

2000
Relation Algebras with n-Dimensional Relational Bases.
Ann. Pure Appl. Log., 2000

Tractable approximations for temporal constraint handling.
Artif. Intell., 2000

1999
A Finite Relation Algebra with Undecidable Network Satisfaction Problem.
Log. J. IGPL, 1999

1998
Connections between cylindric algebras and relation algebras.
Proceedings of the Participants Copies for Relational Methods in Logic, 1998

1997
Expressive Power and Complexity in Algebraic Logic.
J. Log. Comput., 1997

Complete Representations in Algebraic Logic.
J. Symb. Log., 1997

Step by Step - Building Representations in Algebraic Logic.
J. Symb. Log., 1997

Axiomatising Various Classes of Relation and Cylindric Algebras.
Log. J. IGPL, 1997

The Finite Representable Relation Algebras are not Recursive (Abstract).
Proceedings of the Participants Copies of Third International Seminar on the Use of Relational Methods in Computer Science, 1997

1996
Relation Algebras of Intervals.
Artif. Intell., 1996

1995
Completely Representable Relation Algebras.
Log. J. IGPL, 1995

Intractability in the Allen and Koomen Planner.
Comput. Intell., 1995

1994
From points to intervals.
J. Appl. Non Class. Logics, 1994


  Loading...