ACM Transactions on Computational Logic

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-12-01 to 2025-12-01.)
ArticleCitations
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation17
Reasoning about Quality and Fuzziness of Strategic Behaviors12
On Proof Complexity of Resolution over Polynomial Calculus11
Local Search For Satisfiability Modulo Integer Arithmetic Theories10
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions8
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator6
Probabilistic Temporal Reasoning Using Superposition Semantics6
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?6
Primal Logic of Information5
Asynchronous Announcements5
Good-for-Game QPTL: An Alternating Hodges Semantics5
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts5
Testing using CSP Models: Time, Inputs, and Outputs5
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas4
Counting of Teams in First-Order Team Logics4
A Generalized Realizability and Intuitionistic Logic4
Interval Temporal Logic for Visibly Pushdown Systems4
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows4
Closing Star-Free Closure3
First-Order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications3
Precise Subtyping for Asynchronous Multiparty Sessions3
Hypothetical Answers to Continuous Queries Over Data Streams3
Faster Property Testers in a Variation of the Bounded Degree Model3
An Axiomatic Theory for Reversible Computation3
Inputs, Outputs, and Composition in the Logic of Information Flows3
Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect3
Model and Program Repair via Group Actions and Structure Unwinding3
Spectrum of FO Logic with Quantifier Depth 4 is Finite3
Computationally Hard Problems for Logic Programs under Answer Set Semantics3
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic3
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework2
Intuitionistic Gödel-Löb without Sharps2
On the Complexity of Model Checking Knowledge and Time2
Modalities and Parametric Adjoints2
The Iteration Number of the Weisfeiler-Leman Algorithm2
Unifying Operational Weak Memory Verification: An Axiomatic Approach2
First-order Logic with Connectivity Operators2
Circular (Yet Sound) Proofs in Propositional Logic2
SAT Modulo Symmetries for Graph Generation and Enumeration2
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations2
Logics for Temporal Information Systems in Rough Set Theory2
Canonisation and Definability for Graphs of Bounded Rank Width2
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity2
Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics2
Products, Polynomials and Differential Equations in the Stream Calculus1
On Monotonic Determinacy and Rewritability for Recursive Queries and Views1
A Meta-theory for Big-step Semantics1
O-Minimal Invariants for Discrete-Time Dynamical Systems1
The Reachable Simulation Problem1
A Reversible Perspective on Petri Nets and Event Structures1
Verification of Distributed Quantum Programs1
Logics with Multiteam Semantics1
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth1
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types1
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus1
Invariant Checking for SMT-Based Systems with Quantifiers1
Model-checking Strategic Abilities in Information-sharing Systems1
Syntactic Completeness of Proper Display Calculi1
Compound Logics for Modification Problems1
0.15974402427673