ACM Transactions on Computational Logic

Papers
(The TQCC of ACM Transactions on Computational Logic is 3. 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
Probabilistic Temporal Reasoning Using Superposition Semantics6
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?6
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator6
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
Primal Logic of Information5
Asynchronous Announcements5
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
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas4
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
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
0.08710789680481