default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobin Hirsch
Person information
- affiliation: University College London, Department of Computer Science, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j38]Robin Hirsch, Szabolcs Mikulás, Timothy Stokes:
The Algebra of Non-deterministic Programs: Demonic Operations, Orders and Axioms. Log. J. IGPL 30(5): 886-906 (2022)- [j37]Rob Egrot
, Robin Hirsch:
Seurat games on Stockmeyer graphs. J. Graph Theory 99(2): 278-311 (2022) - [j36]Rob Egrot, Robin Hirsch:
First-order Axiomatisations of Representable Relation Algebras Need Formulas of Unbounded Quantifier depth. J. Symb. Log. 87(3): 1283-1300 (2022) - [c11]Robin Hirsch, Brett McLean:
EXPTIME-hardness of higher-dimensional Minkowski spacetime. AiML 2022: 491-505 - [i8]Robin Hirsch, Brett McLean:
EXPTIME-hardness of higher-dimensional Minkowski spacetime. CoRR abs/2206.06866 (2022) - 2021
- [c10]Robin Hirsch, Jas Semrl:
Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition. LICS 2021: 1-10 - [i7]Robin Hirsch, Jas Semrl:
Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition. CoRR abs/2105.06787 (2021) - 2020
- [i6]Robin Hirsch, Jas Semrl:
Finite Representability of Semigroups with Demonic Refinement. CoRR abs/2009.06970 (2020) - [i5]Robin Hirsch, Szabolcs Mikulás, Tim Stokes:
The algebra of non-deterministic programs: demonic operators, orders and axioms. CoRR abs/2009.12081 (2020)
2010 – 2019
- 2019
- [j35]Robin Hirsch, Marcel Jackson, Tomasz Kowalski:
Algebraic foundations for qualitative calculi and networks. Theor. Comput. Sci. 768: 99-116 (2019) - 2018
- [j34]Robin Hirsch, Mark Reynolds:
The Temporal Logic of two dimensional Minkowski Spacetime is Decidable. J. Symb. Log. 83(3): 829-867 (2018) - [c9]Robin Hirsch:
Decidability of Equational Theories for Subsignatures of Relation Algebra. RAMiCS 2018: 87-96 - [c8]Robin Hirsch, Brett McLean:
The Temporal Logic of Two-Dimensional Minkowski Spacetime with Slower-Than-Light Accessibility Is Decidable. Advances in Modal Logic 2018: 347-366 - [i4]Robin Hirsch, Brett McLean:
The temporal logic of two-dimensional Minkowski spacetime with slower-than-light accessibility is decidable. CoRR abs/1806.09760 (2018) - 2017
- [j33]Robin Hirsch, Brett McLean:
Disjoint-union partial algebras. Log. Methods Comput. Sci. 13(2) (2017) - 2016
- [j32]Jeremy F. Alm, Robin Hirsch, Roger D. Maddux:
There is no Finite-variable Equational Axiomatization of Representable Relation Algebras over Weakly Representable Relation Algebras. Rev. Symb. Log. 9(3): 511-521 (2016) - [i3]Robin Hirsch, Marcel Jackson, Tomasz Kowalski, Todd Niven:
Algebraic foundations for qualitative calculi and networks. CoRR abs/1606.09140 (2016) - [i2]Robin Hirsch, Brett McLean:
Disjoint-union partial algebras. CoRR abs/1612.00252 (2016) - 2015
- [j31]Rob Egrot, Robin Hirsch:
Meet-completions and ordered domain algebras. Log. J. IGPL 23(4): 584-600 (2015) - 2014
- [j30]Robin Hirsch, Tarek Sayed Ahmed:
The NEAT Embedding Problem for Algebras Other than cylindric Algebras and for Infinite Dimensions. J. Symb. Log. 79(1): 208-222 (2014) - [i1]Robin Hirsch, Marcel Jackson, Szabolcs Mikulás:
The algebra of functions with antidomain and range. CoRR abs/1410.3981 (2014) - 2013
- [j29]Robin Hirsch, Szabolcs Mikulás:
Ordered domain algebras. J. Appl. Log. 11(3): 266-271 (2013) - [j28]Robin Hirsch:
Corrigendum to: "Relation algebra reducts of cylindric algebras and complete representations". J. Symb. Log. 78(4): 1345-1346 (2013) - 2012
- [j27]Robin Hirsch, Marcel Jackson:
Undecidability of representability as binary relations. J. Symb. Log. 77(4): 1211-1244 (2012) - 2011
- [j26]Robin Hirsch, Szabolcs Mikulás:
Axiomatizability of representable domain algebras. J. Log. Algebraic Methods Program. 80(2): 75-91 (2011) - [j25]Robin Hirsch, Ian M. Hodkinson, Roger D. Maddux:
Weak representations of relation algebras and relational bases. J. Symb. Log. 76(3): 870-882 (2011) - [j24]Robin Hirsch, Szabolcs Mikulás:
Positive Fragments of Relevance Logic and Algebras of Binary Relations. Rev. Symb. Log. 4(1): 81-105 (2011) - 2010
- [j23]Robin Hirsch, Nikos Gorogiannis:
The Complexity of the Warranted Formula Problem in Propositional Argumentation. J. Log. Comput. 20(2): 481-499 (2010)
2000 – 2009
- 2009
- [j22]Robin Hirsch, Ian M. Hodkinson:
Strongly representable atom structures of cylindric algebras. J. Symb. Log. 74(3): 811-828 (2009) - 2008
- [c7]Evan Tzanis, Robin Hirsch:
Probabilistic Logic over Paths. QAPL 2008: 79-96 - 2007
- [j21]Robin Hirsch:
Relation algebra reducts of cylindric algebras and complete representations. J. Symb. Log. 72(2): 673-703 (2007) - [j20]Robin Hirsch:
Peirce Algebras and Boolean Modules. J. Log. Comput. 17(2): 255-283 (2007) - [c6]Daniel J. Hulme, Robin Hirsch, Bernard F. Buxton, R. Beau Lotto:
A New Reduction from 3SAT to n-Partite Graphs. FOCI 2007: 235-238 - [c5]Laurence Hirsch, Robin Hirsch, Masoud Saeedi:
Evolving Lucene search queries for text classification. GECCO 2007: 1604-1611 - 2005
- [j19]Laurence Hirsch, Masoud Saeedi, Robin Hirsch:
Evolving Text Classification Rules with Genetic Programming. Appl. Artif. Intell. 19(7): 659-676 (2005) - [j18]Robin Hirsch:
The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable. Log. J. IGPL 13(2): 159-171 (2005) - [c4]Laurence Hirsch, Masoud Saeedi, Robin Hirsch:
Evolving Rules for Document Classification. EuroGP 2005: 85-95 - 2004
- [j17]Matteo Cristani, Robin Hirsch:
The complexity of constraint satisfaction problems for small relation algebras. Artif. Intell. 156(2): 177-196 (2004) - [c3]Laurence Hirsch, Masoud Saeedi, Robin Hirsch:
Evolving Text Classifiers with Genetic Programming. EuroGP 2004: 309-317 - 2002
- [j16]Robin Hirsch, Ian M. Hodkinson, Roger D. Maddux:
Provability with finitely many variables. Bull. Symb. Log. 8(3): 348-379 (2002) - [j15]Robin Hirsch, Ian M. Hodkinson, Roger D. Maddux:
Relation Algebra Reducts of Cylindric Algebras and An Application to Proof Theory. J. Symb. Log. 67(1): 197-213 (2002) - [j14]Robin Hirsch, Ian M. Hodkinson, Ágnes Kurucz:
On Modal Logics Between K x K x K and S5 x S5 x S5. J. Symb. Log. 67(1): 221-234 (2002) - 2001
- [j13]Robin Hirsch, Ian M. Hodkinson:
Relation algebras form cylindric algebras, I. Ann. Pure Appl. Log. 112(2-3): 225-266 (2001) - [j12]Robin Hirsch, Ian M. Hodkinson:
Relation algebras form cylindric algebras, II. Ann. Pure Appl. Log. 112(2-3): 267-297 (2001) - 2000
- [j11]Robin Hirsch:
Tractable approximations for temporal constraint handling. Artif. Intell. 116(1-2): 287-295 (2000) - [j10]Robin Hirsch, Ian M. Hodkinson:
Relation Algebras with n-Dimensional Relational Bases. Ann. Pure Appl. Log. 101(2-3): 227-274 (2000)
1990 – 1999
- 1999
- [j9]Robin Hirsch:
A Finite Relation Algebra with Undecidable Network Satisfaction Problem. Log. J. IGPL 7(4): 547-554 (1999) - 1998
- [c2]Robin Hirsch, Ian M. Hodkinson:
Connections between cylindric algebras and relation algebras. RelMiCS 1998: 100-105 - 1997
- [j8]Robin Hirsch, Ian M. Hodkinson:
Axiomatising Various Classes of Relation and Cylindric Algebras. Log. J. IGPL 5(2): 209-229 (1997) - [j7]Robin Hirsch, Ian M. Hodkinson:
Step by Step - Building Representations in Algebraic Logic. J. Symb. Log. 62(1): 225-279 (1997) - [j6]Robin Hirsch, Ian M. Hodkinson:
Complete Representations in Algebraic Logic. J. Symb. Log. 62(3): 816-847 (1997) - [j5]Robin Hirsch:
Expressive Power and Complexity in Algebraic Logic. J. Log. Comput. 7(3): 309-351 (1997) - [c1]Robin Hirsch:
The Finite Representable Relation Algebras are not Recursive (Abstract). RelMiCS 1997: 245 - 1996
- [j4]Robin Hirsch:
Relation Algebras of Intervals. Artif. Intell. 83(2): 267-295 (1996) - 1995
- [j3]Robin Hirsch:
Intractability in the Allen and Koomen Planner. Comput. Intell. 11: 553-564 (1995) - [j2]Robin Hirsch:
Completely Representable Relation Algebras. Log. J. IGPL 3(1): 77-92 (1995) - 1994
- [j1]Robin Hirsch:
From points to intervals. J. Appl. Non Class. Logics 4(1): 7-27 (1994)
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 22:10 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:
