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

Article	Citations
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation	17
Reasoning about Quality and Fuzziness of Strategic Behaviors	12
Datalog-Expressibility for Monadic and Guarded Second-Order Logic	11
On Proof Complexity of Resolution over Polynomial Calculus	11
Local Search For Satisfiability Modulo Integer Arithmetic Theories	8
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	7
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator	6
Probabilistic Temporal Reasoning Using Superposition Semantics	6
Primal Logic of Information	5
Testing using CSP Models: Time, Inputs, and Outputs	5
Good-for-Game QPTL: An Alternating Hodges Semantics	5
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts	5
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?	5
An abstract fixed-point theorem for Horn formula equations	5
Asynchronous Announcements	5
A Generalized Realizability and Intuitionistic Logic	4
Interval Temporal Logic for Visibly Pushdown Systems	4
Hypothetical Answers to Continuous Queries Over Data Streams	4
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas	4
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows	4
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic	3
Closing Star-Free Closure	3
Spectrum of FO Logic with Quantifier Depth 4 is Finite	3
Model and Program Repair via Group Actions and Structure Unwinding	3
Faster Property Testers in a Variation of the Bounded Degree Model	3

An Axiomatic Theory for Reversible Computation	3
Precise Subtyping for Asynchronous Multiparty Sessions	3
Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect	3
Counting of Teams in First-Order Team Logics	3
First-Order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications	3
Inputs, Outputs, and Composition in the Logic of Information Flows	2
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations	2
First-order Logic with Connectivity Operators	2
On the Complexity of Model Checking Knowledge and Time	2
Intuitionistic Gödel-Löb without Sharps	2
Computationally Hard Problems for Logic Programs under Answer Set Semantics	2
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework	2
Canonisation and Definability for Graphs of Bounded Rank Width	2
Circular (Yet Sound) Proofs in Propositional Logic	2
Logics for Temporal Information Systems in Rough Set Theory	2
The Iteration Number of the Weisfeiler-Leman Algorithm	2
Unifying Operational Weak Memory Verification: An Axiomatic Approach	2
Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics	2
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity	2
O-Minimal Invariants for Discrete-Time Dynamical Systems	1
The Reachable Simulation Problem	1
Products, Polynomials and Differential Equations in the Stream Calculus	1
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus	1
On Monotonic Determinacy and Rewritability for Recursive Queries and Views	1
Model-checking Strategic Abilities in Information-sharing Systems	1
Syntactic Completeness of Proper Display Calculi	1
A Meta-theory for Big-step Semantics	1
Logics with Multiteam Semantics	1
SAT Modulo Symmetries for Graph Generation and Enumeration	1
A Reversible Perspective on Petri Nets and Event Structures	1
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types	1
Verification of Distributed Quantum Programs	1
Invariant Checking for SMT-Based Systems with Quantifiers	1
Modalities and Parametric Adjoints	1
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth	1