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

Article	Citations
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation	17
Reasoning about Quality and Fuzziness of Strategic Behaviors	12
Local Search For Satisfiability Modulo Integer Arithmetic Theories	8
Tractability Frontier of Data Complexity in Team Semantics	8
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	6
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation	6
On Proof Complexity of Resolution over Polynomial Calculus	6
Probabilistic Temporal Reasoning Using Superposition Semantics	5
Good-for-Game QPTL: An Alternating Hodges Semantics	5
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator	5
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?	5
Testing using CSP Models: Time, Inputs, and Outputs	4
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts	4
Primal Logic of Information	4
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas	4
Asynchronous Announcements	4
A Generalized Realizability and Intuitionistic Logic	4
Hypothetical Answers to Continuous Queries Over Data Streams	3
Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect	3
Model and Program Repair via Group Actions and Structure Unwinding	3
A Formal System for the Universal Quantification of Schematic Variables	3
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
Precise Subtyping for Asynchronous Multiparty Sessions	3
Reiterman’s Theorem on Finite Algebras for a Monad	3

Interval Temporal Logic for Visibly Pushdown Systems	3
Faster Property Testers in a Variation of the Bounded Degree Model	3
An Axiomatic Theory for Reversible Computation	3
First-Order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications	2
The Iteration Number of the Weisfeiler-Leman Algorithm	2
Unifying Operational Weak Memory Verification: An Axiomatic Approach	2
Generalized Realizability and Basic Logic	2
Inputs, Outputs, and Composition in the Logic of Information Flows	2
Spectrum of FO Logic with Quantifier Depth 4 is Finite	2
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework	2
First-order Logic with Connectivity Operators	2
Logics for Temporal Information Systems in Rough Set Theory	2
Closing Star-Free Closure	2
Computationally Hard Problems for Logic Programs under Answer Set Semantics	2
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations	2
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces	2
A Reversible Perspective on Petri Nets and Event Structures	1
Symmetric Circuits for Rank Logic	1
Circular (Yet Sound) Proofs in Propositional Logic	1
Local Belief Dynamics in Network Knowledge Bases	1
Intuitionistic Gödel-Löb Without Sharps	1
Invariant Checking for SMT-Based Systems with Quantifiers	1
Syntactic Completeness of Proper Display Calculi	1
Model-checking Strategic Abilities in Information-sharing Systems	1
Products, Polynomials and Differential Equations in the Stream Calculus	1
Modalities and Parametric Adjoints	1
Canonisation and Definability for Graphs of Bounded Rank Width	1
On Monotonic Determinacy and Rewritability for Recursive Queries and Views	1
Verification of Distributed Quantum Programs	1
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth	1
The Reachable Simulation Problem	1
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus	1
SAT Modulo Symmetries for Graph Generation and Enumeration	1
Lower Bounds on OBDD Proofs with Several Orders	1
Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics	1
On the Complexity of Model Checking Knowledge and Time	1
Logics with Multiteam Semantics	1
A Meta-theory for Big-step Semantics	1