OOIR: Observatory of International Research

Papers

(The TQCC of ACM Transactions on Computational Logic is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-02-01 to 2025-02-01.)

Article	Citations
The Iteration Number of the Weisfeiler-Leman Algorithm	15
Reasoning about Quality and Fuzziness of Strategic Behaviors	10
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation	7
Inputs, Outputs, and Composition in the Logic of Information Flows	6
Eager Equality for Rational Number Arithmetic	6
Products, Polynomials and Differential Equations in the Stream Calculus	5
Logics with Multiteam Semantics	5
A Reversible Perspective on Petri Nets and Event Structures	4
Universal Equivalence and Majority of Probabilistic Programs over Finite Fields	4
Witnesses for Answer Sets of Logic Programs	4
Verification of Distributed Quantum Programs	4
Solving Promise Equations over Monoids and Groups	3
Local Search For Satisfiability Modulo Integer Arithmetic Theories	3
Tractability Frontier of Data Complexity in Team Semantics	3
Computationally Hard Problems for Logic Programs under Answer Set Semantics	3
On Proof Complexity of Resolution over Polynomial Calculus	3
Strategic Knowledge Acquisition	3
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus	3
Interpolation in Linear Logic and Related Systems	3
MaxSAT Resolution and Subcube Sums	3
Symmetric Circuits for Rank Logic	3
A Generalized Realizability and Intuitionistic Logic	2
A Saturation-Based Unification Algorithm for Higher-Order Rational Patterns	2
Interval Temporal Logic for Visibly Pushdown Systems	2
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas	2

Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics	2
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework	2
Probabilistic Temporal Reasoning using Superposition Semantics	2
Logics for Temporal Information Systems in Rough Set Theory	2
Unifying Operational Weak Memory Verification: An Axiomatic Approach	2
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows	2
Strong Backdoors for Default Logic	2
Complete Abstractions for Checking Language Inclusion	2
From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics	2