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 2022-07-01 to 2026-07-01.)
ArticleCitations
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation18
On Proof Complexity of Resolution over Polynomial Calculus14
Reasoning about Quality and Fuzziness of Strategic Behaviors10
Local Search For Satisfiability Modulo Integer Arithmetic Theories9
Datalog-Expressibility for Monadic and Guarded Second-Order Logic8
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions7
Probabilistic Temporal Reasoning Using Superposition Semantics7
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?6
Good-for-Game QPTL: An Alternating Hodges Semantics6
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator6
Primal Logic of Information6
An Abstract Fixed-Point Theorem for Horn Formula Equations5
Dimensionality and Randomness5
A Generalized Realizability and Intuitionistic Logic4
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts4
Hypothetical Answers to Continuous Queries Over Data Streams4
Testing using CSP Models: Time, Inputs, and Outputs4
Counting of Teams in First-Order Team Logics4
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas3
Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect3
Equations over Finite Monoids with Infinite Promises3
Convex and Reverse Convex Prequadratics Constraints for Decidable Logics of Relations with Cardinalities3
Interval Temporal Logic for Visibly Pushdown Systems3
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic3
Reasoning about Parameterized Recursive Quantum Programs with Ancilla Data and Probabilistic Control3
Precise Subtyping for Asynchronous Multiparty Sessions3
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows3
Faster Property Testers in a Variation of the Bounded Degree Model3
Closing Star-Free Closure3
Model and Program Repair via Group Actions and Structure Unwinding3
0.93091297149658