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-04-01 to 2025-04-01.)

Article	Citations
Universal Equivalence and Majority of Probabilistic Programs over Finite Fields	16
A Reversible Perspective on Petri Nets and Event Structures	11
On Proof Complexity of Resolution over Polynomial Calculus	7
Strategic Knowledge Acquisition	7
Witnesses for Answer Sets of Logic Programs	6
Reasoning about Quality and Fuzziness of Strategic Behaviors	6
Local Search For Satisfiability Modulo Integer Arithmetic Theories	5
Verification of Distributed Quantum Programs	5
Symmetric Circuits for Rank Logic	5
Logics with Multiteam Semantics	4
Solving Promise Equations over Monoids and Groups	4
Products, Polynomials and Differential Equations in the Stream Calculus	4
MaxSAT Resolution and Subcube Sums	4
Computationally Hard Problems for Logic Programs under Answer Set Semantics	3
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation	3
Interpolation in Linear Logic and Related Systems	3
1-in-3 vs. Not-All-Equal : Dichotomy of a broken promise	3
The Iteration Number of the Weisfeiler-Leman Algorithm	3
Inputs, Outputs, and Composition in the Logic of Information Flows	3
Tractability Frontier of Data Complexity in Team Semantics	3
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus	3
Eager Equality for Rational Number Arithmetic	3
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation	3
Hypothetical Answers to Continuous Queries Over Data Streams	2
Probabilistic Temporal Reasoning Using Superposition Semantics	2

Interval Temporal Logic for Visibly Pushdown Systems	2
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	2
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas	2
A Saturation-Based Unification Algorithm for Higher-Order Rational Patterns	2
Complete Abstractions for Checking Language Inclusion	2
Graphs Identified by Logics with Counting	2
Logics for Temporal Information Systems in Rough Set Theory	2
Model-checking Strategic Abilities in Information-sharing Systems	2
A Generalized Realizability and Intuitionistic Logic	2
Strong Backdoors for Default Logic	2
Unifying Operational Weak Memory Verification: An Axiomatic Approach	2
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations	2
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics	2
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows	2
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework	2
From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics	2