Balder ten Cate

2.7k total citations
90 papers, 1.2k citations indexed

About

Balder ten Cate is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Balder ten Cate has authored 90 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 81 papers in Artificial Intelligence, 36 papers in Computational Theory and Mathematics and 35 papers in Computer Networks and Communications. Recurrent topics in Balder ten Cate's work include Logic, Reasoning, and Knowledge (46 papers), Semantic Web and Ontologies (39 papers) and Advanced Database Systems and Queries (32 papers). Balder ten Cate is often cited by papers focused on Logic, Reasoning, and Knowledge (46 papers), Semantic Web and Ontologies (39 papers) and Advanced Database Systems and Queries (32 papers). Balder ten Cate collaborates with scholars based in United States, Netherlands and United Kingdom. Balder ten Cate's co-authors include Phokion G. Kolaitis, M. Marx, Wang-Chiew Tan, Carsten Lutz, Bogdan Alexe, Víctor Dalmau, Benny Kimelfeld, Patrick Blackburn, Dan Olteanu and Luc Segoufin and has published in prestigious journals such as Communications of the ACM, Journal of the ACM and Proceedings of the VLDB Endowment.

In The Last Decade

Balder ten Cate

83 papers receiving 1.1k citations

Peers

Balder ten Cate
Reinhard Pichler Austria
Frank Neven Belgium
Thomas Schwentick Germany
Wim Martens Germany
Luc Segoufin France
Jeff Naughton United States
Nicolas Spyratos France
Stavros S. Cosmadakis United States
Rodney Topor Australia
Austin Melton United States
Reinhard Pichler Austria
Balder ten Cate
Citations per year, relative to Balder ten Cate Balder ten Cate (= 1×) peers Reinhard Pichler

Countries citing papers authored by Balder ten Cate

Since Specialization
Citations

This map shows the geographic impact of Balder ten Cate's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Balder ten Cate with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Balder ten Cate more than expected).

Fields of papers citing papers by Balder ten Cate

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Balder ten Cate. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Balder ten Cate. The network helps show where Balder ten Cate may publish in the future.

Co-authorship network of co-authors of Balder ten Cate

This figure shows the co-authorship network connecting the top 25 collaborators of Balder ten Cate. A scholar is included among the top collaborators of Balder ten Cate based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Balder ten Cate. Balder ten Cate is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Cate, Balder ten, et al.. (2025). Algebras for Deterministic Computation Are Inherently Incomplete. Proceedings of the ACM on Programming Languages. 9(POPL). 718–744. 2 indexed citations
2.
Bogaerts, Bart, et al.. (2024). Preservation theorems for Tarski's relation algebra. Logical Methods in Computer Science. Volume 20, Issue 3.
3.
Bárány, Vince, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, & Zografoula Vagena. (2016). Declarative Probabilistic Programming with Datalog. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 10 indexed citations
4.
Cate, Balder ten, Benny Kimelfeld, & Dan Olteanu. (2015). PPDL: Probabilistic Programming with Datalog.. 1 indexed citations
5.
Segoufin, Luc & Balder ten Cate. (2013). Unary negation. Logical Methods in Computer Science. Volume 9, Issue 3. 13 indexed citations
6.
Cate, Balder ten, Phokion G. Kolaitis, & Walied Othman. (2013). Data exchange with arithmetic operations. 20. 537–548. 10 indexed citations
7.
Cate, Balder ten, et al.. (2012). Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees. Logical Methods in Computer Science. Volume 8, Issue 4. 1 indexed citations
8.
Cate, Balder ten, Enrico Franconi, & İnanç Seylan. (2011). Beth Definability in Expressive Description Logics. View. 10 indexed citations
9.
Cate, Balder ten, et al.. (2009). On Core XPath with Inflationary Fixed Points.. UvA-DARE (University of Amsterdam). 11–17. 1 indexed citations
10.
Cate, Balder ten, et al.. (2009). Modal languages for topology: Expressivity and definability. Annals of Pure and Applied Logic. 159(1-2). 146–170. 14 indexed citations
11.
Benthem, Johan van, Balder ten Cate, & Jouko Väänánen. (2009). Lindstrom theorems for fragments of first-order logic. Logical Methods in Computer Science. Volume 5, Issue 3. 5 indexed citations
12.
Cate, Balder ten, et al.. (2009). Complete axiomatizations for XPath fragments. Journal of Applied Logic. 8(2). 153–172. 5 indexed citations
13.
Cate, Balder ten, et al.. (2008). The importance of being discrete. 3 indexed citations
14.
Cate, Balder ten & Henk Zeevat. (2007). Logic, Language, and Computation: 6th International Tbilisi Symposium on Logic, Language, and Computation,TbiLLC 2005 Batumi, Georgia, September 12-16, 2005. Revised Selected Papers. Springer eBooks. 2 indexed citations
15.
Cate, Balder ten, Johan van Benthem, & Jouko Väänánen. (2007). Lindstrom theorems for fragments of first-order logic. 41. 280–292. 5 indexed citations
16.
Cate, Balder ten, Willem Conradie, M. Marx, & Yde Venema. (2006). Definitorially complete description logics. Principles of Knowledge Representation and Reasoning. 79–89. 38 indexed citations
17.
Cate, Balder ten & Massimo Franceschet. (2005). On the Complexity of hybrid logics with binders. Technical reports. 22 indexed citations
18.
Cate, Balder ten, et al.. (2004). Guarded fragments with constants. UvA-DARE (University of Amsterdam). 2 indexed citations
19.
Benthem, J.F.A.K. van, et al.. (2004). Modal Logics for Products of Topologies. UvA-DARE (University of Amsterdam). 6 indexed citations
20.
Cate, Balder ten, et al.. (2002). On the logic of d-separation. Principles of Knowledge Representation and Reasoning. 568–577. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Reinhard Pichler Breakdown of academic impact, for papers by Frank Neven Breakdown of academic impact, for papers by Thomas Schwentick Breakdown of academic impact, for papers by Wim Martens Breakdown of academic impact, for papers by Luc Segoufin Breakdown of academic impact, for papers by Jeff Naughton Breakdown of academic impact, for papers by Nicolas Spyratos Breakdown of academic impact, for papers by Stavros S. Cosmadakis Breakdown of academic impact, for papers by Rodney Topor Breakdown of academic impact, for papers by Austin Melton
Rankless by CCL
2026