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

Article	Citations
On Proof Complexity of Resolution over Polynomial Calculus	16
Strategic Knowledge Acquisition	11
Reasoning about Quality and Fuzziness of Strategic Behaviors	8
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation	8
Local Search For Satisfiability Modulo Integer Arithmetic Theories	7
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation	5
Good-for-Game QPTL: An Alternating Hodges Semantics	5
Probabilistic Temporal Reasoning Using Superposition Semantics	5
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	5
Tractability Frontier of Data Complexity in Team Semantics	5
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator	5
Kripke Semantics for Intersection Formulas	4
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?	4
Primal Logic of Information	4
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows	3
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic	3
Testing using CSP Models: Time, Inputs, and Outputs	3
A Generalized Realizability and Intuitionistic Logic	3
Reiterman’s Theorem on Finite Algebras for a Monad	3
Interval Temporal Logic for Visibly Pushdown Systems	3
Hypothetical Answers to Continuous Queries Over Data Streams	3
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts	3
Faster Property Testers in a Variation of the Bounded Degree Model	3
Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect	3
Asynchronous Announcements	3

Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas	3
Spectrum of FO Logic with Quantifier Depth 4 is Finite	2
A Formal System for the Universal Quantification of Schematic Variables	2
Closing star-free closure	2
The Iteration Number of the Weisfeiler-Leman Algorithm	2
Unifying Operational Weak Memory Verification: An Axiomatic Approach	2
Computationally Hard Problems for Logic Programs under Answer Set Semantics	2
An Axiomatic Theory for Reversible Computation	2
Precise Subtyping for Asynchronous Multiparty Sessions	2
First-Order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications	2
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework	2
Logics for Temporal Information Systems in Rough Set Theory	2
Display to Labeled Proofs and Back Again for Tense Logics	2
Model and Program Repair via Group Actions and Structure Unwinding	2
Inputs, Outputs, and Composition in the Logic of Information Flows	2
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations	2
Generalized Realizability and Basic Logic	2
SAT Modulo Symmetries for Graph Generation and Enumeration	1
Symmetric Circuits for Rank Logic	1
Products, Polynomials and Differential Equations in the Stream Calculus	1
First-order Logic with Connectivity Operators	1
On the Complexity of Model Checking Knowledge and Time	1
Modalities and Parametric Adjoints	1
On Monotonic Determinacy and Rewritability for Recursive Queries and Views	1
Model-checking Strategic Abilities in Information-sharing Systems	1
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus	1
Logics with Multiteam Semantics	1
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces	1
Local Belief Dynamics in Network Knowledge Bases	1
Circular (Yet Sound) Proofs in Propositional Logic	1
A Reversible Perspective on Petri Nets and Event Structures	1
Verification of Distributed Quantum Programs	1
The Reachable Simulation Problem	1
Invariant Checking for SMT-Based Systems with Quantifiers	1
Slanted Canonicity of Analytic Inductive Inequalities	1
Canonisation and Definability for Graphs of Bounded Rank Width	1
Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics	1
Lower Bounds on OBDD Proofs with Several Orders	1