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 2022-05-01 to 2026-05-01.)

Article	Citations
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation	16
On Proof Complexity of Resolution over Polynomial Calculus	13
Local Search For Satisfiability Modulo Integer Arithmetic Theories	9
Reasoning about Quality and Fuzziness of Strategic Behaviors	9
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	7
Datalog-Expressibility for Monadic and Guarded Second-Order Logic	7
Primal Logic of Information	6
Probabilistic Temporal Reasoning Using Superposition Semantics	6
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?	6
Good-for-Game QPTL: An Alternating Hodges Semantics	6
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator	6
Testing using CSP Models: Time, Inputs, and Outputs	5
An Abstract Fixed-Point Theorem for Horn Formula Equations	5
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows	4
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas	4
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts	4
A Generalized Realizability and Intuitionistic Logic	4
Dimensionality and randomness	4
Model and Program Repair via Group Actions and Structure Unwinding	3
Hypothetical Answers to Continuous Queries Over Data Streams	3
Faster Property Testers in a Variation of the Bounded Degree Model	3
Precise Subtyping for Asynchronous Multiparty Sessions	3
Counting of Teams in First-Order Team Logics	3
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic	3
An Axiomatic Theory for Reversible Computation	3

Interval Temporal Logic for Visibly Pushdown Systems	3
Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect	3
Closing Star-Free Closure	3
Decidability of Graph Neural Networks via Logical Characterizations	2
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations	2
Unifying Operational Weak Memory Verification: An Axiomatic Approach	2
Spectrum of FO Logic with Quantifier Depth 4 is Finite	2
Inputs, Outputs, and Composition in the Logic of Information Flows	2
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework	2
The Iteration Number of the Weisfeiler-Leman Algorithm	2
First-Order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications	2
Computationally Hard Problems for Logic Programs under Answer Set Semantics	2
Logics for Temporal Information Systems in Rough Set Theory	2
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity	1
Intuitionistic Gödel-Löb without Sharps	1
On Monotonic Determinacy and Rewritability for Recursive Queries and Views	1
Products, Polynomials and Differential Equations in the Stream Calculus	1
SAT Modulo Symmetries for Graph Generation and Enumeration	1
Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics	1
First-order Logic with Connectivity Operators	1
Circular (Yet Sound) Proofs in Propositional Logic	1
Cyclic Implicit Complexity	1
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus	1
Canonisation and Definability for Graphs of Bounded Rank Width	1
Reactive model-based testing of cyclic systems	1
Model-checking Strategic Abilities in Information-sharing Systems	1
Invariant Checking for SMT-Based Systems with Quantifiers	1
A Reversible Perspective on Petri Nets and Event Structures	1
On the Complexity of Model Checking Knowledge and Time	1