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 2020-05-01 to 2024-05-01.)
ArticleCitations
Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic14
First-Order Interpretations of Bounded Expansion Classes13
Principles of KLM-style Defeasible Description Logics10
Action Logic is Undecidable7
Unifying Operational Weak Memory Verification: An Axiomatic Approach7
Inputs and Outputs in CSP6
A New Perspective on FO Model Checking of Dense Graph Classes6
Strategy Logic with Imperfect Information6
Slanted Canonicity of Analytic Inductive Inequalities6
Verification of Distributed Quantum Programs6
Applying Visible Strong Equivalence in Answer-Set Program Transformations5
Non-well-founded Proof Theory of Transitive Closure Logic5
Syntactic Completeness of Proper Display Calculi4
Logics with Multiteam Semantics4
Beyond Uniform Equivalence between Answer-set Programs3
Witnesses for Answer Sets of Logic Programs3
Testing using CSP Models: Time, Inputs, and Outputs3
A Meta-theory for Big-step Semantics3
Generalized Realizability and Basic Logic3
Logics for Temporal Information Systems in Rough Set Theory3
Small Circuits and Dual Weak PHP in the Universal Theory of p-time Algorithms2
From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics2
Stratification in Approximation Fixpoint Theory and Its Application to Active Integrity Constraints2
Precise Subtyping for Asynchronous Multiparty Sessions2
SAT-Inspired Eliminations for Superposition2
Inference from Visible Information and Background Knowledge2
Tractability Frontier of Data Complexity in Team Semantics2
Asynchronous Announcements2
O-Minimal Invariants for Discrete-Time Dynamical Systems2
Complete Abstractions for Checking Language Inclusion2
Precise Subtyping for Asynchronous Multiparty Sessions2
Modalities and Parametric Adjoints2
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic2
0.063788890838623