ACM Transactions on Computational Logic

Papers
(The TQCC of ACM Transactions on Computational Logic is 2. 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-06-01 to 2025-06-01.)
ArticleCitations
On Proof Complexity of Resolution over Polynomial Calculus16
Strategic Knowledge Acquisition11
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation8
Reasoning about Quality and Fuzziness of Strategic Behaviors8
Local Search For Satisfiability Modulo Integer Arithmetic Theories7
Probabilistic Temporal Reasoning Using Superposition Semantics5
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions5
Tractability Frontier of Data Complexity in Team Semantics5
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator5
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation5
Good-for-Game QPTL: An Alternating Hodges Semantics5
Primal Logic of Information4
Kripke Semantics for Intersection Formulas4
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?4
Hypothetical Answers to Continuous Queries Over Data Streams3
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts3
Faster Property Testers in a Variation of the Bounded Degree Model3
Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect3
Asynchronous Announcements3
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas3
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows3
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic3
Testing using CSP Models: Time, Inputs, and Outputs3
A Generalized Realizability and Intuitionistic Logic3
Reiterman’s Theorem on Finite Algebras for a Monad3
Interval Temporal Logic for Visibly Pushdown Systems3
An Axiomatic Theory for Reversible Computation2
Precise Subtyping for Asynchronous Multiparty Sessions2
First-Order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications2
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework2
Logics for Temporal Information Systems in Rough Set Theory2
Display to Labeled Proofs and Back Again for Tense Logics2
Model and Program Repair via Group Actions and Structure Unwinding2
Inputs, Outputs, and Composition in the Logic of Information Flows2
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations2
Generalized Realizability and Basic Logic2
Spectrum of FO Logic with Quantifier Depth 4 is Finite2
A Formal System for the Universal Quantification of Schematic Variables2
Closing star-free closure2
The Iteration Number of the Weisfeiler-Leman Algorithm2
Unifying Operational Weak Memory Verification: An Axiomatic Approach2
Computationally Hard Problems for Logic Programs under Answer Set Semantics2
0.35179591178894