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

Article	Citations
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation	18
Reasoning about Quality and Fuzziness of Strategic Behaviors	15
Local Search For Satisfiability Modulo Integer Arithmetic Theories	11
Datalog-Expressibility for Monadic and Guarded Second-Order Logic	9
Probabilistic Temporal Reasoning Using Superposition Semantics	8
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	8
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?	7
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator	7
Primal Logic of Information	7
Good-for-Game QPTL: An Alternating Hodges Semantics	6
An Abstract Fixed-Point Theorem for Horn Formula Equations	6
Dimensionality and Randomness	5
Testing using CSP Models: Time, Inputs, and Outputs	5
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts	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
Counting of Teams in First-Order Team Logics	4
Closing Star-Free Closure	3
Convex and Reverse Convex Prequadratics Constraints for Decidable Logics of Relations with Cardinalities	3
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows	3
Equations over Finite Monoids with Infinite Promises	3
An Axiomatic Theory for Reversible Computation	3
Precise Subtyping for Asynchronous Multiparty Sessions	3

Model and Program Repair via Group Actions and Structure Unwinding	3
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic	3
Reasoning about Parameterized Recursive Quantum Programs with Ancilla Data and Probabilistic Control	3
Spectrum of FO Logic with Quantifier Depth 4 is Finite	3
Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect	3
Faster Property Testers in a Variation of the Bounded Degree Model	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
Decidability of Graph Neural Networks via Logical Characterizations	2
Computationally Hard Problems for Logic Programs under Answer Set Semantics	2
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations	2
Inputs, Outputs, and Composition in the Logic of Information Flows	2
Reactive Model-Based Testing of Cyclic Systems	2
Logics for Temporal Information Systems in Rough Set Theory	2
On the Complexity of Model Checking Knowledge and Time	1
On Monotonic Determinacy and Rewritability for Recursive Queries and Views	1
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types	1
Foundations for an Abstract Proof Theory in the Context of Horn Rules	1
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus	1
Intuitionistic Gödel-Löb without Sharps	1
A Two-Level Linear Dependent Type Theory	1
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity	1
Model-checking Strategic Abilities in Information-sharing Systems	1
Syntactic Completeness of Proper Display Calculi	1
Cyclic Implicit Complexity	1
Products, Polynomials and Differential Equations in the Stream Calculus	1
Model Checking Probabilistic Operator Precedence Automata	1
First-order Logic with Connectivity Operators	1
Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics	1
Circular (Yet Sound) Proofs in Propositional Logic	1
Invariant Checking for SMT-Based Systems with Quantifiers	1
The Reachable Simulation Problem	1
A Reversible Perspective on Petri Nets and Event Structures	1
SAT Modulo Symmetries for Graph Generation and Enumeration	1
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework	1
Canonisation and Definability for Graphs of Bounded Rank Width	1