OOIR: Observatory of International Research

Papers

(The median citation count of ACM Transactions on Computational Logic is 1. 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
Eager Equality for Rational Number Arithmetic	6
Inputs, Outputs, and Composition in the Logic of Information Flows	6
Logics with Multiteam Semantics	5
Products, Polynomials and Differential Equations in the Stream Calculus	5
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
A Reversible Perspective on Petri Nets and Event Structures	4
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
Solving Promise Equations over Monoids and Groups	3
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
A Generalized Realizability and Intuitionistic Logic	2
A Saturation-Based Unification Algorithm for Higher-Order Rational Patterns	2
The Intersection of Algorithmically Random Closed Sets and Effective Dimension	1
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	1
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations	1
Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision	1
Fundamental Logic Is Decidable	1
Inference from Visible Information and Background Knowledge	1
Canonisation and Definability for Graphs of Bounded Rank Width	1
Linear Logic Properly Displayed	1
Generalized Realizability and Basic Logic	1
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth	1
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces	1
Model-checking Strategic Abilities in Information-sharing Systems	1
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation	1
Reiterman’s Theorem on Finite Algebras for a Monad	1
A Subatomic Proof System for Decision Trees	1
Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic	1
Generating Extended Resolution Proofs with a BDD-Based SAT Solver	1
A Meta-theory for Big-step Semantics	1
Satisfiability Problems on Sums of Kripke Frames	1
Graphs Identified by Logics with Counting	1
Hypothetical Answers to Continuous Queries Over Data Streams	1
Reasoning about Petri Nets: A Calculus Based on Resolution and Dynamic Logic	1
Local Belief Dynamics in Network Knowledge Bases	1
Algebraic Proof Theory for LE-logics	1
First-order Logic with Connectivity Operators	1
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator	1
Syntactic Completeness of Proper Display Calculi	1
Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect	1